Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-06T23:27:44.530Z Has data issue: false hasContentIssue false

The existence of a giant cluster for percolation on large Crump–Mode–Jagers trees

Published online by Cambridge University Press:  29 April 2020

G. Berzunza*
Affiliation:
Department of Mathematics, Uppsala University
*
*Postal address: Lägerhyddsvägen 1, Hus 1, 6 och 7, Box 480, 751 06 Uppsala, Sweden. Email address: gabriel.berzunza-ojeda@math.uu.se
Rights & Permissions [Opens in a new window]

Abstract

In this paper we consider random trees associated with the genealogy of Crump–Mode–Jagers processes and perform Bernoulli bond-percolation whose parameter depends on the size of the tree. Our purpose is to show the existence of a giant percolation cluster for appropriate regimes as the size grows. We stress that the family trees of Crump–Mode–Jagers processes include random recursive trees, preferential attachment trees, binary search trees for which this question has been answered by Bertoin [7], as well as (more general) m-ary search trees, fragmentation trees, and median-of-($2\ell+1$) binary search trees, to name a few, where to our knowledge percolation has not yet been studied.

Information

Type
Original Article
Copyright
© Applied Probability Trust 2020
Figure 0

Table 1: Examples of general preferential attachment trees.

Figure 1

Table 2: Some values of $\hat{\mu}(\theta)$, $\alpha$, and $\bar{\mu}(\alpha)$ for several distributions.