title: Large Deviation Function for the Number of Eigenvalues of Sparse Random Graphs Inside an Interval.
abstract: We present a general method to obtain the exact rate function Ψ_{[a,b]}(k) controlling the large deviation probability Prob[I_{N}[a,b]=kN]≍e^{-NΨ_{[a,b]}(k)} that an N×N sparse random matrix has I_{N}[a,b]=kN eigenvalues inside the interval [a,b]. 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ös-Rényi 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 delocalized eigenstates. The results also show that the level compressibility κ_{2}/κ_{1} for the Anderson model on a regular graph satisfies 0<κ_{2}/κ_{1}<1 in the bulk regime, in contrast with the behavior found in Gaussian random matrices. Our theoretical findings are thoroughly compared to numerical diagonalization in both cases, showing a reasonable good agreement.
authors.affiliation: Departamento de Física, Universidade Federal de Santa Maria, 97105-900 Santa Maria, Brazil.
authors.forename: Fernando L
authors.initials: FL
authors.lastname: Metz
authors.affiliation: Department of Complex Systems, Institute of Physics, UNAM, P.O. Box 20-364, 01000 México, D.F., Mexico.
authors.forename: Isaac
authors.initials: I
authors.lastname: Pérez Castillo