Finding the Resistance Distance and Eigenvector Centrality from the Network's Eigenvalues
arXiv:2005.00452 · doi:10.1016/j.physa.2021.125751
Abstract
There are different measures to classify a network's data set that, depending on the problem, have different success. For example, the resistance distance and eigenvector centrality measures have been successful in revealing ecological pathways and differentiating between biomedical images of patients with Alzheimer's disease, respectively. The resistance distance measures the effective distance between any two nodes of a network taking into account all possible shortest paths between them and the eigenvector centrality measures the relative importance of each node in the network. However, both measures require knowing the network's eigenvalues and eigenvectors -- eigenvectors being the more computationally demanding task. Here, we show that we can closely approximate these two measures using only the eigenvalue spectra, where we illustrate this by experimenting on elemental resistor circuits and paradigmatic network models -- random and small-world networks. Our results are supported by analytical derivations, showing that the eigenvector centrality can be perfectly matched in all cases whilst the resistance distance can be closely approximated. Our underlying approach is based on the work by Denton, Parke, Tao, and Zhang [arXiv:1908.03795 (2019)], which is unrestricted to these topological measures and can be applied to most problems requiring the calculation of eigenvectors.
arXiv comment5 pages (without references), 5 figures
References in corpus (25)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- Community structure in social and biological networks
- Finding community structure in networks using the eigenvectors of matrices
- Subgraph Centrality in Complex Networks
- Damage and fluctuations induce loops in optimal transport networks
- Graph spectra and the detectability of community structure in networks
- Localization and centrality in networks
- Spectra of complex networks
- Eigenvector Centrality Distribution for Characterization of Protein Allosteric Pathways
- Combining complex networks and data mining: why and how
- Anomalous Transport in Complex Networks
- Ensemble averageability in network spectra
- Eigenvalue Spectra of Modular Networks
- Robustness of Synchrony in Complex Networks and Generalized Kirchhoff Indices
- Synchronization in Weighted Uncorrelated Complex Networks in a Noisy Environment: Optimization and Connections with Transport Efficiency
- Diffusion Processes on Power-Law Small-World Networks
- Testing the Collective Properties of Small-World Networks through Roughness Scaling
- Eigenvalues: the Rosetta Stone for Neutrino Oscillations in Matter
- Resiliently evolving supply-demand networks
- Global Robustness vs. Local Vulnerabilities in Complex Synchronous Networks
- A measure of centrality based on the spectrum of the Laplacian
- Structure and function in flow networks
- Localization of eigenvector centrality in networks with a cut vertex
- Anomalous Consistency in Mild Cognitive Impairment: a complex networks approach