Ernesto Estrada

Orcid: 0000-0002-3066-7418

According to our database1, Ernesto Estrada authored at least 87 papers between 1995 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Communicability cosine distance: similarity and symmetry in graphs/networks.
Comput. Appl. Math., February, 2024

Signed graphs in data sciences via communicability geometry.
CoRR, 2024

2023
What Is in a Simplicial Complex? A Metaplex-Based Approach to Its Structure and Dynamics.
Entropy, December, 2023

2022
Network bypasses sustain complexity.
CoRR, 2022

From networked SIS model to the Gompertz function.
Appl. Math. Comput., 2022

2021
The world-wide waste web.
CoRR, 2021

Informational cost and networks navigability.
Appl. Math. Comput., 2021

2020
Metaplex Networks: Influence of the Exo-Endo Structure of Complex Systems on Diffusion.
SIAM Rev., 2020

Risk-Dependent Centrality in Economic and Financial Networks.
SIAM J. Financial Math., 2020

Hubs-attracting Laplacian and Related Synchronization on Networks.
SIAM J. Appl. Dyn. Syst., 2020

Erratum to: Cascading failures in complex networks.
J. Complex Networks, 2020

A density-based statistical analysis of graph clustering algorithm performance.
J. Complex Networks, 2020

Non-local network dynamics via fractional graph Laplacians.
J. Complex Networks, 2020

Network entropy using edge-based information functionals.
J. Complex Networks, 2020

2019
Visualization and machine learning analysis of complex networks in hyperspherical space.
Pattern Recognit., 2019

Rethinking structural balance in signed social networks.
Discret. Appl. Math., 2019

Second-order consensus protocols based on transformed <i>d</i>-path Laplacians.
Appl. Math. Comput., 2019

"Melting" of complex networks. A mathematical model of complex networks resilience to external stress.
Appl. Math. Comput., 2019

2018
Long-Range Interactions and Network Synchronization.
SIAM J. Appl. Dyn. Syst., 2018

Random multi-hopper model: super-fast random walks on graphs.
J. Complex Networks, 2018

Spatial "Artistic" Networks: From Deconstructing Integer-Functions to Visual Arts.
Complex., 2018

Synchronization in networks of Rössler oscillators with long-range interactions.
Proceedings of the IEEE International Symposium on Circuits and Systems, 2018

Long-range influences in (social) networks.
Proceedings of the Extraction et Gestion des Connaissances, 2018

Communicability in Networked Systems - Implications for Stability, Spatial Efficiency and Dynamical Process.
Proceedings of the 3rd International Conference on Complexity, 2018

2017
What is the meaning of the graph energy after all?
Discret. Appl. Math., 2017

Centralities in Simplicial Complexes.
CoRR, 2017

The other fields also exist.
J. Complex Networks, 2017

Random neighborhood graphs as models of fracture networks on rocks: Structural and dynamical analysis.
Appl. Math. Comput., 2017

Two-walks degree assortativity in graphs and networks.
Appl. Math. Comput., 2017

2016
Communicability Angle and the Spatial Efficiency of Networks.
SIAM Rev., 2016

Accounting for the Role of Long Walks on Networks via a New Matrix Function.
CoRR, 2016

Exploring the "Middle Earth" of Network Spectra via a Gaussian Matrix Function.
CoRR, 2016

On walk entropies in graphs. Response to Dehmer and Mowshowitz.
Complex., 2016

2015
Predicting Triadic Closure in Networks Using Communicability Distance Functions.
SIAM J. Appl. Math., 2015

Communicability Angles Reveal Critical Edges for Network Consensus Dynamics.
CoRR, 2015

Core-satellite Graphs. Clustering, Assortativity and Spectral Properties.
CoRR, 2015

2014
Hyperspherical embedding of graphs and networks in communicability spaces.
Discret. Appl. Math., 2014

Are Social Networks Really Balanced?
CoRR, 2014

Special issue on the occasion of the International Workshop on Complex Networks and their Applications.
J. Complex Networks, 2014

2013
About the Discriminant Power of the Subgraph Centrality and Other Centrality Measures About the Discriminant Power of the Subgraph Centrality and Other Centrality Measures (Working paper).
CoRR, 2013

Peer Pressure Shapes Consensus, Leadership, and Innovations in Social Groups.
CoRR, 2013

Communicability reveals a transition to coordinated behavior in multiplex networks.
CoRR, 2013

Dynamic network centrality summarizes learning in the human brain.
J. Complex Networks, 2013

Journal of Complex Networks: Quo Vadis?
J. Complex Networks, 2013

2012
Ranking hubs and authorities using matrix functions
CoRR, 2012

Distance-sum heterogeneity in graphs and complex networks.
Appl. Math. Comput., 2012

2011
The Physics of Communicability in Complex Networks
CoRR, 2011

2010
Network Properties Revealed through Matrix Functions.
SIAM Rev., 2010

Design of highly synchronizable and robust networks.
Autom., 2010

Structural Patterns in Complex Networks through Spectral Analysis.
Proceedings of the Structural, 2010

Resistance Distance, Information Centrality, Node Vulnerability and Vibrations in Complex Networks.
Proceedings of the Network Science - Complexity in Nature and Technology., 2010

Complex Networks: An Invitation.
Proceedings of the Network Science - Complexity in Nature and Technology., 2010

2009
Communicability graph and community structures in complex networks.
Appl. Math. Comput., 2009

2007
Generalized Topological Indices. Modeling Gas-Phase Rate Coefficients of Atmospheric Relevance.
J. Chem. Inf. Model., 2007

