The Spectral Edge of Constant Degree Erdős-Rényi Graphs

Ella Hiesmayr, Theo McKenzie

We show that for an Erdős-Rényi graph on $N$ vertices with expected degree $d$ satisfying ${\log }^{-1/9}N\le d\le {\log }^{1/40}N$, the largest eigenvalues can be precisely determined…