Open Access
VOL. 48 | 2006 Uniqueness and multiplicity of infinite clusters
Geoffrey Grimmett

Editor(s) Dee Denteneer, Frank den Hollander, Evgeny Verbitskiy

IMS Lecture Notes Monogr. Ser., 2006: 24-36 (2006) DOI: 10.1214/074921706000000040


The Burton-Keane theorem for the almost-sure uniqueness of infinite clusters is a landmark of stochastic geometry. Let $\mu$ be a translation-invariant probability measure with the finite-energy property on the edge-set of a $d$-dimensional lattice. The theorem states that the number $I$ of infinite components satisfies $\mu(I\in\{0,1\}) = 1$. The proof is an elegant and minimalist combination of zero-one arguments in the presence of amenability. The method may be extended (not without difficulty) to other problems including rigidity and entanglement percolation, as well as to the Gibbs theory of random-cluster measures, and to the central limit theorem for random walks in random reflecting labyrinths. It is a key assumption on the underlying graph that the boundary/volume ratio tends to zero for large boxes, and the picture for non-amenable graphs is quite different.


Published: 1 January 2006
First available in Project Euclid: 28 November 2007

zbMATH: 1125.82005
MathSciNet: MR2306185

Digital Object Identifier: 10.1214/074921706000000040

Primary: 60D05 , 60K35 , 82B20 , 82B43

Keywords: entanglement , percolation , random cluster model , random labyrinth , rigidity , Stochastic geometry

Rights: Copyright © 2006, Institute of Mathematical Statistics

Back to Top