2000 character limit reached
Spectral Statistics of Sparse Random Graphs with a General Degree Distribution (1509.03368v1)
Published 11 Sep 2015 in math.PR
Abstract: We consider the adjacency matrices of sparse random graphs from the Chung-Lu model, where edges are added independently between the $N$ vertices with varying probabilities $p_{ij}$. The rank of the matrix $(p_{ij})$ is some fixed positive integer. We prove that the distribution of eigenvalues is given by the solution of a functional self-consistent equation. We prove a local law down to the optimal scale and prove bulk universality. The results are parallel to \cite{Erdos2013b} and \cite{Landon2015}.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.