English

Critical Percolation and the Incipient Infinite Cluster on Galton-Watson Trees

Probability 2019-02-20 v2

Abstract

We consider critical percolation on Galton-Watson trees and prove quenched analogues of classical theorems of critical branching processes. We show that the probability critical percolation reaches depth nn is asymptotic to a tree-dependent constant times n1n^{-1}. Similarly, conditioned on critical percolation reaching depth nn, the number of vertices at depth nn in the critical percolation cluster almost surely converges in distribution to an exponential random variable with mean depending only on the offspring distribution. The incipient infinite cluster (IIC) is constructed for a.e. Galton-Watson tree and we prove a limit law for the number of vertices in the IIC at depth nn, again depending only on the offspring distribution. Provided the offspring distribution used to generate these Galton-Watson trees has all finite moments, each of these results holds almost-surely.

Keywords

Cite

@article{arxiv.1806.00888,
  title  = {Critical Percolation and the Incipient Infinite Cluster on Galton-Watson Trees},
  author = {Marcus Michelen},
  journal= {arXiv preprint arXiv:1806.00888},
  year   = {2019}
}

Comments

14 pages