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

DOI10.1088/1751-8113/45/32/325001zbMATH Open1252.81061arXiv1204.5534OpenAlexW3101881392MaRDI QIDQ2907005FDOQ2907005

Yoshiyuki Kabashima, Hisanao Takahashi

Publication date: 5 September 2012

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1204.5534

Recommendations

• The eigenvalues of very sparse random symmetric matrices
• Bulk eigenvalue fluctuations of sparse random matrices
• Eigenvector statistics of sparse random matrices
• Sparse random matrices: the eigenvalue spectrum revisited
• The eigenvalues of random symmetric matrices
• On the concentration of eigenvalues of random symmetric matrices
• Fluctuations of eigenvalues of random normal matrices
• The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices
• Statistical properties of eigenvectors and eigenvalues of structured random matrices

Mathematics Subject Classification ID

Random matrices (algebraic aspects) (15B52) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Nuclear physics (81V35) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Selfadjoint operator theory in quantum theory, including spectral analysis (81Q10) Quantum chaos (81Q50)

Cited In (8)

• Spectral theory of sparse non-Hermitian random matrices
• Moments of the inverse participation ratio for the Laplacian on finite regular graphs
• Top eigenpair statistics for weighted sparse graphs
• Relative species abundance of replicator dynamics with sparse interactions
• Second largest eigenpair statistics for sparse graphs
• Bose–Einstein-like condensation of deformed random matrix: a replica approach
• Matrix completion based on Gaussian parameterized belief propagation
• Localized eigenvectors of the non-backtracking matrix

This page was built for publication: First eigenvalue/eigenvector in sparse random symmetric matrices: influences of degree fluctuation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2907005)