Hammerstein equations for sparse random matrices
<|reference_start|>Hammerstein equations for sparse random matrices: 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.<|reference_end|>
@article{akara-pipattana2024hammerstein,
    title={Hammerstein equations for sparse random matrices},
    author={Pawat Akara-pipattana, Oleg Evnin},
    journal={arXiv preprint arXiv:2410.00355},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.00355},
    primaryClass={cond-mat.dis-nn cs.NA math-ph math.FA math.MP math.NA math.PR}
}