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 of Cayley graphs has a gap at 1 in the sense that there exists such that for every Cayley graph one either has or . 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 806607 (Why is no real title available?)
- A finitary structure theorem for vertex-transitive graphs of polynomial growth
- Cut sets and normed cohomology with applications to percolation
- Domination by product measures
- Ends in uniform spanning forests
- Existence of phase transition for percolation using the Gaussian free field
- Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
- Indicable groups and \(p_c<1\)
- PERCOLATION ON GRIGORCHUK GROUPS
- Percolation
- Percolation and isoperimetry on roughly transitive graphs
- Percolation and local isoperimetric inequalities
- Percolation beyond \(\mathbb{Z}^ d\), many questions and a few answers
- Percolation in strongly correlated systems: The massless Gaussian field
- Probability on trees and networks
- Strict monotonicity of percolation thresholds under covering maps
- The structure of approximate groups.
- Unpredictable paths and percolation
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)