Gap at 1 for the percolation threshold of Cayley graphs

DOI10.1214/22-AIHP1286arXiv2111.00555OpenAlexW3209329457MaRDI QIDQ6147645FDOQ6147645

Authors: Christoforos Panagiotis, Franco Severo 

Publication date: 16 January 2024

Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)

Abstract: We prove that the set of possible values for the percolation threshold $p_c$ of Cayley graphs has a gap at 1 in the sense that there exists $varepsilo{n}_0>0$ such that for every Cayley graph $G$ one either has $p_c(G)=1$ or $p_c(G)leq1-varepsilo{n}_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.

Full work available at URL: https://arxiv.org/abs/2111.00555

Recommendations

• Percolation on Finite Cayley Graphs
• scientific article; zbMATH DE number 2019627
• Locality of percolation for abelian Cayley graphs
• PERCOLATION ON GRIGORCHUK GROUPS
• Non-amenable Cayley graphs of high girth have \(p_c < p_u\) and mean-field exponents

zbMATH Keywords

phase transitionCayley graphscritical pointGaussian free fieldpercolation

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Phase transitions (general) in equilibrium statistical mechanics (82B26) Percolation (82B43)

Cites Work

• Percolation
• Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
• Percolation in strongly correlated systems: The massless Gaussian field
• Probability on trees and networks
• Domination by product measures
• Percolation beyond \(\mathbb{Z}^ d\), many questions and a few answers
• Title not available (Why is that?)
• The structure of approximate groups.
• Cut sets and normed cohomology with applications to percolation
• Ends in uniform spanning forests
• Unpredictable paths and percolation
• Indicable groups and \(p_c<1\)
• Strict monotonicity of percolation thresholds under covering maps
• Percolation and isoperimetry on roughly transitive graphs
• Percolation and local isoperimetric inequalities
• A finitary structure theorem for vertex-transitive graphs of polynomial growth
• PERCOLATION ON GRIGORCHUK GROUPS
• Existence of phase transition for percolation using the Gaussian free field

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)