Ernesto Estrada (scientist)
![]() | This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these template messages)
|
Ernesto Estrada | |
---|---|
![]() | |
Born | Sancti Spiritus, Cuba | 2 May 1966
Nationality | Cuba, Spain |
Ernesto Estrada (born 2 May 1966) is a Cuban-Spanish scientist. He has been Senior ARAID Researcher at the Institute of Mathematics and Applications at the University of Zaragoza, Spain since 2019. Before that he was the chair in Complexity Science, and full professor at the Department of Mathematics and Statistics of the University of Strathclyde, Glasgow, United Kingdom. He is known by his contributions in different disciplines, including mathematical chemistry and complex network theory.
Birth and education
[edit]Estrada was born in the city of Sancti Spiritus, in the central region of Cuba. Since the age of 11 he studied in a school which specialized in exact sciences. He later studied for a technical degree in Analytical chemistry in the technological institute IPQI Mártires de Girón Havana. At the age of 18 years, and before entering the university, he presented his first scientific paper in an international congress together with his mentor, Dr. Jose F. Fernández-Bertrán. The paper was about the detection of polyatomic anions in matrices of NaCl using Infrared spectroscopy. Between 1985 and 1990, he studied chemical sciences at the Central University of Las Villas in Santa Clara, Cuba, where he obtained his degree in only 4 of the 5 years established for the program. In the first years after graduation, Estrada investigated on the organic synthesis and the use of spectroscopy for the characterization of new chemical entities with pharmacological activity. This research introduced him to the world of Computational chemistry due to the requirement of using efficient methods for drug design and drug discovery. He is one of the co-authors of the patent for the bactericide and fungicide drug Furvina.[1] In 1997, he obtained his PhD in Mathematical chemistry under the direction of Luis A. Montero Cabrera on the topic of "Graph Theory Applied to Molecular Design".[citation needed]
Academic career
[edit]After completing his PhD, Estrada spent some time as Research fellow at the University of Valencia, Spain with Prof. Jorge Galvez working on drug design and at the Hebrew University of Jerusalem with Prof. David Avnir working on molecular symmetry numbers and rotational partition functions. In 2000, he emigrated to Spain. Between 2002 and 2003, Estrada worked as a scientist at the Safety and Environmental Assurance Centre, Unilever in Colworth, U.K. He then obtained a position as "Ramón y Cajal" researcher at the University of Santiago de Compostela, Spain. Between 2008 and 2018, Estrada occupied the chair in Complexity Science at the University of Strathclyde. In 2019 he became ARAID[2] Researcher at the University of Zaragoza. In 2021 he incorporated to the IFISC research staff.[3]
Research and achievements
[edit]Estrada has been a major contributor in the study of complex networks, where he has developed several approaches to investigate the network topology and network dynamics. An index introduced by him in 1999 to characterize the degree of protein folding, and then generalized to the study of complex networks in 2005,[4] is nowadays widely known as the Estrada index of a graph or network. Estrada is also known in the field of spectral graph theory where he has introduced several approaches to characterize the organizational architecture of Complex networks, such as the "subgraph centrality",[5] "communicability",[6] "spectral scaling",[7] among others. His generalization of the discrete Laplace operator, as the d-path Laplacians and their transforms,[8] has opened several new avenues for studying long-range interactions in network dynamics.
Estrada is also known in the area of mathematical chemistry, in particular for the development and use of molecular descriptors based on the use of Graph Theory. In recent years he has developed mathematical approaches for the Hückel method or tight binding model, such as for "graph energy",[9] "density matrix",[10] "quantum molecular interference" in molecular electronics,[11] among others. The last work is in collaboration with Roald Hoffmann.
Awards and Distinctions
[edit]- 2005, Elected Member of the International Academy of Mathematical Chemistry.[12]
- 2007, Recipient of the Prize as Outstanding Scientist, International Academy of Mathematical Chemistry in recognition for "his valuable contributions in developing and applying graph theory to solve problems in many interdisciplinary areas, such as chemistry, physics, biology, ecology and technology".[13]
- 2014, Recipient of the Royal Society Wolfson Research Merit Award of the Royal Society of London, which recognises "scientists of outstanding achievement and potential".[14]
- 2014, Elected as Member of the Academia Europaea.[15]
- 2019, Elected as Member of the Latin American Academy of Science.[16]
- 2019, Elected SIAM Fellow "for outstanding contributions to mathematical chemistry and network science".[17]
Editorial Activities
[edit]- Editor-in-Chief, Journal of Complex Networks, Oxford University Press.[18]
- Editorial Board, MATCH. Communications in Mathematical and in Computer Chemistry.[19]
- Editorial Board, SIAM Journal on Applied Mathematics.[20]
- Editorial Board, Proceedings of the Royal Society, A.[21]
- Editorial Board, Mathematics.[22]
Books
[edit]- 2011. The Structure of Complex Networks. Theory and Applications. Oxford University Press.[23]
- 2015. A First Course in Network Theory. Oxford University Press, with P. Knight.[24]
References
[edit]- ^ "Furvina".
- ^ "ARAID Foundation".
- ^ "IFISC web page".
- ^ Estrada, E.; Rodríguez-Velázquez, J. A. (2005). "Subgraph centrality in complex networks". Physical Review E. 71 (5 Pt 2): 056103. arXiv:cond-mat/0504730. Bibcode:2005PhRvE..71e6103E. doi:10.1103/PhysRevE.71.056103. PMID 16089598. S2CID 4512786.
- ^ Estrada, E.; Rodríguez-Velázquez, J. A. (2005). "Subgraph centrality in complex networks". Physical Review E. 71 (5 Pt 2): 056103. arXiv:cond-mat/0504730. Bibcode:2005PhRvE..71e6103E. doi:10.1103/PhysRevE.71.056103. PMID 16089598. S2CID 4512786.
- ^ Estrada, E.; Hatano, N. (2008). "Communicability in complex networks". Physical Review E. 77 (3 Pt 2): 036111. arXiv:0707.0756. Bibcode:2008PhRvE..77c6111E. doi:10.1103/PhysRevE.77.036111. PMID 18517465. S2CID 4494981.
- ^ Estrada, Ernesto (2005). "Spectral scaling and good expansion properties in complex networks". EPL. 73 (4): 649–655. arXiv:cond-mat/0505033. doi:10.1209/epl/i2005-10441-3. S2CID 119041623.
- ^ Estrada, Ernesto (May 2012). "Path Laplacian matrices: Introduction and application to the analysis of consensus in networks". Linear Algebra and Its Applications. 436 (9): 3373–3391. doi:10.1016/j.laa.2011.11.032.
- ^ Estrada, Ernesto; Benzi, Michele (30 October 2017). "What is the meaning of the graph energy after all?". Discrete Applied Mathematics. 230: 71–77. arXiv:1704.00779. doi:10.1016/j.dam.2017.06.007. S2CID 23744880.
- ^ Estrada, Ernesto (28 February 2018). "The electron density function of the Hückel (tight-binding) model". Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 474 (2210). Bibcode:2018RSPSA.47470721E. doi:10.1098/rspa.2017.0721. S2CID 4531623.
- ^ Tsuji, Y.; Estrada, E.; Movassagh, R.; Hoffmann, R. (2018). "Quantum Interference, Graphs, Walks, and Polynomials". Chemical Reviews. 118 (10): 4887–4911. arXiv:1804.09234. doi:10.1021/acs.chemrev.7b00733. PMID 29630345. S2CID 4738877.
- ^ "Members of the IAMC".
- ^ "Awards of IAMC".
- ^ "Royal Society announces latest recipients of esteemed Wolfson Research Merit Award".
- ^ "members of Academia Europaea".
- ^ "Members of ACAL".
- ^ "SIAM Fellows Class of 2019". Retrieved 1 September 2019.
- ^ "Journal of Complex Networks".
- ^ "MATCH: Comm. Math. Comput. Chem".
- ^ "SIAM J. Appl. Math".
- ^ "Proc. R. Soc. A".
- ^ "Mathematics".
- ^ The Structure of Complex Networks. Theory and Applications. Oxford University Press. 9 June 2016. ISBN 978-0-19-878380-0.
- ^ A First Course in Network Theory. Oxford University Press. 26 March 2015. ISBN 978-0-19-872646-3.
External links
[edit]![](http://upload.wikimedia.org/wikipedia/en/thumb/4/4a/Commons-logo.svg/30px-Commons-logo.svg.png)