English

Gap at 1 for the percolation threshold of Cayley graphs

Probability 2021-11-02 v1 Group Theory

Abstract

We prove that the set of possible values for the percolation threshold pcp_c of Cayley graphs has a gap at 1 in the sense that there exists ε0>0\varepsilon_0>0 such that for every Cayley graph GG one either has pc(G)=1p_c(G)=1 or pc(G)1ε0p_c(G) \leq 1-\varepsilon_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.

Keywords

Cite

@article{arxiv.2111.00555,
  title  = {Gap at 1 for the percolation threshold of Cayley graphs},
  author = {Christoforos Panagiotis and Franco Severo},
  journal= {arXiv preprint arXiv:2111.00555},
  year   = {2021}
}

Comments

13 pages