Gap at 1 for the percolation threshold of Cayley graphs
Abstract
We prove that the set of possible values for the percolation threshold pc of Cayley graphs has a gap at 1 in the sense that there exists 0>0 such that for every Cayley graph G one either has pc(G)=1 or pc(G) ≤ 1-0. The proof builds on the new approach of Duminil-Copin, Goswami, Raoufi, Severo & Yadin to the existence of phase transition using the Gaussian free field, combined with the finitary version of Gromov's theorem on the structure of groups of polynomial growth of Breuillard, Green & Tao.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.