Central limit theorem for fluctuations of linear eigenvalue statistics of large random graphs
Abstract
We consider the adjacency matrix A of a large random graph and study fluctuations of the function fn(z,u)=1nΣk=1n\-uGkk(z)\ with G(z)=(z-iA)-1. We prove that the moments of fluctuations normalized by n-1/2 in the limit n∞ satisfy the Wick relations for the Gaussian random variables. This allows us to prove central limit theorem for TrG(z) and then extend the result on the linear eigenvalue statistics Trφ(A) of any function φ:R which increases, together with its first two derivatives, at infinity not faster than an exponential.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.