English

Percolation on random recursive trees

Probability 2016-12-28 v1

Abstract

We study Bernoulli bond percolation on a random recursive tree of size nn with percolation parameter p(n)p(n) converging to 11 as nn tends to infinity. The sizes of the percolation clusters are naturally stored in a tree. We prove convergence in distribution of this tree to the genealogical tree of a continuous-state branching process in discrete time. As a corollary we obtain the asymptotic sizes of the largest and next largest percolation clusters, extending thereby a recent work of Bertoin (2014) which deals with cluster sizes in the supercritical regime. In a second part, we show that the same limit tree appears in the study of the tree components which emerge from a continuous-time destruction of a random recursive tree. We comment on the connection to our first result on Bernoulli bond percolation.

Keywords

Cite

@article{arxiv.1407.2508,
  title  = {Percolation on random recursive trees},
  author = {Erich Baur},
  journal= {arXiv preprint arXiv:1407.2508},
  year   = {2016}
}

Comments

32 pages, 4 figures

R2 v1 2026-06-22T04:59:39.171Z