First eigenvalue/eigenvector in sparse random symmetric matrices: influences of degree fluctuation

Abstract

The properties of the first (largest) eigenvalue and its eigenvector (first eigenvector) are investigated for large sparse random symmetric matrices that are characterized by bimodal degree distributions. In principle, one should be able to accurately calculate them by solving a functional equation concerning auxiliary fields which come out in an analysis based on replica/cavity methods. However, the difficulty in analytically solving this equation makes an accurate calculation infeasible in practice. To overcome this problem, we develop approximation schemes on the basis of two exceptionally solvable examples. The schemes are reasonably consistent with numerical experiments when the statistical bias of positive matrix entries is sufficiently large, and they qualitatively explain why considerably large finite size effects of the first eigenvalue can be observed when the bias is relatively small.

22 pages, 6 figures

References in corpus (15)

• Noise Dressing of Financial Correlation Matrices
• Level-Spacing Distributions and the Airy Kernel
• Sparse random matrices: the eigenvalue spectrum revisited
• Cavity Approach to the Spectral Density of Sparse Symmetric Random Matrices
• A single defect approximation for localized states on random lattices
• Universality in Complex Networks: Random Matrix Analysis
• On the localization transition in symmetric random matrices
• Anderson model on Bethe lattices: density of states, localization properties and isolated eigenvalue
• Spectra of sparse regular graphs with loops
• Cavity analysis on the robustness of random networks against targeted attacks: Influences of degree-degree correlations
• Spectra of Modular and Small-World Matrices
• Cavity approach to the first eigenvalue problem in a family of symmetric random sparse matrices
• The Tracy--Widom law for some sparse random matrices
• Spectral Density of Sparse Sample Covariance Matrices
• Spectral Density of Complex Networks with a Finite Mean Degree

Cited by in corpus (14)

• Spectral Theory of Sparse Non-Hermitian Random Matrices
• Universality in the spectral and eigenfunction properties of random networks
• Eigenvalue Outliers of non-Hermitian Random Matrices with a Local Tree Structure
• Linear stability analysis for large dynamical systems on directed random graphs
• Limitations in the spectral method for graph partitioning: detectability threshold and localization of eigenvectors
• Localization and universality of eigenvectors in directed random graphs
• Top Eigenpair Statistics for Weighted Sparse Graphs
• Bose-Einstein-Like condensation of deformed random matrix: A replica approach
• Moments of the inverse participation ratio for the Laplacian on finite regular graphs
• Multiple peaks of species abundance distributions induced by sparse interactions
• Fat-tailed distribution derived from first eigenvector of symmetric random sparse matrix
• Relative species abundance of replicator dynamics with sparse interactions
• Matrix completion based on Gaussian parameterized belief propagation
• Fragility of spectral clustering for networks with an overlapping structure