Percolation on Transitive Graphs as a Coalescent Process : Relentless Merging Followed by Simultaneous

Consider i.i.d. percolation with retention parameter p on an infinite graph G. There is a well known critical parameter pc ∈ [0, 1] for the existence of infinite open clusters. Recently, it has been shown that when G is quasi-transitive, there is another critical value pu ∈ [pc, 1] such that the number of infinite clusters is a.s. ∞ for p ∈ (pc, pu), and a.s. one for p > pu. We prove a simultaneous version of this result in the canonical coupling of the percolation processes for all p ∈ [0, 1]. Simultaneously for all p ∈ (pc, pu), we also prove that each infinite cluster has uncountably many ends. For p > pc we prove that all infinite clusters are indistinguishable by robust properties. Under the additional assumption that G is unimodular, we prove that a.s. for all p1 < p2 in (pc, pu), every infinite cluster at level p2 contains infinitely many infinite clusters at level p1. We also show that any Cartesian product G of d infinite connected graphs of bounded degree satisfies pu(G) ≤ pc(Z ). Research supported by a grant from the Swedish Natural Science Research Council Research partially supported by NSF grant # DMS-9803597 Research partially supported by NSF grant # DMS-9703814

[1]  Russell Lyons,et al.  Group-invariant Percolation on Graphs , 1999 .

[2]  Stability of infinite clusters in supercritical percolation , 1999 .

[3]  Olle Häggström,et al.  Monotonicity of uniqueness for percolation on Cayley graphs: all infinite clusters are born simultaneously , 1999 .

[4]  Eric Babson,et al.  Cut sets and normed cohomology with applications to percolation , 1999 .

[5]  R. Schonmann.  Percolation in ∞ + 1 Dimensions at the Uniqueness Threshold , 1999 .

[6]  O. Schramm,et al.  Indistinguishability of Percolation Clusters , 1998, math/9811170.

[7]  Percolation on fuchsian groups , 1998 .

[8]  Christian Borgs,et al.  The Birth of the Infinite Cluster:¶Finite-Size Scaling in Percolation , 2001 .

[9]  Olle Häggström,et al.  Infinite clusters in dependent automorphism invariant percolation on trees , 1997 .

[10]  David Aldous,et al.  Brownian excursions, critical random graphs and the multiplicative coalescent , 1997 .

[11]  K. Falconer.  Techniques in fractal geometry , 1997 .

[12]  I. Benjamini,et al.  Percolation Beyond $Z^d$, Many Questions And a Few Answers , 1996 .

[13]  C. Newman,et al.  Ground-state structure in a highly disordered spin-glass model , 1995, adap-org/9505005.

[14]  Chayes,et al.  Invaded cluster algorithm for equilibrium critical points. , 1995, Physical review letters.

[15]  K. Alexander.  Simultaneous uniqueness of infinite clusters in stationary random labeled graphs , 1995 .

[16]  Kenneth S. Alexander,et al.  Percolation and minimal spanning forests in infinite graphs , 1995 .

[17]  Svante Janson,et al.  The Birth of the Giant Component , 1993, Random Struct. Algorithms.

[18]  Bojan Mohar,et al.  Some relations between analytic and geometric properties of infinite graphs , 1991, Discret. Math..

[19]  G. Grimmett,et al.  Dynamic Renormalization and Continuity of the Percolation Transition in Orthants , 1991 .

[20]  Charles M. Newman,et al.  Percolation in ∞ + 1 dimensions , 1990 .

[21]  R. Burton,et al.  Density and uniqueness in percolation , 1989 .

[22]  H. Kesten,et al.  Uniqueness of the infinite cluster and continuity of connectivity functions for short and long range percolation , 1987 .

[23]  G. Grimmett,et al.  On the uniqueness of the infinite cluster in the percolation model , 1987 .

[24]  Charles M. Newman,et al.  The stochastic geometry of invasion percolation , 1985 .

[25]  V. Trofimov,et al.  Automorphism groups of graphs as topological groups , 1985 .

[26]  Charles M. Newman,et al.  Infinite clusters in percolation models , 1981 .

[27]  H. Kesten.  The critical probability of bond percolation on the square lattice equals 1/2 , 1980 .

[28]  J. F. C. Kingman,et al.  The Exponential Decay of Markov Transition Probabilities , 1963 .