Finite Size Percolation in Regular Trees
Probability
2010-07-27 v1
Abstract
In the context of percolation in a regular tree, we study the size of the largest cluster and the length of the longest run starting within the first d generations. As d tends to infinity, we prove almost sure and weak convergence results.
Keywords
Cite
@article{arxiv.1007.4508,
title = {Finite Size Percolation in Regular Trees},
author = {Ery Arias-Castro},
journal= {arXiv preprint arXiv:1007.4508},
year = {2010}
}