Critical percolation and the incipient infinite cluster on Galton-Watson trees

From MaRDI portal
Publication:2631804

DOI10.1214/19-ECP216zbMATH Open1412.60134arXiv1806.00888OpenAlexW3099219294MaRDI QIDQ2631804FDOQ2631804


Authors: Marcus Michelen Edit this on Wikidata


Publication date: 16 May 2019

Published in: Electronic Communications in Probability (Search for Journal in Brave)

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 n is asymptotic to a tree-dependent constant times n1. Similarly, conditioned on critical percolation reaching depth n, the number of vertices at depth n 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 n, 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.


Full work available at URL: https://arxiv.org/abs/1806.00888




Recommendations




Cites Work


Cited In (12)





This page was built for publication: Critical percolation and the incipient infinite cluster on Galton-Watson trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2631804)