Monotonicity of uniqueness for percolation on Cayley graphs: All infinite cluster are born simultaneously

47Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Consider site or bond percolation with retention parameter p on an infinite Cayley graph. In response to questions raised by Grimmett and Newman (1990) and Benjamini and Schramm (1996), we show that the property of having (almost surely) a unique infinite open cluster is increasing in p. Moreover, in the standard coupling of the percolation models for all parameters, a.s. for all p2 > p1 > pc, each infinite p2-cluster contains an infinite p1-cluster; this yields an extension of Alexander's (1995) "simultaneous uniqueness" theorem. As a corollary, we obtain that the probability θυ (p) that a given vertex υ belongs to an infinite cluster is depends continuously on p throughout the supercritical phase p > pc. All our results extend to quasi-transitive infinite graphs with a unimodular automorphism group.

Cite

CITATION STYLE

APA

Häggström, O., & Peres, Y. (1999). Monotonicity of uniqueness for percolation on Cayley graphs: All infinite cluster are born simultaneously. Probability Theory and Related Fields, 113(2), 273–285. https://doi.org/10.1007/s004400050208

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free