AbstractExtremal eigenvalues of graphs are of particular interest in theoretical computer science and combinatorics. Specifically, the spectral gap—the gap between the first and second largest eigenvalues—measures the expanding property of the graph. In this talk, I will focus on random $d$-regular graphs, for which the largest eigenvalue is $d$.I'll first explain some conjectures on the extr...
Abstract:We will report on recent progress regarding the universality of the extreme eigenvalues of a large random matrix with i.i.d. entries. Beyond the radius of the celebrated circular law, we will establish a precise three-term asymptotic expansion for the largest eigenvalue (in modulus) with an optimal error term. Based on this result, we will further show that the properly normalized lar...