Sizes of the largest clusters for supercritical percolation on random recursive trees
Author:
Preprint
Abstract
We consider Bernoulli bond-percolation on a random recursive tree of size $n\gg 1$, with supercritical parameter $p(n)=1-t/\ln n + o(1/\ln n)$ for some $t>0$ fixed. We show that with high probability, the largest cluster has size close to $\e^{-t}n$ whereas the next largest clusters have size of order $n/\ln n$ only and are distributed according to some Poisson random measure.
Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Scaling limits of Markov branching trees with applications to Galton–Watson and random unordered treesThe Annals of Probability, 2012
- Random Records and Cuttings in Binary Search TreesCombinatorics, Probability and Computing, 2010
- A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive treeElectronic Communications in Probability, 2007
- Random Fragmentation and Coagulation Processes2006
- Random cutting and records in deterministic and random treesRandom Structures & Algorithms, 2005
- Destruction of Recursive Trees2004
- Random Records and Cuttings in Complete Binary Trees2004
- Coalescent Random ForestsJournal of Combinatorial Theory, Series A, 1999
- Cutting down recursive treesMathematical Biosciences, 1974
- Cutting down random treesJournal of the Australian Mathematical Society, 1970