arXiv Analytics

Sign in

arXiv:1711.10672 [math.PR]AbstractReferencesReviewsResources

Invasion Percolation on Galton-Watson Trees

Marcus Michelen, Robin Pemantle, Josh Rosenberg

Published 2017-11-29Version 1

We consider invasion percolation on Galton-Watson trees. On almost every Galton-Watson tree, the invasion cluster almost surely contains only one infinite path. This means that for almost every Galton-Watson tree, invasion percolation induces a probability measure on infinite paths from the root. We show that under certain conditions of the progeny distribution, this measure is absolutely continuous with respect to the limit uniform measure. This confirms that invasion percolation, an efficient self-tuning algorithm, may be used to sample approximately from the limit uniform distribution. Additionally, we analyze the forward maximal weights along the backbone of the invasion cluster and prove a limit law for the process.

Related articles: Most relevant | Search more
arXiv:1805.03693 [math.PR] (Published 2018-05-09)
Quenched Survival of Bernoulli Percolation on Galton-Watson Trees
arXiv:1304.2260 [math.PR] (Published 2013-04-08)
Bootstrap percolation on Galton-Watson trees
arXiv:2405.11845 [math.PR] (Published 2024-05-20)
Speed of Random Walks in Dirichlet Environment on a Galton-Watson Tree