Critical percolation on certain nonunimodular graphs
From MaRDI portal
(Redirected from Publication:851533)
Abstract: An important conjecture in percolation theory is that almost surely no infinite cluster exists in critical percolation on any transitive graph for which the critical probability is less than 1. Earlier work has established this for the amenable cases Z^2 and Z^d for large d, as well as for all non-amenable graphs with unimodular automorphism groups. We show that the conjecture holds for the basic classes of non-amenable graphs with non-unimodular automorphism groups: for decorated trees and the non-unimodular Diestel-Leader graphs. We also show that the connection probability between two vertices decay exponentially in their distance. Finally, we prove that critical percolation on the positive part of the lamplighter group has no infinite clusters.
Recommendations
- Critical percolation on any nonamenable group has no infinite clusters
- Nonuniqueness and mean-field criticality for percolation on nonunimodular transitive graphs
- Percolation on nonunimodular transitive graphs
- Critical percolation on any quasi-transitive graph of exponential growth has no infinite clusters
- No percolation at criticality on certain groups of intermediate growth
Cited in
(28)- Critical percolation on any nonamenable group has no infinite clusters
- On percolation critical probabilities and unimodular random graphs
- Effective non-universality of the quorum percolation model on directed graphs with Gaussian in-degree
- Coalescence and criticality of graphs
- Coarse differentiation of quasi-isometries. II: Rigidity for Sol and lamplighter groups
- The \(L^2\) boundedness condition in nonamenable percolation
- Strict monotonicity of percolation thresholds under covering maps
- The threshold for jigsaw percolation on random graphs
- Two badly behaved percolation processes on a nonunimodular graph
- The critical point of \(k\)-clique percolation in the Erdős-Rényi graph
- Critical percolation on scale-free random graphs: new universality class for the configuration model
- Critical percolation on any quasi-transitive graph of exponential growth has no infinite clusters
- On the critical exponent of the one-dimensional Cucker–Smale model on a general graph
- Harmonic maps on amenable groups and a diffusive lower bound for random walks
- scientific article; zbMATH DE number 2019627 (Why is no real title available?)
- Coarse differentiation of quasi-isometries. I: Spaces not quasi-isometric to Cayley graphs
- Bernoulli and self-destructive percolation on non-amenable graphs
- On non-uniqueness of percolation on nonamenable Cayley graphs
- No percolation at criticality on certain groups of intermediate growth
- Indicable groups and \(p_c<1\)
- Nonuniqueness and mean-field criticality for percolation on nonunimodular transitive graphs
- Expansion of Percolation Critical Points for Hamming Graphs
- Counterexamples for percolation on unimodular random graphs
- Absence of percolation in graphs based on stationary point processes with degrees bounded by two
- Percolation beyond \(\mathbb Z^{d}\): the contributions of Oded Schramm
- Is the critical percolation probability local?
- Percolation on nonunimodular transitive graphs
- Universal aspects of critical percolation on random half-planar maps
This page was built for publication: Critical percolation on certain nonunimodular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q851533)
