Open Access
Translator Disclaimer
January 2019 The spectral gap of dense random regular graphs
Konstantin Tikhomirov, Pierre Youssef
Ann. Probab. 47(1): 362-419 (January 2019). DOI: 10.1214/18-AOP1263


For any $\alpha\in(0,1)$ and any $n^{\alpha}\leq d\leq n/2$, we show that $\lambda({\mathbf{G}})\leq C_{\alpha}\sqrt{d}$ with probability at least $1-\frac{1}{n}$, where ${\mathbf{G}}$ is the uniform random undirected $d$-regular graph on $n$ vertices, $\lambda({\mathbf{G}})$ denotes its second largest eigenvalue (in absolute value) and $C_{\alpha}$ is a constant depending only on $\alpha$. Combined with earlier results in this direction covering the case of sparse random graphs, this completely settles the problem of estimating the magnitude of $\lambda({\mathbf{G}})$, up to a multiplicative constant, for all values of $n$ and $d$, confirming a conjecture of Vu. The result is obtained as a consequence of an estimate for the second largest singular value of adjacency matrices of random directed graphs with predefined degree sequences. As the main technical tool, we prove a concentration inequality for arbitrary linear forms on the space of matrices, where the probability measure is induced by the adjacency matrix of a random directed graph with prescribed degree sequences. The proof is a nontrivial application of the Freedman inequality for martingales, combined with self-bounding and tensorization arguments. Our method bears considerable differences compared to the approach used by Broder et al. [SIAM J. Comput. 28 (1999) 541–573] who established the upper bound for $\lambda({\mathbf{G}})$ for $d=o(\sqrt{n})$, and to the argument of Cook, Goldstein and Johnson [Ann. Probab. 46 (2018) 72–125] who derived a concentration inequality for linear forms and estimated $\lambda({\mathbf{G}})$ in the range $d=O(n^{2/3})$ using size-biased couplings.


Download Citation

Konstantin Tikhomirov. Pierre Youssef. "The spectral gap of dense random regular graphs." Ann. Probab. 47 (1) 362 - 419, January 2019.


Received: 1 March 2017; Revised: 1 November 2017; Published: January 2019
First available in Project Euclid: 13 December 2018

zbMATH: 07036340
MathSciNet: MR3909972
Digital Object Identifier: 10.1214/18-AOP1263

Primary: 05C80
Secondary: 60B20

Rights: Copyright © 2019 Institute of Mathematical Statistics


Vol.47 • No. 1 • January 2019
Back to Top