Relating Topological Determinants of Complex Networks to Their Spectral Properties: Structural and Dynamical Effects
Not on the map. Why?
Abstract (arXiv)
The largest eigenvalue of a network's adjacency matrix and its associated principal eigenvector are key elements for determining the topological structure and the properties of dynamical processes mediated by it. We present a physically grounded expression relating the value of the largest eigenvalue of a given network to the largest eigenvalue of two network subgraphs, considered as isolated: The hub with its immediate neighbors and the densely connected set of nodes with maximum K-core index. We validate this formula showing that it predicts with good accuracy the largest eigenvalue of a large set of synthetic and real-world topologies. We also present evidence of the consequences of these findings for broad classes of dynamics taking place on the networks. As a byproduct, we reveal that the spectral properties of heterogeneous networks built according to the linear preferential attachment model are qualitatively different from those of their static counterparts.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 30 Mar 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 1.
1 paper.
- 2025AI sustains higher strategic tension than humans in chess16 Aug 2025