Gap at 1 for the percolation threshold of Cayley graphs

From MaRDI portal
Publication:6147645




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 varepsilon0>0 such that for every Cayley graph G one either has pc(G)=1 or pc(G)leq1varepsilon0. 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.










This page was built for publication: Gap at 1 for the percolation threshold of Cayley graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6147645)