# The spectral gap of dense random regular graphs

@article{Tikhomirov2019TheSG,
title={The spectral gap of dense random regular graphs},
author={Konstantin E. Tikhomirov and Pierre Youssef},
journal={The Annals of Probability},
year={2019}
}
• Published 6 October 2016
• Mathematics
• The Annals of Probability
For any $\alpha\in (0,1)$ and any $n^{\alpha}\leq d\leq n/2$, we show that $\lambda(G)\leq C_\alpha \sqrt{d}$ with probability at least $1-\frac{1}{n}$, where $G$ is the uniform random $d$-regular graph on $n$ vertices, $\lambda(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… Expand
22 Citations
Structure of eigenvectors of random regular digraphs
• Mathematics
• Transactions of the American Mathematical Society
• 2019
Let $n$ be a large integer, let $d$ satisfy $C\leq d\leq \exp(c\sqrt{\ln n})$ for some universal constants $c, C>0$, and let $z\in {\mathcal C}$. Further, denote by $M$ the adjacency matrix of aExpand
Large subgraphs in pseudo-random graphs
• Mathematics
• 2016
We consider classes of pseudo-random graphs on $n$ vertices for which the degree of every vertex and the co-degree between every pair of vertices are in the intervals $(np - Cn^\delta,np+Cn^\delta)$Expand
Circular law for sparse random regular digraphs
• Mathematics
• 2018
Fix a constant $C\geq 1$ and let $d=d(n)$ satisfy $d\leq \ln^{C} n$ for every large integer $n$. Denote by $A_n$ the adjacency matrix of a uniform random directed $d$-regular graph on $n$ vertices.Expand
Complete Minors in Graphs Without Sparse Cuts
• Mathematics
• International Mathematics Research Notices
• 2019
We show that if $G$ is a graph on $n$ vertices, with all degrees comparable to some $d = d(n)$, and without a sparse cut, for a suitably chosen notion of sparseness, then it contains a completeExpand
On the norm of a random jointly exchangeable matrix
• Mathematics
• Journal of Theoretical Probability
• 2018
In this note, we show that the norm of an $$n\times n$$n×n random jointly exchangeable matrix with zero diagonal can be estimated in terms of the norm of its $$\lfloor n/2\rfloor \times \lfloorExpand Dirac’s theorem for random regular graphs • Mathematics, Computer Science • Combinatorics, Probability and Computing • 2020 A ‘resilience’ version of Dirac’s theorem in the setting of random regular graphs is proved, showing that whenever d is sufficiently large compared to \epsilon > 0 , a.s.a. the following holds. Expand Size biased couplings and the spectral gap for random regular graphs • Mathematics • 2018 Let λλ be the second largest eigenvalue in absolute value of a uniform random dd-regular graph on nn vertices. It was famously conjectured by Alon and proved by Friedman that if dd is fixedExpand 1-Factorizations of Pseudorandom Graphs • Mathematics, Computer Science • 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) • 2018 It is proved that for any ε > 0, an (n, d,λ)-graph G (that is, a d-regular graph on n vertices whose second largest eigenvalue in absolute value is at most λ) admits a 1-factorization provided that n is even, and C_0 ≤ d ≤ n-1 (where C-0=C_0(ε) is a constant depending only on ε). Expand Reliable communication over highly connected noisy networks • Computer Science, Mathematics • Distributed Computing • 2017 It is shown that if a (d-regular) network has mixing time m, then there exists an efficient coding scheme with rate O(1/m^3\log m)$$O( 1/m3logm), which implies a constant rate coding scheme for any n-party protocol over a d-regular network with a constant mixing time. Expand