Critical percolation on any quasi-transitive graph of exponential growth has no infinite clusters
From MaRDI portal
(Redirected from Publication:309776)
Abstract: We prove that critical percolation on any quasi-transitive graph of exponential volume growth does not have a unique infinite cluster. This allows us to deduce from earlier results that critical percolation on any graph in this class does not have any infinite clusters. The result is new when the graph in question is either amenable or nonunimodular.
Recommendations
- No percolation at criticality on certain groups of intermediate growth
- Critical percolation on any nonamenable group has no infinite clusters
- Critical percolation on certain nonunimodular graphs
- Uniqueness of percolation on products with \(\mathbb Z\)
- Sharpness of the phase transition and exponential decay of the subcritical cluster size for percolation on quasi-transitive graphs
Cites work
- scientific article; zbMATH DE number 1552074 (Why is no real title available?)
- scientific article; zbMATH DE number 797393 (Why is no real title available?)
- scientific article; zbMATH DE number 806607 (Why is no real title available?)
- scientific article; zbMATH DE number 1421100 (Why is no real title available?)
- scientific article; zbMATH DE number 3198427 (Why is no real title available?)
- A new proof of the sharpness of the phase transition for Bernoulli percolation and the Ising model
- Amenability via random walks.
- Critical percolation on any nonamenable group has no infinite clusters
- Critical percolation on certain nonunimodular graphs
- Density and uniqueness in percolation
- Elementary amenable groups
- Growth of finitely generated solvable groups
- Infinite clusters in percolation models
- Minimal spanning forests
- On the critical percolation probabilities
- Percolation beyond \(\mathbb{Z}^ d\), many questions and a few answers
- Percolation on nonunimodular transitive graphs
- Poisson boundaries of lamplighter groups: proof of the Kaimanovich-Vershik conjecture
- Probability on trees and networks
- Sharpness of the phase transition and exponential decay of the subcritical cluster size for percolation on quasi-transitive graphs
- Sharpness of the phase transition in percolation models
- Uniqueness of the infinite component in a random graph with applications to percolation and spin glasses
Cited in
(24)- Counterexamples for percolation on unimodular random graphs
- Self-avoiding walk on nonunimodular transitive graphs
- The \(L^2\) boundedness condition in nonamenable percolation
- Lectures on the Ising and Potts models on the hypercubic lattice
- scientific article; zbMATH DE number 1405898 (Why is no real title available?)
- Site percolation and isoperimetric inequalities for plane graphs
- Statistical physics on a product of trees
- Critical percolation and the minimal spanning tree in slabs
- No percolation at criticality on certain groups of intermediate growth
- Continuity of the Ising phase transition on nonamenable groups
- Neighboring clusters in Bernoulli percolation
- Heavy Bernoulli-percolation clusters are indistinguishable
- Critical percolation on certain nonunimodular graphs
- Sharpness for inhomogeneous percolation on quasi-transitive graphs
- Strict monotonicity of percolation thresholds under covering maps
- Percolation on hyperbolic graphs
- The critical Ising model on amenable graphs of exponential growth
- Upper bounds on the percolation correlation length
- Power-law bounds for critical long-range percolation below the upper-critical dimension
- Locality of the critical probability for transitive graphs of exponential growth
- Nonuniqueness and mean-field criticality for percolation on nonunimodular transitive graphs
- New critical exponent inequalities for percolation and the random cluster model
- Supercritical percolation on nonamenable graphs: isoperimetry, analyticity, and exponential decay of the cluster size distribution
- Uniqueness of percolation on products with \(\mathbb Z\)
This page was built for publication: Critical percolation on any quasi-transitive graph of exponential growth has no infinite clusters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q309776)