Neighboring clusters in Bernoulli percolation

DOI10.1214/009117906000000485MaRDI QIDQ874738zbMATH OpenOpenAlexFDO

Authors Ádám Timár

Publication date 10 April 2007

Published in The Annals of Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0702873

zbMATH Keywords

percolationnonamenablecluster repulsiontouching clusters

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Probability theory on algebraic and topological structures (60B99) Percolation (82B43)

Abstract: We consider Bernoulli percolation on a locally finite quasi-transitive unimodular graph and prove that two infinite clusters cannot have infinitely many pairs of vertices at distance 1 from one another or, in other words, that such graphs exhibit ``cluster repulsion. This partially answers a question of H"{a}ggstr"{o}m, Peres and Schonmann.

Recommendations

• Heavy Bernoulli-percolation clusters are indistinguishable
• Critical percolation on any quasi-transitive graph of exponential growth has no infinite clusters
• Two badly behaved percolation processes on a nonunimodular graph
• Absence of infinite cluster for critical Bernoulli percolation on slabs
• Clusters in middle-phase percolation on hyperbolic plane

Cites work

• scientific article; zbMATH DE number 1405898 (Why is no real title available?)
• Density and uniqueness in percolation
• Geometry of the uniform spanning forest: transitions in dimensions 4, 8, 12,\dots
• Group-invariant percolation on graphs
• Indistinguishability of percolation clusters
• Infinite clusters in dependent automorphism invariant percolation on trees
• On the chemical distance for supercritical Bernoulli percolation
• Phase transitions on nonamenable graphs.

Cited in

(6)

• Indistinguishability of the components of random spanning forests
• The free uniform spanning forest is disconnected in some virtually free groups, depending on the generator set
• Clustering in a Continuum Percolation Model
• Percolation on nonunimodular transitive graphs
• Heavy Bernoulli-percolation clusters are indistinguishable
• \(k\)-nearest-neighbor clustering and percolation theory

This page was built for publication: Neighboring clusters in Bernoulli percolation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q874738)