Eigenvector localization in real networks and its implications for epidemic spreading

Abstract

The spectral properties of the adjacency matrix, in particular its largest eigenvalue and the associated principal eigenvector, dominate many structural and dynamical properties of complex networks. Here we focus on the localization properties of the principal eigenvector in real networks. We show that in most cases it is either localized on the star defined by the node with largest degree (hub) and its nearest neighbors, or on the densely connected subgraph defined by the maximum $K$-core in a $K$-core decomposition. The localization of the principal eigenvector is often strongly correlated with the value of the largest eigenvalue, which is given by the local eigenvalue of the corresponding localization subgraph, but different scenarios sometimes occur. We additionally show that simple targeted immunization strategies for epidemic spreading are extremely sensitive to the actual localization set.

13 pages, 6 figures

References in corpus (8)

• Statistical physics of vaccination
• Thresholds for epidemic spreading in networks
• A message passing approach for general epidemic models
• Percolation on sparse networks
• Epidemic thresholds of the Susceptible-Infected-Susceptible model on networks: A comparison of numerical and theoretical results
• Characterizing the dynamical importance of network nodes and links
• Relating Topological Determinants of Complex Networks to Their Spectral Properties: Structural and Dynamical Effects
• Weighted percolation on directed networks

Cited by in corpus (23)

• Cavity and replica methods for the spectral density of sparse symmetric random matrices
• Master equation analysis of mesoscopic localization in contagion dynamics on higher-order networks
• Does the brain behave like a (complex) network? I. Dynamics
• Spectral properties and the accuracy of mean-field approaches for epidemics on correlated networks
• Efficient sampling of spreading processes on complex networks using a composition and rejection algorithm
• Localization and universality of eigenvectors in directed random graphs
• Relevance of backtracking paths in epidemic spreading on networks
• High prevalence regimes in the pair quenched mean-field theory for the susceptible-infected-susceptible model on networks
• Counterexample: scale-free networked graphs with invariable diameter and density feature
• Dimension reduction of dynamical systems on networks with leading and non-leading eigenvectors of adjacency matrices
• k-core structure of real multiplex networks
• Network localization is unalterable by infections in bursts
• Simple quasistationary method for simulations of epidemic processes with localized states
• A greedy algorithm for computing eigenvalues of a symmetric matrix
• From Spectra to Localized Networks: A Reverse Engineering Approach
• Duality between predictability and reconstructability in complex systems
• Susceptible-infected-susceptible model on networks with eigenvector localization
• Epidemic threshold and localization of the SIS model on directed complex networks
• Strength and weakness of disease-induced herd immunity in networks
• Central limit theorem for the principal eigenvalue and eigenvector of Chung-Lu random graphs
• Switching Checkerboards
• Wheel graph strategy for PEV localization of networks
• Approximating nonbacktracking centrality and localization phenomena in large networks