Finite size percolation in regular trees (Q625024): Difference between revisions

The paper deals with the size of the largest cluster and length of the longest run starting within the first \(d\) generations. The author studies the limit behavior of the size of the largest cluster with root of generation not exceeding \(d\) as \(d\) tends to infinity. In the paper, almost sure and weak convergence results are proved.