Hammerstein equations for sparse random matrices
arXiv:2410.00355 · doi:10.1088/1751-8121/ada8ea
Abstract
Finding eigenvalue distributions for a number of sparse random matrix ensembles can be reduced to solving nonlinear integral equations of the Hammerstein type. While a systematic mathematical theory of such equations exists, it has not been previously applied to sparse matrix problems. We close this gap in the literature by showing how one can employ numerical solutions of Hammerstein equations to accurately recover the spectra of adjacency matrices and Laplacians of random graphs. While our treatment focuses on random graphs for concreteness, the methodology has broad applications to more general sparse random matrices.
v2: cosmetic changes, accepted for publication
References in corpus (7)
- Anderson Transitions
- Cavity Approach to the Spectral Density of Sparse Symmetric Random Matrices
- Spectra of Sparse Random Matrices
- Spectral distributions of adjacency and Laplacian matrices of random graphs
- The spectral dimension of simplicial complexes: a renormalization group theory
- Random matrices with row constraints and eigenvalue distributions of graph Laplacians
- Random sparse generators of Markovian evolution and their spectral properties