Finite-energy infinite clusters without anchored expansion
From MaRDI portal
Publication:1983609
DOI10.3150/20-BEJ1311zbMATH Open1469.60342arXiv2011.01377OpenAlexW3196225561MaRDI QIDQ1983609FDOQ1983609
Authors: Gábor Pete, Ádám Timár
Publication date: 10 September 2021
Published in: Bernoulli (Search for Journal in Brave)
Abstract: Hermon and Hutchcroft have recently proved the long-standing conjecture that in Bernoulli(p) bond percolation on any nonamenable transitive graph G, at any p > p_c(G), the probability that the cluster of the origin is finite but has a large volume n decays exponentially in n. A corollary is that all infinite clusters have anchored expansion almost surely. They have asked if these results could hold more generally, for any finite energy ergodic invariant percolation. We give a counterexample, an invariant percolation on the 4-regular tree.
Full work available at URL: https://arxiv.org/abs/2011.01377
Recommendations
- scientific article; zbMATH DE number 3919120
- Dynamical clusters of infinite particle dynamics
- Minimal-energy clusters of hard spheres
- Extension of Pirogov-Sinai theory of phase transitions to infinite range interactions. I: Cluster expansion
- scientific article; zbMATH DE number 1961361
- Infinite volume continuum random cluster model
- Cluster expansion and uniqueness of Gibbs state two-body potentials
- Cluster expansion in the canonical ensemble
- Unbound States in an Almost Infinite Deep Potential
- Enlarged symmetry groups of finite-size clusters with periodic boundary conditions
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Infinite graphs (05C63) Percolation (82B43)
Cites Work
- Processes on unimodular random networks
- Probability on trees and networks
- Percolation beyond \(\mathbb{Z}^ d\), many questions and a few answers
- A new proof of the sharpness of the phase transition for Bernoulli percolation and the Ising model
- Title not available (Why is that?)
- Ergodic theory on stationary random graphs
- A note on percolation on \(\mathbb Z^d\): isoperimetric profile via exponential cluster repulsion
- Anchored expansion, percolation and speed. (With an appendix by Gábor Pete)
- Anchored expansion and random walk
- Supercritical percolation on nonamenable graphs: isoperimetry, analyticity, and exponential decay of the cluster size distribution
- The probability of a large cluster in supercritical Bernoulli perlocation
- Unimodular random trees
- On the cluster size distribution for percolation on some general graphs
- A Liouville hyperbolic souvlaki
- Factors of IID on trees
- Isoperimetric inequalities and transient random walks on graphs
- On percolation critical probabilities and unimodular random graphs
- Sharp phase transition for the random-cluster and Potts models via decision trees
- Phase transitions on nonamenable graphs.
- The Local Limit Theorem and Some Related Aspects of Super-Critical Branching Processes
- Level-set percolation of the Gaussian free field on regular graphs. I. Regular trees
- Corner percolation on \(\mathbb Z^{2}\) and the square root of 17
- Spectral measures of factor of i.i.d. processes on vertex-transitive graphs
- Random interlacements and amenability
- A nonamenable ``factor of a Euclidean space
- Counterexamples for percolation on unimodular random graphs
Cited In (2)
This page was built for publication: Finite-energy infinite clusters without anchored expansion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1983609)