Anatomy of a gaussian giant: supercritical level-sets of the free field on random regular graphs
arXiv:2102.10975
Abstract
In this paper, we study the level-set of the zero-average Gaussian Free Field on a uniform random -regular graph above an arbitrary level , where is the level-set percolation threshold of the GFF on the -regular tree . We prove that w.h.p as the number of vertices diverges, the GFF has a unique giant connected component of size , where is the probability that the root percolates in the corresponding GFF level-set on . This gives a positive answer to the conjecture of \cite{ACregulgraphs} for most regular graphs. We also prove that the second largest component has size . Moreover, we show that shares the following similarities with the giant component of the supercritical Erdős-Rényi random graph. First, the diameter and the typical distance between vertices are . Second, the -core and the kernel encompass a given positive proportion of the vertices. Third, the local structure is a branching process conditioned to survive, namely the level-set percolation cluster of the root in (in the Erdős-Rényi case, it is known to be a Galton-Watson tree with a Poisson distribution for the offspring).
arXiv comment72 pages, 6 figures
References in corpus (6)
- Phase transition and level-set percolation for the Gaussian free field
- On decoupling inequalities and percolation of excursion sets of the Gaussian free field
- Equality of critical parameters for percolation of Gaussian free field level-sets
- Giant vacant component left by a random walk in a random d-regular graph
- Random interlacements and the Gaussian free field
- Local picture and level-set percolation of the Gaussian free field on a large discrete torus