A Protein Folding Degree Measure and Its Dependence on Crystal Packing, Protein Size, Secondary Structure, and Domain Structural Class [<i>J. Chem. Inf. </i><i>Comput. Sci, 44, </i>1238-1250 (2004)].
J. Chem. Inf. Model., 2007

Point scattering: A new geometric invariant with applications from (Nano)clusters to biomolecules.
J. Comput. Chem., 2007

Erratum to "Folding degrees of azurins and pseudoazurins. Implications for structure and function" [Computational Biology and Chemistry 29 (2005) 345-353].
Comput. Biol. Chem., 2007

2006
An Integrated in Silico Analysis of Drug-Binding to Human Serum Albumin.
J. Chem. Inf. Model., 2006

Predicting infinite dilution activity coefficients of organic compounds in water by quantum-connectivity descriptors.
J. Comput. Aided Mol. Des., 2006

2005
In Silico Studies toward the Discovery of New Anti-HIV Nucleoside Compounds through the Use of TOPS-MODE and 2D/3D Connectivity Indices. 2. Purine Derivatives.
J. Chem. Inf. Model., 2005

Folding degrees of azurins and pseudoazurins: Implications for structure and function.
Comput. Biol. Chem., 2005

2004
From Knowledge Generation to Knowledge Archive. A General Strategy Using TOPS-MODE with DEREK To Formulate New Alerts for Skin Sensitization.
J. Chem. Inf. Model., 2004

A Protein Folding Degree Measure and Its Dependence on Crystal Packing, Protein Size, Secondary Structure, and Domain Structural Class.
J. Chem. Inf. Model., 2004

Quantum-connectivity descriptors in modeling solubility of environmentally important organic compounds.
J. Comput. Chem., 2004

2003
What Are the Limits of Applicability for Graph Theoretic Descriptors in QSPR/QSAR? Modeling Dipole Moments of Aromatic Compounds with TOPS-MODE Descriptors.
J. Chem. Inf. Comput. Sci., 2003

Application of a novel graph-theoretic folding degree index to the study of steroid-DB3 antibody binding affinity.
Comput. Biol. Chem., 2003

2002
In Silico Studies toward the Discovery of New Anti-HIV Nucleoside Compounds with the Use of TOPS-MODE and 2D/3D Connectivity Indices, 1. Pyrimidyl Derivatives.
J. Chem. Inf. Comput. Sci., 2002

Characterization of the folding degree of proteins.
Bioinform., 2002

2001
Combination of 2D-, 3D-Connectivity and Quantum Chemical Descriptors in QSPR. Complexation of - and -Cyclodextrin with Benzene Derivatives.
J. Chem. Inf. Comput. Sci., 2001

Can 3D Structural Parameters Be Predicted from 2D (Topological) Molecular Descriptors?
J. Chem. Inf. Comput. Sci., 2001

3D Connectivity Indices in QSPR/QSAR Studies.
J. Chem. Inf. Comput. Sci., 2001

2000
Modeling Diamagnetic and Magnetooptic Properties of Organic Compounds with the TOSS-MODE Approach.
J. Chem. Inf. Comput. Sci., 2000

A Computer-based Approach to Describe the 13C NMR Chemical Shifts of Alkanes by the Generalized Spectral Moments of Iterated Line Graphs.
Comput. Chem., 2000

1999
Edge-Connectivity Indices in QSPR/QSAR Studies, 1. Comparison to Other Topological Indices in QSPR Studies.
J. Chem. Inf. Comput. Sci., 1999

Edge-Connectivity Indices in QSPR/QSAR Studies, 2. Accounting for Long-Range Bond Contributions.
J. Chem. Inf. Comput. Sci., 1999

Generalized Spectral Moments of the Iterated Line Graphs Sequence. A Novel Approach to QSPR Studies.
J. Chem. Inf. Comput. Sci., 1999

1998
Extension of Edge Connectivity Index. Relationships to Line Graph Indices and QSPR Applications.
J. Chem. Inf. Comput. Sci., 1998

Spectral Moments of the Edge Adjacency Matrix in Molecular Graphs. 3. Molecules Containing Cycles.
J. Chem. Inf. Comput. Sci., 1998

1997
Spectral Moments of the Edge-Adjacency Matrix of Molecular Graphs, 2. Molecules Containing Heteroatoms and QSAR Applications.
J. Chem. Inf. Comput. Sci., 1997

1996
Topological Indices Based on the Line Graph of the Molecular Graph.
J. Chem. Inf. Comput. Sci., 1996

Edge Adjacency Relationships and Molecular Topographic Descriptors. Definition and QSAR Applications.
J. Chem. Inf. Comput. Sci., 1996

A Topological Index Based on Distances of Edges of Molecular Graphs.
J. Chem. Inf. Comput. Sci., 1996

Spectral Moments of the Edge Adjacency Matrix in Molecular Graphs, 1. Definition and Applications to the Prediction of Physical Properties of Alkanes.
J. Chem. Inf. Comput. Sci., 1996

1995
Graph Theoretical Invariant of Randic Revisited.
J. Chem. Inf. Comput. Sci., 1995

Three-Dimensional Molecular Descriptors Based on Electron Charge Density Weighted Graphs.
J. Chem. Inf. Comput. Sci., 1995

Edge adjacency relationships in molecular graphs containing heteroatoms: a new topological index related to molar volume.
J. Chem. Inf. Comput. Sci., 1995

Edge Adjacency Relationships and a Novel Topological Index Related to Molecular Volume.
J. Chem. Inf. Comput. Sci., 1995


  Loading...