Size distribution of clusters in site-percolation on random recursive tree
read the original abstract
We prove rigorously several results about the site-percolation on random recursive trees, observed in the previous work by Kalay and Ben-Naim [J. Phys. A48(2015), no.4, 0405001, 15 pp.]. For a random recursive tree of size $n$, let every site have probability ${p \in (0,1)}$ to remain and with probability $(1-p)$ to be removed. As $n\to\infty,$ we show that the proportion of the remaining clusters of size $k$ is of order $k^{-1-\frac{1}{p}}$, resulting in a Yule-Simon distribution; the largest cluster size is of order $n^{p}$, and admits a non-trivial scaling limit. The proofs are based on the embedding of this model in the multi-type branching processes, and a coupling with the bond-percolation on random recursive trees.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Mixing times of step-reinforced random walks
Step-reinforced random walks on finite groups converge exponentially to uniform; on cycles mixing time jumps from logarithmic to polynomial at alpha=1/2, while on hypercubes reinforcement slows mixing with cutoff at d...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.