arXiv · 2410.00355
Hammerstein equations for sparse random matrices
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.
Explore related subjects
Keep this discovery
Pawat Akara-pipattana, Oleg Evnin. 2024-10-01. Hammerstein equations for sparse random matrices. https://doi.org/10.1088/1751-8121/ada8ea
Cite the original work for its findings. Save a collection to share your selection of sources.