Summary.
Dynamical percolation is a Markov process on the space of subgraphs of a given graph, that has the usual percolation measure as its stationary distribution. In previous work with O. Häggström, we found conditions for existence of infinite clusters at exceptional times. Here we show that for ℤd, with p>p c , a.s. simultaneously for all times there is a unique infinite cluster, and the density of this cluster is θ(p). For dynamical percolation on a general tree Γ, we show that for p>p c , a.s. there are infinitely many infinite clusters at all times. At the critical value p=p c , the number of infinite clusters may vary, and exhibits surprisingly rich behaviour. For spherically symmetric trees, we find the Hausdorff dimension of the set T k of times where the number of infinite clusters is k, and obtain sharp capacity criteria for a given time set to intersect T k. The proof of this capacity criterion is based on a new kernel truncation technique.
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 5 May 1997 / In revised form: 24 November 1997
Rights and permissions
About this article
Cite this article
Peres, Y., Steif, J. The number of infinite clusters in dynamical percolation. Probab Theory Relat Fields 111, 141–165 (1998). https://doi.org/10.1007/s004400050165
Issue Date:
DOI: https://doi.org/10.1007/s004400050165