Equivalence of replica and cavity methods for computing spectra of sparse random matrices
arXiv:1105.5047 · doi:10.1103/PhysRevE.83.011118
Abstract
We show by direct calculation that the replica and cavity methods are exactly equivalent for the spectrum of Erdos-Renyi random graph. We introduce a variational formulation based on the cavity method and use it to find approximate solutions for the density of eigenvalues. We also use this variational method for calculating spectra of sparse covariance matrices.
References in corpus (21)
- Random Matrix Theories in Quantum Physics: Common Concepts
- Random Matrices and Chaos in Nuclear Physics
- Spectra of complex networks
- Diffusion, localization and dispersion relations on ``small-world'' lattices
- Sparse random matrices: the eigenvalue spectrum revisited
- Cavity Approach to the Spectral Density of Sparse Symmetric Random Matrices
- Spectra of Euclidean Random Matrices
- Spectra of Sparse Random Matrices
- Laplacian spectra of complex networks and random walks on them: Are scale-free architectures really important?
- Random incidence matrices: moments of the spectral density
- A single defect approximation for localized states on random lattices
- Wigner-Dyson Statistics from the Replica Method
- Analytic computation of the Instantaneous Normal Modes spectrum in low density liquids
- Spectral Density of Sparse Sample Covariance Matrices
- Are Bosonic Replicas Faulty?
- Superbosonization formula and its application to random matrix theory
- Spectral Density of Complex Networks with a Finite Mean Degree
- A new approach for the analytic computation of the Instantaneous Normal Modes spectrum
- Random matrices and the replica method
- Asymptotic behavior of the density of states on a random lattice
- Real symmetric random matrices and replicas
Cited by in corpus (13)
- Cavity and replica methods for the spectral density of sparse symmetric random matrices
- Universality in the spectral and eigenfunction properties of random networks
- Localization of eigenvectors in random graphs
- Dynamical systems on large networks with predator-prey interactions are stable and exhibit oscillations
- A unifying model for random matrix theory in arbitrary space dimensions
- Multifractal phase in the weighted adjacency matrices of random Erdös-Rényi graphs
- Second largest Eigenpair Statistics for Sparse Graphs
- Top Eigenpair Statistics for Weighted Sparse Graphs
- Quenched dynamics of classical isolated systems: the spherical spin model with two-body random interactions or the Neumann integrable model
- Localization in random bipartite graphs: numerical and empirical study
- Equivalence between algorithmic instability and transition to replica symmetry breaking in perceptron learning systems
- Sparse Random Block Matrices
- A path integral approach to sparse non-Hermitian random matrices