Proof of a conjecture on the infinite dimension limit of a unifying model for random matrix theory
arXiv:1809.08444 · doi:10.1007/s10955-019-02260-0
Abstract
We study the large limit of a sparse random block matrix ensemble. It depends on two parameters: the average connectivity and the size of the blocks , which is the dimension of an euclidean space. In the limit of large , with fixed, we prove the conjecture that the spectral distribution of the sparse random block matrix converges in the case of the Adjacency block matrix to the one of the effective medium approximation, in the case of the Laplacian block matrix to the Marchenko-Pastur distribution. We extend previous analytical computations of the moments of the spectral density of the Adjacency block matrix and the Lagrangian block matrix, valid for all values of and .
arXiv comment13 pages, revised version accepted by Jour.of Stat.Phys
References in corpus (12)
- Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
- Approximate analytical description of the nonaffine response of amorphous solids
- Sparse random matrices: the eigenvalue spectrum revisited
- Random incidence matrices: moments of the spectral density
- Spectral distributions of adjacency and Laplacian matrices of random graphs
- Law of addition in random matrix theory
- Universal correlations for deterministic plus random Hamiltonians
- Spectra of random graphs with community structure and arbitrary degrees
- On the Law of Addition of Random Matrices
- Mean-field model for the density of states of jammed soft spheres
- Spectra of Modular and Small-World Matrices
- A unifying model for random matrix theory in arbitrary space dimensions