Article ID Journal Published Year Pages File Type
1152609 Statistics & Probability Letters 2011 8 Pages PDF
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
Related Topics
Physical Sciences and Engineering Mathematics Statistics and Probability
Preview
Finite size percolation in regular trees
Authors
,