## The Annals of Probability

### Indistinguishability of Percolation Clusters

#### Abstract

We show that when percolation produces infinitely many infinite clusters on a Cayley graph, one cannot distinguish the clusters from each other by any invariantly defined property. This implies that uniqueness of the infinite cluster is equivalent to nondecay of connectivity (a.k.a. long-range order). We then derive applications concerning uniqueness in Kazhdan groups and in wreath products and inequalities for $p_u$.

#### Article information

Source
Ann. Probab., Volume 27, Number 4 (1999), 1809-1836.

Dates
First available in Project Euclid: 31 May 2002

Permanent link to this document
https://projecteuclid.org/euclid.aop/1022874816

Digital Object Identifier
doi:10.1214/aop/1022874816

Mathematical Reviews number (MathSciNet)
MR1742889

Zentralblatt MATH identifier
0960.60013

#### Citation

Lyons, Russell; Schramm, Oded. Indistinguishability of Percolation Clusters. Ann. Probab. 27 (1999), no. 4, 1809--1836. doi:10.1214/aop/1022874816. https://projecteuclid.org/euclid.aop/1022874816