Finite-energy infinite clusters without anchored expansion
From MaRDI portal
Publication:1983609
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.
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
Cites work
- scientific article; zbMATH DE number 1421100 (Why is no real title available?)
- A Liouville hyperbolic souvlaki
- A new proof of the sharpness of the phase transition for Bernoulli percolation and the Ising model
- A nonamenable ``factor of a Euclidean space
- A note on percolation on \(\mathbb Z^d\): isoperimetric profile via exponential cluster repulsion
- Anchored expansion and random walk
- Anchored expansion, percolation and speed. (With an appendix by Gábor Pete)
- Corner percolation on \(\mathbb Z^{2}\) and the square root of 17
- Counterexamples for percolation on unimodular random graphs
- Ergodic theory on stationary random graphs
- Factors of IID on trees
- Isoperimetric inequalities and transient random walks on graphs
- Level-set percolation of the Gaussian free field on regular graphs. I. Regular trees
- On percolation critical probabilities and unimodular random graphs
- On the cluster size distribution for percolation on some general graphs
- Percolation beyond \(\mathbb{Z}^ d\), many questions and a few answers
- Phase transitions on nonamenable graphs.
- Probability on trees and networks
- Processes on unimodular random networks
- Random interlacements and amenability
- Sharp phase transition for the random-cluster and Potts models via decision trees
- Spectral measures of factor of i.i.d. processes on vertex-transitive graphs
- Supercritical percolation on nonamenable graphs: isoperimetry, analyticity, and exponential decay of the cluster size distribution
- The Local Limit Theorem and Some Related Aspects of Super-Critical Branching Processes
- The probability of a large cluster in supercritical Bernoulli perlocation
- Unimodular random trees
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)
