Locality of the critical probability for transitive graphs of exponential growth

DOI10.1214/19-AOP1395MaRDI QIDQ784171zbMATHWikidataFDO

Authors Tom Hutchcroft

Publication date 31 July 2020

Published in The Annals of Probability (Search for Journal in Brave)

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

zbMATH Keywords

critical exponentspercolationlocalitycritical probabilityexponential growthBenjamini-Schramm convergencenonamenable groups

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)

Abstract: Around 2008, Schramm conjectured that the critical probabilities for Bernoulli bond percolation satisfy the following continuity property: If $(G_n{)}_{ngeq1}$ is a sequence of transitive graphs converging locally to a transitive graph $G$ and $limsu{p}_{noinfty}{p}_c(G_n)<1$, then $p_c(G_n)o{p}_c(G)$ as $noinfty$. We verify this conjecture under the additional hypothesis that there is a uniform exponential lower bound on the volume growth of the graphs in question. The result is new even in the case that the sequence of graphs is uniformly nonamenable. In the unimodular case, this result is obtained as a corollary to the following theorem of independent interest: For every $g>1$ and $M<infty$, there exist positive constants $C=C(g,M)$ and $delta=delta(g,M)$ such that if $G$ is a transitive unimodular graph with degree at most $M$ and growth $operatornamegr(G):=in{f}_{rgeq1}|B(o,r){|}^{1/r}geqg$, then [ mathbf{P}_{p_c} �igl(|K_o|geq n�igr) leq C n^{-delta} ] for every $ngeq1$, where $K_o$ is the cluster of the root vertex $o$. The proof of this inequality makes use of new universal bounds on the probabilities of certain two-arm events, which hold for every unimodular transitive graph.

Recommendations

• On percolation critical probabilities and unimodular random graphs
• Locality of percolation for graphs with polynomial growth
• Is the critical percolation probability local?
• No percolation at criticality on certain groups of intermediate growth
• Critical percolation on any quasi-transitive graph of exponential growth has no infinite clusters

Cites work

• A Survey on Spectra of infinite Graphs
• A lower bound on the two-arms exponent for critical percolation on the lattice
• A new proof of the sharpness of the phase transition for Bernoulli percolation and the Ising model
• Amenability, unimodularity, and the spectral radius of random walks on infinite graphs
• Continuity of the phase transition for planar random-cluster and Potts models with \({1 \leq q \leq 4}\)
• Critical percolation on any nonamenable group has no infinite clusters
• Critical percolation on any quasi-transitive graph of exponential growth has no infinite clusters
• Density and uniqueness in percolation
• Ergodic theory on stationary random graphs
• Euclidean vs. Graph Metric
• Is the critical percolation probability local?
• Lectures on two-dimensional critical percolation
• Locality of connective constants
• Locality of percolation for abelian Cayley graphs
• Multiplicity of phase transitions and mean-field criticality on highly non-amenable graphs.
• Non-amenable Cayley graphs of high girth have \(p_c < p_u\) and mean-field exponents
• On non-uniqueness of percolation on nonamenable Cayley graphs
• On the uniqueness of the infinite cluster in the percolation model
• Percolation
• Percolation beyond \(\mathbb{Z}^ d\), many questions and a few answers
• Percolation on hyperbolic graphs
• Percolation on nonunimodular transitive graphs
• Processes on unimodular random networks
• Progress in high-dimensional percolation and random graphs
• Self-avoiding walk on nonunimodular transitive graphs
• Self-avoiding walks and amenability
• Sharpness of the phase transition in percolation models
• The supercritical phase of percolation is well behaved
• Uniqueness of the infinite cluster and continuity of connectivity functions for short and long range percolation

Cited in

(18)

• Slightly supercritical percolation on non‐amenable graphs I: The distribution of finite clusters
• High-dimensional near-critical percolation and the torus plateau
• On the first and second largest components in the percolated random geometric graph
• New critical exponent inequalities for percolation and the random cluster model
• The \(L^2\) boundedness condition in nonamenable percolation
• Power-law bounds for critical long-range percolation below the upper-critical dimension
• No percolation at criticality on certain groups of intermediate growth
• Sharp hierarchical upper bounds on the critical two-point function for long-range percolation on Zd
• Strict monotonicity of percolation thresholds under covering maps
• Supercritical percolation on graphs of polynomial growth
• On percolation critical probabilities and unimodular random graphs
• Locality of percolation for graphs with polynomial growth
• Supercritical percolation on nonamenable graphs: isoperimetry, analyticity, and exponential decay of the cluster size distribution
• Is the critical percolation probability local?
• Nonuniqueness and mean-field criticality for percolation on nonunimodular transitive graphs
• Transience and anchored isoperimetric dimension of supercritical percolation clusters
• A note on the local weak limit of a sequence of expander graphs
• Continuity of the Ising phase transition on nonamenable groups

This page was built for publication: Locality of the critical probability for transitive graphs of exponential growth

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