Spectral gap and embedded trees for the Laplacian of the Erdős-Rényi graph

Raphael Ducatez, Renaud Rivier

Published 2023-09-29Version 1

For the Erd\H{o}s-R\'enyi graph of size $N$ with mean degree $(1+o(1))\frac{\log N}{t+1}\leq d\leq(1-o(1))\frac{\log N}{t}$ where $t\in\mathbb{N}^{*}$, with high probability the smallest non zero eigenvalue of the Laplacian is equal to $2-2\cos(\pi(2t+1)^{-1})+o(1)$. This eigenvalue arises from a small subgraph isomorphic to a line of size $t$ linked to the giant connected component by only one edge.