Heavy Bernoulli-percolation clusters are indistinguishable
From MaRDI portal
Publication:2189465
DOI10.1214/19-AOP1354zbMath1453.60161arXiv1809.01284OpenAlexW2991573147MaRDI QIDQ2189465
Publication date: 15 June 2020
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.01284
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Percolation (82B43) Probability theory on algebraic and topological structures (60B99)
Related Items (6)
Homology-changing percolation transitions on finite graphs ⋮ Indistinguishability of collections of trees in the uniform spanning forest ⋮ Nonuniqueness and mean-field criticality for percolation on nonunimodular transitive graphs ⋮ Supercritical percolation on nonamenable graphs: isoperimetry, analyticity, and exponential decay of the cluster size distribution ⋮ Weights of uniform spanning forests on nonunimodular transitive graphs ⋮ Return probabilities on nonunimodular transitive graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Critical percolation on any quasi-transitive graph of exponential growth has no infinite clusters
- Ergodicity and indistinguishability in percolation theory
- Graph multiplication
- Neighboring clusters in Bernoulli percolation
- Percolation on nonunimodular transitive graphs
- Amenability, unimodularity, and the spectral radius of random walks on infinite graphs
- Automorphism groups of graphs as topological groups
- Density and uniqueness in percolation
- Uniqueness of the infinite component in a random graph with applications to percolation and spin glasses
- Monotonicity of uniqueness for percolation on Cayley graphs: All infinite clusters are born simultaneously
- Stability of infinite clusters in supercritical percolation
- Group-invariant percolation on graphs
- Stationary measures for random walks in a random environment with random scenery
- Random walk on the infinite cluster of the percolation model
- Percolation beyond \(\mathbb{Z}^ d\), many questions and a few answers
- Critical percolation on any nonamenable group has no infinite clusters
- Percolation on nonamenable products at the uniqueness threshold
- Indistinguishability of percolation clusters
- Indistinguishability of the components of random spanning forests
- Anchored expansion, percolation and speed. (With an appendix by Gábor Pete)
- The limit of the spectral radius of block Toeplitz matrices with nonnegative entries
- Statistical physics on a product of trees
- Indistinguishability of trees in uniform spanning forests
- Processes on unimodular random networks
- Cut sets and normed cohomology with applications to percolation
- Percolation
- Lamplighters, Diestel–Leader Graphs, Random Walks, and Harmonic Functions
- Random Walks on Infinite Graphs and Groups
- Anchored expansion and random walk
- Multiplicity of phase transitions and mean-field criticality on highly non-amenable graphs.
This page was built for publication: Heavy Bernoulli-percolation clusters are indistinguishable
