Large deviation function for the number of eigenvalues of sparse random graphs inside an interval
Fernando L. Metz, Isaac P\'erez Castillo

TL;DR
This paper introduces a method to compute the large deviation rate function for the number of eigenvalues in an interval of sparse random matrices, revealing asymmetries related to eigenstate localization.
Contribution
The paper develops a general approach to exactly determine the large deviation rate function for eigenvalue counts in sparse matrices, applied to Erd"os-Rényi graphs and Anderson models on regular graphs.
Findings
Rate function is asymmetric, reflecting eigenstate localization.
Number variance scales linearly with system size for any disorder.
Good agreement between theory and numerical simulations.
Abstract
We present a general method to obtain the exact rate function controlling the large deviation probability that a sparse random matrix has eigenvalues inside the interval . The method is applied to study the eigenvalue statistics in two distinct examples: (i) the shifted index number of eigenvalues for an ensemble of Erd\"os-R\'enyi graphs and (ii) the number of eigenvalues within a bounded region of the spectrum for the Anderson model on regular random graphs. A salient feature of the rate function in both cases is that, unlike rotationally invariant random matrices, it is asymmetric with respect to its minimum. The asymmetric character depends on the disorder in a way that is compatible with the distinct eigenvalue statistics corresponding to localized and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
