1. Introduction and main results
Consider a graph
$G_{n}$
of large but finite size
$n \in \mathbb{N}$
and perform Bernoulli bond-percolation with parameter
$p_{n} \in (0,1)$
that depends on the size of
$G_{n}$
(typically the size of a graph refers to its number of vertices but not necessarily). This means we first pick a finite graph and then remove each edge with probability
$1 - p_{n}$
, independently of the other edges, inducing a partition of its set of vertices into connected clusters. A natural problem in this setting is to show the existence of a giant cluster for appropriate regimes of the percolation parameter
$p_{n}$
, when the size of the graph grows. More precisely, we are interested in finding a supercritical
$p_{n}$
such that, with high probability as
$n \rightarrow \infty$
, there exists a cluster that is of a size comparable to the entire graph. Let us recall some known answers to this question in some important instances.
In the case of the complete graph with n vertices, a classical result due to Erdős and Rényi (see e.g. [Reference Bollobás12]) shows that for
$p_{n} \sim c/n$
as
$n \rightarrow \infty$
with
$c > 1$
fixed, with high probability, there is a unique giant cluster of size close to
$\theta(c) n$
where
$\theta(c)$
is the unique strictly positive solution to the equation
$x + {\textrm{e}}^{-cx} = 1$
; recall that for two sequences of real numbers
$(a_{n})_{n \geq 1}$
and
$(b_{n})_{n \geq 1}$
, we write
$a_{n} \sim b_{n}$
if
$a_{n}/b_{n} \rightarrow 1$
as
$n \rightarrow \infty$
. Second, consider a uniform Cayley tree with n vertices (i.e. a tree picked uniformly at random among the
$n^{n-2}$
trees on a set of n labeled vertices). Pitman [Reference Pitman30, Reference Pitman31] showed that for
$1-p_{n} \sim c/\sqrt{n}$
as
$n \rightarrow \infty$
with a fixed
$c >0$
, the sequence of sizes of the percolation clusters ranked in decreasing order and renormalized by a factor
$1/n$
converges weakly as
$n \rightarrow \infty$
to a random mass partition which can be described explicitly in terms of a conditioned Poisson measure. Finally, Bertoin [Reference Bertoin7] has shown that for fairly general families of trees with n vertices, the supercritical regime corresponds to percolation parameters of the form
$1-p_{n} \sim c/ \ell(n)$
as
$n \rightarrow \infty$
, where
$c >0$
fixed and
$\ell(n)$
is an estimate of the height of a typical vertex in the tree structure. Roughly speaking, Bertoin [Reference Bertoin7] established that under the previous regime the size of the cluster containing the root is of order n as
$n \rightarrow \infty$
. The latter result includes, for instance, some important families of random trees, such as random recursive trees, preferential attachment trees, binary search trees, etc., where it is well known that
$\ell(n) = \ln n$
; see [Reference Drmota15] and [Reference Durrett16, Section 4.4].
The main purpose of this work is to investigate the same question for large random Crump–Mode–Jagers trees, or CMJ-trees for short. More precisely, CMJ-trees are the family trees (or genealogical trees) of Crump–Mode–Jagers processes, also referred to as general or age-dependent branching processes; for further details we refer to the classic book of Jagers [Reference Jagers20]. These are general branching population models where the number of individuals can be measured or counted in many different ways: those born, those alive, or in some sub-phase of life, for instance. More generally, we can assign random characteristics or weights to each of the individuals and measure the size of the population according to those characteristics (for instance, special choices of reproduction point process and counting yield the classical Galton–Watson or Bellman–Harris processes). We postpone its formal definition to later in this work and continue by informally describing our main results. Loosely speaking, we study Bernoulli bond-percolation on CMJ-trees at the time when the total weight (‘size’) of the underlying CMJ-process reaches n in three different regimes:
• weakly supercritical,
${1}/{(\ln n)} \ll 1- p_{n} \ll 1$ ,
• supercritical,
$1 - p_{n} \sim {c}/{(\ln n)}$ for some
$c > 0$ fixed, and
• strongly supercritical,
$0 < 1- p_{n} \ll {1}/{(\ln n)}$ .
Recall that for two sequences of real numbers
$(a_{n})_{n \geq 1}$
and
$(b_{n})_{n \geq 1}$
, we write
$a_{n} \ll b_{n}$
or
$b_{n} \gg a_{n}$
if and only if
$a_{n}/b_{n} \rightarrow 0$
as
$n \rightarrow \infty$
. We show that, under standard conditions on the underlying CMJ-process, the root cluster is of order
$n^{{\kappa(p_{n})}/{\alpha}}$
, where
$\kappa(p_{n}) >0$
is a function of the percolation parameter and
$\alpha > 0$
is the so-called Malthusian parameter. We have used the same terminology as in [Reference Baur4], where only random recursive trees are studied. In Section 3 we shall see that several important families of random trees can be constructed as family trees of a CMJ-process stopped at a suitable time: for example, random recursive trees, preferential attachment trees, and binary search trees where the existence of a giant cluster has been shown by Bertoin [Reference Bertoin7]. On the other hand, the general nature of the CMJ-processes will allow us to provide new results on percolation for (more general) m-ary search trees [Reference Muntz and Uzgalis27], fragmentation trees [Reference Janson and Neininger22], median-of-(
$2\ell+1$
) binary search trees [Reference Devroye13], and so-called splitting trees introduced in [Reference Geiger17], to name a few.
In the rest of the introduction we are going to describe our setting more precisely and give the exact definition of CMJ-trees. This will enable us to state our main result in Section 1.2.
1.1. Crump–Mode–Jagers trees
We start by recalling the definition of Crump–Mode–Jagers processes (CMJ-processes) whose associated family trees are called CMJ-trees. Following Jagers [Reference Jagers20], we present a CMJ-process as a general branching process that starts with a single individual born at time 0. We use the usual Ulam–Harris notation and introduce the set of labels
$\mathbb{U} = \bigcup_{n=0}^{\infty} \mathbb{N}^{n}$
, with the convention
$\mathbb{N}^{0} = \{ \varnothing \}$
. The ancestor has label
$\varnothing$
. An individual with label
$u = (u_{1}, \ldots, u_{n}) \in \mathbb{U}$
belongs to the nth generation and is understood to be the
$u_{n}$
th descendant of
$(u_{1}, \ldots, u_{n-1})$
, which is the
$u_{n-1}$
th descendant of
$(u_{1}, \ldots, u_{n-2})$
and so on. The initial individual has a random number N of children, born at random times
$(\xi_{i})_{i=1}^{N}$
where
$0 \leq N \leq \infty$
and
$0 \leq \xi_{1} \leq \xi_{2} \leq \cdots \leq \xi_{N}$
. Formally, we describe the birth times
$(\xi_{i})_{i=1}^{N}$
as a point process
$\Xi$
on
$[0, \infty)$
, that is,
$\Xi = \sum_{i=1}^{N} \delta_{\xi_{i}}$
is an integer-valued random measure, where
$\delta_{t}$
is a point mass (Dirac measure) at time
$t \geq 0$
; see e.g. [Reference Kallenberg23]. We let
$\mu(\kern-2pt\cdot\kern-2pt) \coloneqq \mathbb{E}[\Xi(\kern-2pt\cdot\kern-2pt)]$
denote the intensity measure of
$\Xi$
, and write
$\mu(t) \coloneqq \mu([0, t]) = \mathbb{E}[\Xi([0,t])]$
. In particular, we have
$N = \Xi([0,\infty))$
, and thus
$\mu(\infty)= \mathbb{E}[N]$
. Every child that is born evolves in the same way, that is, every individual u has its own copy
$\Xi_{u}$
of
$\Xi$
(where now
$\xi_{i}$
means the age of the mother when child i is born); these copies are assumed to be independent and identically distributed. We denote the time an individual u is born by
$\sigma_{u}$
. We also assume that each individual has a random lifetime
$\lambda \in [0, \infty]$
(for several of our applications we assume
$\lambda \equiv \infty$
). Formally, we assign to each possible individual u a copy
$(\Omega_{u}, \mathcal{F}_{u}, \nu_{u})$
of some generic probability space
$(\Omega, \mathcal{F}, \nu)$
on which we define
$\Xi$
, and possibly a random characteristic or weight
$\phi$
. The general branching process is then defined on the product
$\prod_{u}(\Omega_{u}, \mathcal{F}_{u}, \nu_{u})$
of these probability spaces.
The simplest way to measure or monitor the evolution of the CMJ-process is to consider the process
$Z = (Z(t), t \geq 0)$
of the total number of individuals that have been born up to time
$t \geq 0$
, i.e. the number of births in [0, t]. More precisely,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU1.png?pub-status=live)
see e.g. [Reference Jagers20] and [Reference Jagers and Nerman21]. Following Jagers’ work on CMJ-processes (see e.g. [Reference Jagers20], [Reference Jagers and Nerman21], [Reference Nerman28], and [Reference Nerman and Jagers29]), it is going to be relevant to monitor the evolution of individuals that satisfy some random property, instead of the total number of births in some fixed time interval. This random property or characteristic of an individual might be unrelated or heavily dependent on its reproduction behavior. More precisely, a characteristic or weight of an individual is a random function
$\phi\colon \mathbb{R}_{+} \rightarrow \mathbb{R}_{+}$
that assigns the value
$\phi(t)$
when the individual’s age is
$t \geq 0$
. We assume that
$\phi$
is càdlàg (we may extend
$\phi$
to
$\mathbb{R}$
by setting
$\phi(t) = 0$
for
$t < 0$
). We assume that each individual u has its own copy
$\phi_{u}$
and thus we associated each of them with a triple
$(\Xi_{u}, \lambda_{u}, \phi_{u})$
. These triples for all individuals are independent and identically distributed. We then define the
$\phi$
-counted process
$Z^{\phi} = (Z^{\phi}(t), t \geq 0)$
by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU2.png?pub-status=live)
and say that
$Z^{\phi}_{t}$
is the total weight at time t of all individuals that have been born so far (recall that u is born at time
$\sigma_{u}$
and thus has age
$t-\sigma_{u}$
at time t). If
$\phi \equiv 1$
, we have
$Z^{\phi}= Z$
. On the other hand, the characteristic
$\phi = \mathds{1}_{[0, \lambda)}$
yields the number
$Z^{\phi}(t) = \sum_{u} \mathds{1}_{\{ \sigma_{u} \leq t < \sigma_{u} + \lambda_{u} \}}$
of individuals alive at time
$t \geq 0$
.
Following [Reference Holmgren and Janson19], we let
$T(\infty)$
be the family tree of the entire CMJ-process or (complete) CMJ-tree. This tree is obtained from the general branching process described at the beginning of this section by ignoring the time structure. Specifically, the individuals in the population are seen as vertices where the initial individual is the root. The children of a vertex in the tree are the same as the children in the general branching process. The tree
$T(\infty)$
may be infinite, which happens when the process does not die out, i.e.
$Z(\infty) = \infty$
. For
$t \geq 0$
, we let T(t) be the CMJ-tree consisting of all individuals born up to time t. Note that the number of vertices at time
$t \geq 0$
is given by Z(t). Clearly, T(t) is an unordered tree for
$t >0$
. However, one could get an ordered tree by adding an additional ordering of the children of each individual. This can be done by taking the children in order of birth, or by choosing a random order; we refer to [Reference Holmgren and Janson19, Remark 5.1] for further details. Finally, observe that the random tree T(t) has a random size for
$t > 0$
(possibly infinite). In this work we shall be mainly interested in CMJ-trees with a given number of vertices or when some random property is fulfilled. More precisely, we have the following definition.
Definition 1. Fix a random characteristic or weight
$\phi$
. For
$n \in \mathbb{N}$
, we let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU3.png?pub-status=live)
be the first time the total weight is at least n (as usual
$\inf \varnothing = \infty$
). We exclude the case
$\phi \equiv 0$
, which would yield
$\tau^{\phi}(n) = \infty$
almost surely (a.s). We then define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU4.png?pub-status=live)
the CMJ-tree at the time when the total weight or ‘size’ reaches n (provided this ever happens).
Random trees
$T_{n}^{\phi}$
defined in this way, for some CMJ-process and some weight
$\phi$
, are the focus of the present paper. From now on we usually refer to
$T_{n}^{\phi}$
as the CMJ-tree, whose size is given by
$|T_{n}^{\phi}| \coloneqq Z(\tau^{\phi} (n))$
. If
$\phi \equiv 1$
, then
$T_{n}^{\phi}$
is the family tree of a CMJ-process stopped when its number of vertices is greater than n. In particular, if the birth times have continuous distributions and there are no twins, then a.s. no two vertices are born simultaneously. Therefore
$|T_{n}^{\phi}| = n$
.
Note that
$T_{n}^{\phi}$
could be an infinite random tree, or also the time
$\tau^{\phi} (n)$
could be infinite. In order to avoid such possibilities, we only study cases where
$Z^{\phi}(t) < \infty$
for every finite
$t \geq 0$
, but
$Z(\infty) = \infty$
. In this direction, we define the Laplace transform of a function f on
$[0, \infty)$
by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU5.png?pub-status=live)
and the Laplace transform of a measure
$\nu$
on
$[0, \infty)$
by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn1.png?pub-status=live)
Throughout this work and unless we specify otherwise, we make the following assumptions.
Assumption 1. We consider CMJ-processes that satisfy the following.
(A1)
$\mu(\{0\}) = \mathbb{E}[\Xi(\{ 0\})] < 1$ . This excludes a trivial case with explosions at the start (in our examples,
$\mu(\{0\}) = 0$ ).
(A2)
$\mu$ is not concentrated on any lattice
$h \mathbb{Z}$ ,
$h > 0$ .
(A3)
$N \geq 1$ a.s. (in this case every individual has at least one child, so the process never dies out and
$Z(\infty) = \infty$ ).
(A4) There exists
$ \theta_{1} > 0$ such that
$\hat{\mu}(\theta_{1}) \in (1, \infty)$ . Note that
$\hat{\mu}(\kern-2pt\cdot\kern-2pt)$ is monotone decreasing on
$(\theta_{1}, \infty)$ , and that
$\hat{\mu}(\theta) \rightarrow 0$ , as
$\theta \rightarrow \infty$ , by the dominated convergence theorem. Thus there exists a real number
$\alpha >0$ (the Malthusian parameter) such that
$\hat{\mu}(\alpha) =1$ .
(A5) For
$\theta_{1}$ as in (A4), we have
$\operatorname{Var}(\hat{\Xi}(\theta_{1})) < \infty$ .
(A6) The random variable
$\sup_{t \geq 0} ( {\textrm{e}}^{-\theta_{2} t} \phi(t) )$ has finite expectation for some
$0 < \theta_{2} < \alpha$ .
(A7)
$\operatorname{Var}(\phi(t))$ is bounded in finite intervals. Furthermore, there exists
$0 \lt \theta_{3} \leq 2 \alpha$ such that
$\lim_{t \rightarrow \infty} \,{\textrm{e}}^{-\theta_{3} t} \operatorname{Var}(\phi(t)) = 0$ .
Observe that (A1)–(A5) are conditions on the general branching process, while (A6)–(A7) are conditions on the characteristic
$\phi$
. The following result shows that
$T_{n}^{\phi}$
is well-defined.
Proposition 1. Under assumptions
$(\textbf{A1})$
–
$(\textbf{A4})$
and for any characteristic
$\phi$
satisfying
$(\textbf{A6})$
, we have the following.
(i)
$\lim_{t \rightarrow \infty} Z^{\phi}(t) = \infty$ almost surely. Thus a.s.
$\tau^{\phi}(n) < \infty$ for every
$n \geq 0$ and
$T_{n}^{\phi}$ is a well-defined finite random tree.
(ii)
$\lim_{n \rightarrow \infty} |T_{n}^{\phi}|/n = 1/\mathbb{E}[\hat{\phi}(\alpha)] \in (0, \infty)$ a.s., and
$ \lim_{n \rightarrow \infty} \tau_{n}^{\phi} / (\ln n) = 1/ \alpha$ almost surely.
Proof. See [Reference Holmgren and Janson19, Theorem 5.12].
We end this section by making a few remarks on our assumptions. Note that (A4) implies that
$\mathbb{E}[N] > 1$
(this is known as the supercritical case). Note also that (A4) implies that
$\mu(t) < \infty$
for every
$0 \leq t < \infty$
. However,
$\mu(\infty) = \mathbb{E}[N]$
may be infinite. Furthermore, this condition also implies that Z(t) and
$\mathbb{E}[Z(t)]$
are finite for every
$0 \leq t < \infty$
; see e.g. [Reference Jagers20, Theorem 6.3.3]. Finally, we do not really need the assumption
$N \geq 1$
in (A3); it suffices that
$\mathbb{E}[N] > 1$
. In this case the extinction probability
$\mathbb{P}(Z(\infty) < \infty) < 1$
, so there is a positive probability that the process is infinite, and Proposition 1 and the results below hold conditioned on the event
$\{Z(\infty) = \infty\}$
(this is a standard setting in [Reference Jagers and Nerman21], [Reference Nerman28], and [Reference Nerman and Jagers29]).
1.2. Main results
We now consider Bernoulli bond-percolation with parameter
$p_{n} \in (0, 1)$
on the CMJ-tree
$T_{n}^{\phi}$
with given weight
$\phi$
(recall Definition 1). Following the idea of [Reference Bertoin and Uribe Bravo10], we incorporate Bernoulli bond-percolation on the growth algorithm of the random tree process
$(T(t), t \geq 0)$
in a dynamic way and stop at the time
$\tau^{\phi}(n)$
. This will lead us to interpret Bernoulli bond-percolation in terms of neutral mutations which are superposed to the structure of the CMJ-process and that appear at the birth events. More precisely, at each birth event, independently of all other individuals, the newborn is a clone of its parent with probability
$p_{n}$
or a mutant with probability
$1-p_{n}$
. The mutations are considered to be neutral, that is, the behavior (reproduction laws and lifetimes) of the individuals is the same regardless of whether they are clones or mutants. A mutation event corresponds to the insertion of an edge in T(t) that is immediately destroyed. This creates a new percolation cluster (with one vertex or individual) that grows following the same dynamic. We write
$T^{(p_{n})}(t)$
for the resulting combinatorial structure at time
$t \geq 0$
. That is,
$T^{(p_{n})}(t)$
has the same set of vertices as T(t) and its set of intact edges is a subset of the edges of T(t). Thus the connected clusters of
$T^{(p_{n})}(t)$
are the subtrees of T(t) formed by the subsets of vertices which can be connected by a path of intact edges.
In this work we are interested in the evolution of the percolation cluster that contains the root. In this direction, we write
$T_{\varnothing}^{(p_{n})}(t)$
for the subtree of T(t) at time
$t \geq 0$
that contains the progenitor of the entire population at time 0. It should be clear that the sub-population with the ancestral type is a CMJ-process whose generic birth process, denoted by
$\Xi^{(p_{n})}$
, has intensity measure given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn2.png?pub-status=live)
where
$\mu$
is the intensity measure of the birth process
$\Xi$
of the original CMJ-process. This is a consequence of the thinning property of point processes. For a characteristic
$\phi$
, we let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU6.png?pub-status=live)
denote the
$\phi$
-counted process associated with the (clonal) CMJ-process of the sub-population bearing the same type as the initial individual. In particular, if
$\phi \equiv 1$
, then
$Z_{\varnothing}^{(p_{n}), \phi} = Z_{\varnothing}^{(p_{n})} = (Z_{\varnothing}^{(p_{n})}(t), t \geq 0)$
counts the number of vertices in the root cluster. Clearly, if
$p_{n} \equiv 1$
, we recover the original CMJ-process. Let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU7.png?pub-status=live)
be the sub-tree which contains the original root of the CMJ-tree
$T_{n}^{\phi}$
(associated with the weight
$\phi$
) after performing percolation of parameter
$p_{n} \in (0,1)$
. Recall that
$\tau^{\phi} (n)\coloneqq \inf \{t \geq 0\colon Z^{\phi}(t) \geq n \}$
is the first time that the total weight or ‘size’ of the tree process
$(T(t), t \geq 0)$
is at least n. Therefore the size of the root percolation cluster is given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU8.png?pub-status=live)
We now turn to the statement of our main result, Theorem 1. Recall that we consider the regimes weakly supercritical, supercritical, and strongly supercritical of
$p_{n} \in (0, 1)$
, with
${p_{n} \rightarrow 1}$
as
$n \rightarrow \infty$
. First, we need to introduce some notation that we will use in the rest of the work. Note that (A4) implies that there exists
$n^{\ast} \in \mathbb{N}$
such that for
$n \geq n^{\ast}$
there is
$\alpha_{p_{n}} >0$
(the Malthusian parameter of
$\mu^{(p_{n})}$
) such that
$\hat{\mu}^{(p_{n})}(\alpha_{p_{n}}) =1$
. We write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn3.png?pub-status=live)
which is finite and strictly positive due to our assumptions; see Remarks 1 and 2 below.
Theorem 1. Let
$\phi$
be any characteristic that does not depend on
$p_{n}$
. Under assumptions
$(\textbf{A1})$
–
$(\textbf{A7})$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU9.png?pub-status=live)
where
$\alpha - \alpha_{p_{n}} \sim (1-p_{n}) \bar{\mu}(\alpha)^{-1}$
as
$n \rightarrow \infty$
. In particular:
(i) in the weakly supercritical regime,
$\lim_{n \rightarrow \infty} n^{-1} |T_{\varnothing}^{n,\phi}| = 0$ in probability,
(ii) in the supercritical regime,
$\lim_{n \rightarrow \infty} n^{-1} |T_{\varnothing}^{n,\phi}| = \text{e}^{- c/(\alpha \bar{\mu}(\alpha))} \mathbb{E}[\hat{\phi}(\alpha)]$ in probability,
(iii) in the strongly supercritical regime,
$\lim_{n \rightarrow \infty} n^{-1} |T_{\varnothing}^{n,\phi}| = \mathbb{E}[\hat{\phi}(\alpha)]$ in probability.
The parameters
$\alpha$
and
$\alpha_{p_{n}}$
are difficult to compute explicitly. Nevertheless, in the supercritical and strongly supercritical regimes, we note that
$n^{\alpha_{p_{n}}\alpha^{-1}} \sim n^{ 1- (1-p_{n}) (\alpha\bar{\mu}(\alpha))^{-1}}$
as
$n \rightarrow \infty$
. We also note that in the weakly supercritical regime, the size of the root cluster is o(n) whereas in the other regimes it is of order n.
On the other hand, in the supercritical regime (i.e.
$1-p_{n} \sim c/ \ln n$
as
$n \rightarrow \infty$
, with
$c >0$
fixed), we find that Theorem 1 (ii) agrees with [Reference Bertoin7, Theorem 1]. However, it must be pointed out that Theorem 1 (ii) cannot always be deduced from [Reference Bertoin7, Theorem 1]. More precisely, note that [Reference Bertoin7, Theorem 1] considers size as the number of vertices in the tree structure, whereas the size of a CMJ-tree depends on the underlying characteristic or weight (recall Definition 1) that does not always coincide with the number of vertices, for instance m-ary search trees, fragmentation trees, or the so-called splitting trees where the notion of ‘size’ is different; see Section 3 below for details. Then the arguments used in [Reference Bertoin7] do not always apply in our setting except in particular cases, for example random recursive trees, preferential attachment trees, or binary search trees that agree with a type of CMJ-tree when the correct birth process, lifespan, and characteristic are chosen. Moreover, Bertoin [Reference Bertoin7] did not treat the strongly and weakly supercritical regimes as we will do in this work. Therefore Theorem 1 may be seen as complementary to (or an extension of) the results in [Reference Bertoin7].
Inspired by Bertoin and Uribe Bravo [Reference Bertoin and Uribe Bravo10], our approach relies on the connection between CMJ-processes with neutral mutations and Bernoulli bond-percolation. This leads us to investigate the asymptotic behavior of a CMJ-process with neutral mutations up to a large random time, in certain regimes when the small mutation parameter is related to the size of the total population. In [Reference Bertoin and Uribe Bravo10], the authors connected Bernoulli bond-percolation in preferential attachment trees with a Markovian system of branching processes with neutral mutations. This is clearly not the case here, since it is well known that CMJ-processes are not always Markovian. Thus we have to use different tools, although some guidelines are similar to [Reference Bertoin and Uribe Bravo10]. We stress that similar connections with systems of (Markovian) branching processes have been used before to study percolation on random recursive trees [Reference Baur4, Reference Baur and Bertoin5] and m-ary random increasing trees [Reference Berzunza11].
This work leaves open some natural questions that we plan to investigate in the future. One can consider estimating the sizes of the largest clusters which do not contain the root. In this work we restrict ourselves to the root cluster because the absence of the Markov property makes the analysis much harder. This is not the case in [Reference Bertoin and Uribe Bravo10] and [Reference Baur4], where the connection with a Markovian branching system with neutral mutations is used to answer this question for random recursive trees and preferential attachment trees. We refer also to Bertoin [Reference Bertoin9], where this question has been answered for random recursive trees by using a different approach. The second direction of future work would be to analyze the fluctuations of the giant component that we expect to be non-Gaussian as for random recursive trees [Reference Bertoin8], preferential attachment trees, and m-ary random increasing trees [Reference Berzunza11]. Finally, it would be interesting to estimate the size of the largest percolation clusters in the sub-critical regime, i.e.
$1 - p_{n} \gg c/ \ln n$
as
$n \rightarrow \infty$
and
$c > 0$
is fixed; see e.g. [Reference Baur and Bertoin5], where the case of the random recursive tree has been studied.
The rest of this paper is organized as follows. In Section 2 we prove our main result. Section 3 is devoted to the application of Theorem 1 to important families of random trees that can be constructed via CMJ-processes. Finally, the key results used in the proof of Theorem 1 are proved in Section A. More precisely, we investigate the asymptotic behavior of CMJ-processes with mutations and deduce some crucial properties that may be of independent interest.
2. Proof of Theorem 1
In this section we prove our main result, Theorem 1. Recall that the size of the root cluster is related to the clonal CMJ-process with generic birth process
$\Xi^{(p_{n})}$
whose intensity measure
$\mu^{(p_{n})}$
is given in (2). The starting point is to investigate the asymptotic behavior of the
$\phi$
-counted clonal process
$Z_{\varnothing}^{(p_{n}), \phi} = (Z_{\varnothing}^{(p_{n}), \phi}(t), t \geq 0)$
as
$p_{n} \rightarrow 1$
and
$t \rightarrow \infty$
. The approach relies crucially on the use of a remarkable martingale that can be found in the work of Nerman [Reference Nerman28]. More precisely, we improve the results in [Reference Nerman28] and [Reference Jagers and Nerman21] on the convergence of Nerman’s martingale in order to hold uniformly in the percolation parameter (see Lemmas 2 and 3 below). Then these results and further remarks are put together to conclude with the proof of Theorem 1.
Recall that
$(\textbf{A4})$
implies that there exists
$n^{\ast} \in \mathbb{N}$
such that for
$n \geq n^{\ast}$
there is
$\alpha_{p_{n}} > 0$
(the Malthusian parameter of
$\mu^{(p_{n})}$
) such that
$\hat{\mu}^{(p_{n})}(\alpha_{p_{n}}) =1$
. This implies that
$\mu^{(p_{n})}(\infty) = p_{n} \mathbb{E}[N] > 1$
(i.e. the clonal process is supercritical). Since
$\alpha_{p_{n}} \rightarrow \alpha$
as
$p_{n} \rightarrow 1$
, we choose
$n^{\ast}$
large enough such that
$0 < \theta_{1} < \inf_{n \geq n^{\ast}} \alpha_{p_{n}}$
, where
$\theta_{1}$
satisfies (A4)–(A5). Moreover, consider
$n^{\ast}$
even larger such that
$0 < \theta_{2} < \inf_{n \geq n^{\ast}} \alpha_{p_{n}}$
and
$0 < \theta_{3} < 2\inf_{n \geq n^{\ast}} \alpha_{p_{n}}$
, where
$\theta_{2}$
and
$\theta_{3}$
satisfy
$(\textbf{A6})$
and
$(\textbf{A7})$
, respectively.
Remark 1. Note for future reference that
$\mu_{\alpha}^{(p_{n})}({\textrm{d}} t) \coloneqq {\textrm{e}}^{-t\alpha_{p_{n}}} \mu^{(p_{n})}({\textrm{d}} t)$
, for
$n \geq n^{\ast}$
, is a probability measure concentrated on
$(0, \infty)$
. Moreover, condition
$(\textbf{A4})$
implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn4.png?pub-status=live)
We write
$W^{(p_{n}), \phi}_{\varnothing} = (W^{(p_{n}), \phi}_{\varnothing}(t), t \geq 0)$
for the process given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU10.png?pub-status=live)
For
$p_{n} \equiv 1$
, we sometimes remove the superscript
$(p_{n})$
and the subscript
$\varnothing$
from the previous notations. That is, we write
$W^{\phi} = (W^{\phi}(t), t \geq 0)$
for the process given by
$W^{\phi}(t) \coloneqq {\textrm{e}}^{-t\alpha } Z^{\phi}(t)$
. For
$n \geq n^{\ast}$
, consider the characteristic
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn5.png?pub-status=live)
The next lemma shows that
$\psi^{(p_{n})}$
satisfies the conditions (A6)–(A7).
Lemma 1. Assume that conditions
$(\textbf{A1})$
–
$(\textbf{A5})$
are fulfilled. Then we have the following.
(i)
$\sup_{n \geq n^{\ast}} \sup_{t \geq 0} \,{\textrm{e}}^{-\theta_{1} t} \psi^{(p_{n})}(t)$ has finite expectation, for
$\theta_{1}$ as in
$(\textbf{A4})$ .
(ii)
$\sup_{n \geq n^{\ast}} \operatorname{Var}(\psi^{(p_{n})}(t))$ is bounded in finite intervals. Furthermore, there exists
$0 \lt\break \theta \leq 2 \inf_{n \geq n^{\ast}}\alpha_{p_{n}}$ such that
$\lim_{t \rightarrow \infty} \sup_{n \geq n^{\ast}}\,{\textrm{e}}^{-\theta t} \operatorname{Var}(\psi^{(p_{n})}(t)) = 0$ .
Proof. For
$t \geq 0$
and
$0 < \theta < \alpha_{p_{n}}$
, we note that
$\psi^{(p_{n})}(t) \leq {\textrm{e}}^{t\theta} \int_{t}^{\infty} \,{\textrm{e}}^{-s\theta} \Xi(\textrm{d} s) \leq {\textrm{e}}^{t\theta} \hat{\Xi}(\theta)$
. This inequality and conditions (A4)–(A5) imply our claim. □
Henceforth, and for the sake of simplicity, we omit the superscript
$(p_{n})$
from
$\psi^{(p_{n})}$
and only write
$\psi$
for the characteristic defined in (5).
It is well known that the process
$W^{(p_{n}), \psi}_{\varnothing}$
is a nonnegative square-integrable martingale whose terminal value will be denoted by
$W^{(p_{n}), \psi}_{\varnothing}(\infty)$
. Furthermore,
$W^{(p_{n}), \psi}_{\varnothing}(\infty) \geq 0$
almost surely (see [Reference Nerman28, Proposition 2.4] for the proof of the martingale property and [Reference Jagers and Nerman21, Theorem 4.1 and Corollary 4.2] for the convergence result). In particular, if
$p_{n}\equiv1$
, [Reference Jagers and Nerman21, Corollary 4.2] and condition
$(\textbf{A3})$
imply that
$W^{(p_{n}), \psi}(\infty) = W^{\psi}(\infty) >0$
almost surely. An important result established by Nerman [Reference Nerman28] and Jagers and Nerman [Reference Jagers and Nerman21, Theorem 4.3] (see also Jagers [Reference Jagers20, Section 6.10]) implies that, for
$n \geq n^{\ast}$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn6.png?pub-status=live)
almost surely and in
$L_{2}(\mathbb{P})$
, where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn7.png?pub-status=live)
with
$\bar{\mu}^{(p_{n})}(\alpha_{p_{n}})$
defined in (4).
Remark 2. Note that the previous convergence implies that
$\bar{\mu}^{(p_{n})}(\alpha_{p_{n}}) >0$
. Furthermore,
$m_{\infty}^{(p_{n}), \phi} > 0$
(or equivalently,
$\mathbb{E}[\hat{\phi}(\alpha_{p_{n}})] > 0$
) whenever
$\phi \not \equiv 0$
almost surely.
Remark 3. In particular, a simple computation shows that
$m_{\infty}^{(p_{n}),\psi} =1$
, where
$\psi$
is defined in (5); see e.g. [Reference Jagers and Nerman21, Theorem 4.1].
The next two results are the key ingredients in the proof of Theorem 1. The first lemma shows that the
$L_{2}(\mathbb{P})$
convergence of the square-integrable martingale
$W^{(p_{n}), \psi}_{\varnothing}$
holds uniformly for
$n \geq n^{\ast}$
. Furthermore, it shows that the
$L_{2}(\mathbb{P})$
convergence in (6) also holds uniformly for
$n \geq n^{\ast}$
. The second lemma establishes an even stronger convergence result by showing that the convergence remains true as
$t \rightarrow \infty$
and
$p_{n} \rightarrow 1$
.
Lemma 2. Assume that conditions
$(\textbf{A1})$
–
$(\textbf{A5})$
are fulfilled. We have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU11.png?pub-status=live)
where
$\psi$
is defined in (5). Furthermore, if
$\phi$
is a characteristic that does not depend on
$p_{n}$
and that satisfies
$(\textbf{A6})$
–
$(\textbf{A7})$
, then we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU12.png?pub-status=live)
Lemma 3. Assume that conditions
$(\textbf{A1})$
–
$(\textbf{A5})$
are fulfilled. For a characteristic
$\phi$
that does not depend on
$p_{n}$
and that satisfies
$(\textbf{A6})$
–
$(\textbf{A7})$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU13.png?pub-status=live)
where
$\psi$
is defined in (5) with
$p_{n} \equiv 1$
(the limit must be understood as a double limit).
The proofs of these lemmas are rather technical and it is convenient to postpone their proofs to the Appendix. We will then finish the proof of Theorem 1, but first we need the next result.
Lemma 4. Assume that conditions
$(\textbf{A1})$
–
$(\textbf{A4})$
are fulfilled. We have
$\alpha - \alpha_{p_{n}} \sim (1-p_{n})\break \bar{\mu}(\alpha)^{-1}$
, as
$n \rightarrow \infty$
, where
$\bar{\mu}(\alpha)$
is defined in (3).
Proof. Recall the definition of
$\hat{\mu}(\kern-2pt\cdot\kern-2pt)$
in (1). Recall also that (A4) implies that
$\hat{\mu}(\kern-2pt\cdot\kern-2pt)$
is a continuous monotone decreasing function on
$(\theta_{1}, \infty)$
, where
$\theta_{1}$
is defined in
$(\textbf{A4})$
. Furthermore, (A4) and the dominated convergence theorem show that
$\hat{\mu}(\kern-2pt\cdot\kern-2pt)$
is differentiable with continuous derivative given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn8.png?pub-status=live)
Since
$p_{n} \in (0,1)$
, we have
$\alpha_{p_{n}} < \alpha$
for
$n \geq n^{\ast}$
. Then, for
$n \geq n^{\ast}$
, the mean value theorem implies that there exists
$\varepsilon_{n} \in (\alpha_{p_{n}}, \alpha)$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU14.png?pub-status=live)
Recall that (A4) implies that
$\hat{\mu}(\alpha) = 1$
and
$\hat{\mu}(\alpha_{p_{n}}) = 1/p_{n}$
. Moreover, we have
$0 < \bar{\mu}(\alpha) < - \hat{\mu}^{\prime}(\varepsilon_{n}) < \infty$
, where
$\bar{\mu}(\alpha)$
is defined in (3). Hence
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU15.png?pub-status=live)
Finally, we use the continuity of
$\hat{\mu}^{\prime}(\kern-2pt\cdot\kern-2pt)$
, since
$\alpha_{p_{n}} \rightarrow \alpha$
, as
$ n \rightarrow \infty$
, and
$ - \hat{\mu}^{\prime}(\alpha) = \bar{\mu}(\alpha)$
. □
Proof of Theorem 1. We deduce from Lemmas 2 and 3 that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU16.png?pub-status=live)
in probability, where
$\psi$
is defined in (5) with
$p_{n} \equiv1$
and
$m_{\infty} = (\alpha \bar{\mu}(\alpha))^{-1} \in (0, \infty)$
; see Remark 2. Proposition 1 implies that
$\lim_{n \rightarrow \infty} n^{-1} Z(\tau_{n}^{\phi}) = \mathbb{E}[\hat{\phi}(\alpha)]$
a.s. Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU17.png?pub-status=live)
Since
$W^{\psi}(\infty) > 0$
almost surely (by
$(\textbf{A3})$
together with [Reference Jagers and Nerman21, Corollary 4.2]), we obtain that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU18.png?pub-status=live)
in probability. Therefore our claim follows by Lemma 4. □
3. Applications
In this section we use Theorem 1 to deduce known and new results on the existence of a giant percolation cluster in the supercritical regime for several families of trees. We begin in Subsection 3.1 with some examples where the result has been established in [Reference Bertoin7]. In Subsections 3.2, 3.3, 3.4, and 3.5 we present several new examples.
3.1. General preferential attachment trees
We introduce the procedure studied by Rudas, Tóth, and Valkó [Reference Rudas, Tóth and Valkó35] and Rudas and Tóth [Reference Rudas and Tóth34] to grow a so-called general preferential attachment tree. Fix a sequence of nonnegative weights
$\textbf{w} = (w_{k})_{k=0}^{\infty}$
with
$w_{0} >0$
. Start the construction from a unique tree with a single vertex and build a random tree
$T_{n}^{(\textbf{w})}$
with n vertices recursively as follows. Suppose that
$T_{n}^{(\textbf{w})}$
has been constructed for
$n \geq 1$
, and for every vertex
$v \in T_{n}^{(\textbf{w})}$
let
$d_{n}^{+}(v)$
denote its outdegree. Given
$T_{n}^{(\textbf{w})}$
, the tree
$T_{n+1}^{(\textbf{w})}$
is derived from
$T_{n}^{(\textbf{w})}$
by incorporating a new vertex u and creating an edge between u and a vertex
$v_{n} \in T_{n}^{(\textbf{w})}$
chosen at random according to the law
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU19.png?pub-status=live)
We point out that different choices of the sequence
$\textbf{w}$
yield well-known families of trees. Some of these families are summarized in Table 1; see [Reference Szymański36], [Reference Aldous1], [Reference Mahmoud26], and [Reference Pittel32] for background.
Preferential attachment trees can be constructed via CMJ-processes as in Definition 1. More precisely, consider the characteristic (or weight)
$\phi \equiv 1$
and a CMJ-process with birth times
$\xi_{i} = \sum_{k=1}^{i} X_{k}$
for
$i \in \mathbb{N} \cup \{0\}$
(with the convention
$\xi_{0} = \sum_{k=1}^{0} X_{k} =0$
), where
$X_{i} = \xi_{i} - \xi_{i-1}$
, for
$i \in \mathbb{N}$
, are independent random variables and distributed according as an exponential random variable of parameter
$w_{i-1}$
. In other words, we find that the process
$(\Xi([0,t]), t\geq 0)$
is a pure birth process starting at 0 with birth rate
$w_{k}$
when the state is
$k \in \mathbb{N} \cup \{0\}$
. In this example, the lifetime of the individuals
$\lambda \equiv \infty$
. Henceforth we assume that the pure birth process
$(\Xi([0,t]), t\geq 0)$
is non-explosive, that is,
Table 1: Examples of general preferential attachment trees.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_tab1.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn9.png?pub-status=live)
see [Reference Athreya2] for details. This implies that each individual in the CMJ-process has a.s. a finite number of children in each finite interval. Furthermore, note that
$\hat{\Xi}(\theta) = \sum_{k=1}^{\infty} {\textrm{e}}^{-\theta \xi_{k}}$
for
$\theta >0$
. Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU20.png?pub-status=live)
Assume that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU21.png?pub-status=live)
This implies that
$w_{1} > 0$
and that the condition of non-explosion (9) is fulfilled. At the same time, it should be plain that condition
$(\textbf{A4})$
is verified. Thus the Malthusian parameter exists, that is, there exists
$\alpha > \varepsilon_{1}$
such that
$\hat{\mu}(\alpha) =1$
. Finally, we further assume that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU22.png?pub-status=live)
Hence the conditions (A1)–(A7) are satisfied and Theorem 1 implies the following result.
Corollary 1. In the supercritical regime, under
$(\textbf{E1})$
–
$(\textbf{E2})$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU23.png?pub-status=live)
Finally, Corollary 1 allows us to recover some of the cases studied in [Reference Bertoin7]; see [Reference Holmgren and Janson19, Section 6] for details of the calculations. See Table 2.
Table 2: Some values of
$\hat{\mu}(\theta)$
,
$\alpha$
, and
$\bar{\mu}(\alpha)$
for several distributions.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_tab2.png?pub-status=live)
3.2. The m-ary search tree
The m-ary search trees, where
$m \geq 2$
is a fixed integer, were first introduced in [Reference Muntz and Uzgalis27]. In particular,
$m=2$
corresponds to the binary search tree described in Table 1 (Section 3.1). An m-ary search tree is an m-ary tree constructed recursively from a sequence of keys (real numbers), where each vertex stores up to
$m-1$
keys. More precisely, we start from a tree containing just an empty vertex (the root). Assume that the keys are i.i.d. random variables with a continuous distribution on
$\mathbb{R}$
. Then add keys one by one until the
$(m-1)$
th key is placed in the root (i.e. the root becomes full) and add m new empty vertices as children of the root. Furthermore, the
$m-1$
keys in the root divide the set of real numbers into m intervals
$I_{1}, \ldots, I_{m}$
that we associate with each of the m children of the root. Then each further key is passed to one of the children of the root depending on which interval it belongs to, that is, a key in
$I_{i}$
is stored in the ith child. Finally, we continue by iterating this procedure in an obvious way every time a vertex becomes full. This construction yields the extended m-ary search tree. In this setting, the vertices containing at least one key are called internal and the empty vertices are called external. In this work we have decided to eliminate the external vertices and consider the tree consisting of the internal nodes only. This is the m-ary search tree (in any case our results also apply to extended m-ary search tree). We also consider m-ary search trees with a fixed number of keys, say
$n \in \mathbb{N}$
. In other words, we stop the previous procedure at the time when the nth key is added and let
$T_{n}^{(m)}$
denote the resulting (random) m-ary search tree with n keys. Note that the number of vertices of
$T_{n}^{(m)}$
is actually random.
Following [Reference Holmgren and Janson19, Section 7.2], we can construct
$T_{n}^{(m)}$
as the family tree of a CMJ-process. Consider a continuous-time version of the construction procedure of an m-ary search tree and start with one vertex (the root) with a single key. The root acquires more keys after successive independent waiting times
$Y_{2}, \ldots, Y_{m-1}$
, where
$Y_{i}$
is an exponential random variable of parameter
$i \in \{2, \ldots, m\}$
. At the arrival of the
$(m-1)$
th key, at time
$\sum_{i=2}^{m-1} Y_{i}$
(with the convention that the sum is equal to 0 when
$m=2$
), the root gets m children with one key for each of them, marked by
$1, \ldots, m$
, with the child k born after a further waiting time
$X_{k}$
, i.e. at time
$\sum_{i=2}^{m-1} Y_{i} + X_{k}$
, where
$X_{1}, \ldots, X_{m}$
are independent and exponentially distributed random variables of parameter 1. Finally, we continue growing the tree in an obvious way. Clearly, the CMJ-process associated with an m-ary search tree possesses birth times
$\xi_{k} = \sum_{i=2}^{m-1} Y_{i} + X_{k}$
, for
$k =1, \ldots, m$
(note that
$N=m$
is non-random), and lifetime of each individual
$\lambda \equiv \infty$
. By considering the characteristic
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU24.png?pub-status=live)
we see that
$T^{\phi_{m}}_{n}$
, in Definition 1, is a random m-ary search tree with n keys. Note that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU25.png?pub-status=live)
Hence a simple computation implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn10.png?pub-status=live)
In particular, we see that the Malthusian parameter is
$\alpha =1$
. Furthermore,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU26.png?pub-status=live)
which implies that
$\operatorname{Var}(\hat{\Xi}(\theta)) < \infty$
for
$\theta > -1/2$
. Thus it should be clear that conditions (A1)–(A7) are satisfied. Consequently, Theorem 1 implies the following result.
Corollary 2. In the supercritical regime, we have
$\lim_{n \rightarrow \infty} n^{-1} |T^{(m)}_{n}| = 2(H_{m}-1) \text{e}^{-c/(H_{m} -1)}$
in probability, where
$H_{m} = \sum_{i=1}^{m} i^{-1}$
.
Proof. The result follows from Theorem 1 by computing
$\bar{\mu}(1)$
and
$\mathbb{E}[\hat{\phi}_{m}(1)]$
. Note that (8) and (10) show that
$\bar{\mu}(1) = - \hat{\mu}^{\prime}(1) = H_{m}-1$
. Note also that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU27.png?pub-status=live)
Therefore a direct computation shows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU28.png?pub-status=live)
which concludes the proof.□
3.3. Median-of-
$(2 \ell+ 1)$
binary search tree
The random median-of-
$(2\ell+1)$
binary search tree, for
$\ell \in \mathbb{N}$
(see e.g. [Reference Devroye13]), is a modification of the binary search tree (or 2-ary search tree), where each internal vertex contains exactly one key, but each external vertex can contain up to
$2\ell$
keys (recall that keys are real numbers).
This tree is constructed recursively from an initial tree with a single external vertex without any keys. Then we add keys one by one until the
$(2\ell+1)$
th key is placed at this first external vertex (or to another external vertex later in the process). The vertex becomes an internal one with two new external vertices as its children, say
$v_{L}$
and
$v_{R}$
. Immediately, the median of the
$2\ell+1$
keys at the vertex is computed and put at the external vertex, while the
$\ell$
keys that are smaller than the median are put in the left child
$v_{L}$
and the
$\ell$
keys that are larger than the median are put in the right child
$v_{R}$
. We continue by adding new keys to the root and send them to the left or to the right whenever they are smaller or larger than the median of the first
$2\ell+1$
keys. Finally, we iterate this procedure in an obvious way in order to grow the tree until
$n \in \mathbb{N}$
keys have been added. We let
$T_{n}^{(\ell)}$
denote the random median-of-
$(2\ell + 1)$
binary search tree with n keys.
Following [Reference Holmgren and Janson19, Section 8], we can construct a median-of-
$(2\ell + 1)$
binary search tree via a CMJ-process. Start with one vertex (the root) with
$\ell$
keys (note that this is not a problem because the first
$\ell$
keys always go there). Then each external vertex will contain between
$\ell$
and
$2\ell$
keys, throughout the process. On the other hand, a vertex acquires
$\ell+1$
additional keys after successive independent waiting times
$Y_{1}, \ldots, Y_{\ell+1}$
, where
$Y_{i}$
has exponential distribution of parameter
$\ell+i$
, for
$i=1, \ldots, \ell+1$
. At the time when the
$(\ell+1)$
th key arrives, the vertex immediately gets two children, each containing
$\ell$
keys. Therefore it should be clear that the CMJ-process related to the median-of-
$(2\ell+ 1)$
binary search tree has birth times
$\xi_{1}=\xi_{2} = \sum_{i=1}^{\ell+1} Y_{i}$
(in distribution) and where each individual has lifetime
$\lambda \equiv \infty$
. In this case
$N=2$
. Define the characteristic
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU29.png?pub-status=live)
for
$t \geq 0$
(with the convention
$\sum_{i=1}^{0}Y_{i} = 0$
). Therefore the tree
$T_{n}^{\phi_{\ell}}$
in Definition 1 is a median-of-
$(2\ell + 1)$
binary search tree with n keys. In this example, note that
$\hat{\Xi}(\theta) = 2\exp({-}\theta \sum_{i=1}^{\ell+1} Y_{i})$
. Hence
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn11.png?pub-status=live)
We deduce that the Malthusian parameter is
$\alpha =1$
. Furthermore, it is not difficult to see that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU30.png?pub-status=live)
Thus it should be plain that all the conditions (A1)–(A7) are satisfied. Consequently, Theorem 1 implies the following result.
Corollary 3. In the supercritical regime, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU31.png?pub-status=live)
Proof. By Theorem 1, we only need to compute
$\bar{\mu}(1)$
and
$\mathbb{E}[\hat{\phi}_{\ell}(1)]$
. Note that (8) and (11) show that
$\bar{\mu}(1) = - \hat{\mu}^{\prime}(1) = H_{2 \ell +2}-H_{\ell +1}$
. Note also that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU32.png?pub-status=live)
Therefore a simple but tedious computation implies that
$\mathbb{E}[\hat{\phi}_{\ell}(1)] = (\ell +1)(H_{2 \ell +2}\break -H_{\ell +1})$
.□
3.4. Fragmentation trees
In this section we study family trees induced by fragmentation processes. These processes were introduced in [Reference Kolmogoroff24]; see also [Reference Bertoin6] and [Reference Janson and Neininger22] for general background and further references. Fix
$b \geq 2$
and consider a random vector
$\textbf{V} = (V_{1}, \ldots, V_{b})$
; this is the so-called dislocation law. Assume that
$0 \leq V_{i} < 1$
a.s., for
$i =1, \ldots, b$
, and
$\sum_{i=1}^{b} V_{i} = 1$
, that is,
$\textbf{V}$
belongs to the standard simplex.
We then describe the construction of the fragmentation tree. Start with a vertex (the root) with mass
$x_{0}$
. This vertex has b children with masses
$x_{0}V_{1}, \ldots, x_{0}V_{b}$
, that is, we break
$x_{0}$
into b pieces with masses driven by the dislocation law
$\textbf{V}$
. Consider a threshold
$x_{1} \in (0, x_{0}]$
, and continue recursively with each vertex that has mass larger than
$x_{1}$
, using new (independent) copies of
$\textbf{V}$
each time. The process terminates a.s. after a finite number of steps, leaving a finite set of vertices (or fragments) with masses smaller than
$x_{1}$
. We regard the vertices of mass larger than
$x_{1}$
that occur during this process as the internal vertices and the resulting vertices of mass strictly less than
$x_{1}$
as external. Note that the fragmentation tree depends only on the ratio
$x_{0}/x_{1}$
, so we denote it by
$T_{x_{0}/x_{1}}^\textrm{f}$
.
One can relate the fragmentation process to a CMJ-process by regarding a fragment of mass x as born at time
$\log(x_{0}/x)$
. In other words, a vertex will have b children that are born at times
$\xi_{i} = - \log V_{i}$
, for
$i =1, \ldots, b$
(observe that
$N=b$
in this case). If
$V_{i}=0$
, we have
$\xi_{i} = \infty$
, meaning that this child is not born, and thus a vertex has fewer than b children. Note also that the lifetime
$\lambda = \infty$
. Finally, it is easy to see that the fragmentation tree
$T_{x_{0}/x_{1}}^\textrm{f}$
is the same as the family tree of this CMJ-process at time
$\log(x_{0}/x_{1})$
, i.e.
$T(\log(x_{0}/x_{1}))$
in the notation of Section 1.1.
By using the characteristic
$\phi \equiv 1$
, we define the fragmentation tree
$T_{n}^\textrm{f} \coloneqq T(\tau_{n}^{\phi})$
of fixed size
$n \in \mathbb{N}$
as in Definition 1. This means that we choose a threshold
$x_{1} > 0$
to be the mass of the nth largest fragment in the process, so that there will be exactly n fragments of size
$x_{1}$
(unless there is a tie). In this case, note that
$\hat{\Xi}(\theta) = \sum_{i=1}^{b} \,{\textrm{e}}^{- \theta \xi_{i}} = \sum_{i=1}^{b} V_{i}^{\theta}$
. Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn12.png?pub-status=live)
Thus we conclude that the Malthusian parameter is
$\alpha=1$
. This has the consequence that the martingale
$W^{\psi}$
(with
$p_{n} \equiv 1$
), in Section 2, is constant 1. Then we find that its limit
$W^{\psi}(\infty) \equiv 1$
. Furthermore, we also find that
$\operatorname{Var} (\hat{\Xi}(\theta) ) < \infty$
, for
$\theta \geq 0$
. Thus the conditions (A1)–(A7) are satisfied and Theorem 1 implies the following result.
Corollary 4. In the supercritical regime, we have
$\lim_{n \rightarrow \infty} n^{-1}|T_{n}^\textrm{f}| = {\textrm{e}}^{-{c}/{ \beta}}$
, in probability, where
$\beta \coloneqq \sum_{i=1}^{b} \mathbb{E}[V_{i} \log(1/V_{i})]$
.
Proof. The result follows from Theorem 1. Since
$\phi \equiv 1$
, we need only compute
$\bar{\mu}(1)$
, but note that (8) and (12) imply that
$\bar{\mu}(1) = - \hat{\mu}^{\prime}(1) = \beta$
.□
Example 1. (Binary splitting.) Consider
$b =2$
and
$\textbf{V} = (V_{1}, V_{2}) =(V_{1}, 1-V_{1})$
, where
$V_{1}$
is a uniform random variable on (0,1). Thus, at each fragmentation event, the fragment is split into two parts, with uniformly random sizes. In the corresponding CMJ-process the birth times
$\xi_{1}$
and
$\xi_{2}$
are exponential random variables with parameter 1, where one of them determines the other by
${\textrm{e}}^{-\xi_{1}} + {\textrm{e}}^{-\xi_{2}} = 1$
. Furthermore,
$\hat{\mu}(\theta) = (1+\theta)^{-1}$
for
$\theta \geq 0$
, and
$\bar{\mu}(1) = 1/2$
. Finally, note also that there are similarities with the CMJ-process associated with the binary search tree in Table 1 (Section 3.1); the difference is that there
$\xi_{1}$
and
$\xi_{2}$
are independent, while here they are dependent.
Finally, we should mention that the split trees defined by Devroye [Reference Devroye14] are related to fragmentation trees. A split tree is a b-ary tree defined using a number of balls that enter the root and are distributed (randomly and recursively) to the subtrees of the root and further down in the tree according to certain rules that are based on a splitting law
$\textbf{V}$
; see [Reference Devroye14] for details. For instance, binary search trees are a particular type of split tree. Percolation on split trees will be studied in another paper.
3.5. Homogeneous CMJ-trees
Let
$\Lambda$
be a finite positive measure on
$(0, \infty]$
with total mass
$b \coloneqq \Lambda((0, \infty])$
such that
$m\coloneqq \int_{(0, \infty]} t \Lambda({\textrm{d}} t)$
satisfies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU66.png?pub-status=live)
Consider a CMJ-process with birth process
$\Xi$
whose intensity measure is given by
$\mu(\textrm{d}t) = \textrm{d}t \Lambda((t, \infty])$
. Moreover, each individual has lifetime given by a random variable
$\lambda$
with distribution
$\Lambda(\kern-2pt\cdot\kern-2pt) /b$
. Note that, conditional on the birth time and lifetime, the birth point process of an individual is distributed as a Poisson point process during his life. We can say that the CMJ-process is homogeneous (constant birth rate) and binary (birth occurs singly). Set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU33.png?pub-status=live)
and observe that
$\Psi$
is a convex function such that
$\Psi(0+) =0$
and
$\Psi^{\prime}(0+) = 1-m < 0$
. Hence there exists a unique
$\alpha > 0$
such that
$\Psi(\alpha) = 0$
.
In this section we are interested in studying Bernoulli bond-percolation on the family tree of this CMJ-process. More precisely, we consider the characteristic
$\phi \equiv 1$
and define the CMJ-tree
$T_{n}^{\textrm{hom}} \coloneqq T(\tau^{\phi}_{n})$
as in Definition 1. The family tree of this particular CMJ-process was called a splitting tree in [Reference Geiger17], [Reference Geiger and Kersting18], and [Reference Lambert25]. Further, these papers studied the case when
$\Lambda$
is not necessary finite, but for simplicity we have decided to restrict ourselves to finite measures. Nevertheless, our results can be applied to the general case.
In [Reference Richard33, Chapter 3], the author studied this CMJ-process under neutral rare mutations, where mutations occur at birth with probability
$1-p \in [0,1]$
. The difference from our setting is that in [Reference Richard33, Chapter 3] the probability of mutation (or percolation parameter) does not depend on the ‘size’ of the tree. Therefore the result in this section may be of independent interest.
We now check that assumptions (A1)–(A7) are satisfied. Clearly, (A1)–(A2) are fulfilled by the assumptions made on
$\Lambda$
. Note that in this case
$(\textbf{A3})$
is not fulfilled. Nevertheless, [Reference Richard33, Proposition 2.1; see also (2.1)] shows that the extinction probability
$\mathbb{P}(Z(\infty) < \infty) = 1-\alpha/b < 1$
. This has the consequence that the limit of the martingale
$W^{\psi}$
(with
$p_{n}\equiv 1$
), in Section 2, is strictly positive (i.e.
$W^{\psi}(\infty) > 0$
a.s.) on the event
$\{Z(\infty) = \infty\}$
; see [Reference Jagers and Nerman21, Corollary 4.2]. Thus our results hold conditioned on the event
$\{Z(\infty) = \infty\}$
since
$(\textbf{A3})$
is only needed to guarantee that
$W^{\psi}(\infty) > 0$
almost surely. On the other hand,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU34.png?pub-status=live)
which clearly shows that
$(\textbf{A4})$
is satisfied. Moreover, the Malthusian parameter is given by
$\alpha > 0$
. Note also that Campbell’s formula implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU35.png?pub-status=live)
which implies
$(\textbf{A5})$
. Finally, (A6)–(A7) follow immediately since
$\phi \equiv 1$
. Therefore Theorem 1 implies the following result.
Corollary 5. In the supercritical regime and under (E3), conditional on the event
$\{Z(\infty) = \infty\}$
, we have
$\lim_{n \rightarrow \infty} n^{-1} |T_{n}^{\textrm{hom}}| = \text{e}^{-c/(\Psi^{\prime}(\alpha))}$
, in probability.
Proof. The result follows from Theorem 1 by computing
$\bar{\mu}(\alpha)$
since
$\phi \equiv 1$
. This follows from (3):
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU36.png?pub-status=live)
□
Appendix A. Proofs of Lemmas 2 and 3
In this section we establish some general results on the long time behavior of the CMJ-process with neutral mutations that may be of independent interest. It will be helpful to write p rather than
$p_{n}$
, omitting the integer n from the notation. To be more precise, we consider that the percolation parameter is a real number
$p \in [0,1]$
and study the behavior of the
$\phi$
-counted clonal process
$Z_{\varnothing}^{(p), \phi} = (Z_{\varnothing}^{(p), \phi}(t), t \geq 0)$
as
$p \rightarrow 1$
and
$t \rightarrow \infty$
. Recall that
$\Xi^{(p)}$
denotes the generic birth process of the clonal CMJ-process whose intensity measure
$\mu^{(p)}$
is defined in (2).
Note that
$(\textbf{A4})$
implies that there exists
$p^{\ast} \in (0,1)$
such that for
$p \in [p^{\ast},1]$
there exists
${\alpha_{p} > 0}$
(the Malthusian parameter of
$\mu^{(p)}$
) such that
$\hat{\mu}^{(p)}(\alpha_{p}) =1$
. This implies that
$p \mathbb{E}[N] > 1$
(i.e. the clonal process is supercritical). Since
$\alpha_{p} \rightarrow \alpha$
as
$p \rightarrow 1$
, we choose
$p^{\ast}$
such that
$0 < \theta_{1} < \alpha_{p^{\ast}}$
where
$\theta_{1}$
satisfies (A4)–(A5). Furthermore, we also consider
$p^{\ast}$
such that
$0 < \theta_{2} < \alpha_{p^{\ast}}$
and
$0 < \theta_{3} < 2\alpha_{p^{\ast}}$
, where
$\theta_{2}$
and
$\theta_{3}$
satisfy
$(\textbf{A6})$
and
$(\textbf{A7})$
, respectively.
We start by recalling some well-known results about the moments of
$Z_{\varnothing}^{(p), \phi}$
. For
$k \in \mathbb{N} \cup \{ 0 \}$
, we let
$\nu^{\ast k}$
denote the k-fold convolution of a measure
$\nu$
on
$[0, \infty)$
(here
$\nu^{\ast 0}$
is a unit point mass at 0).
Theorem 2. Assume that conditions
$(\textbf{A1})$
–
$(\textbf{A4})$
are fulfilled. For a characteristic
$\phi$
that may depend on p, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU37.png?pub-status=live)
Furthermore, if
$\mathbb{E}[\phi(t)]$
is bounded on finite intervals,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU38.png?pub-status=live)
with
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn13.png?pub-status=live)
and where
$(\Xi_{\varnothing}^{(p)}, \phi_{\varnothing})$
is the birth process and weight associated with the progenitor of the population.
Proof. The first claim is a consequence of [Reference Jagers and Nerman21, Theorem 3.1]. Note that
$(\textbf{A1})$
and
$(\textbf{A4})$
imply that the measure
$\sum_{k=0}^{\infty} (\mu^{(p)})^{\ast k} (\textrm{d} t)$
is finite. Moreover,
$\mathbb{E}[ Z_{\varnothing}^{(p), \phi}(t)] < \infty$
, for
$t \geq 0$
, since
$\mathbb{E}[\phi(t)]$
is bounded on finite intervals. Therefore the second claim follows from [Reference Jagers and Nerman21, Theorem 3.2].□
We next provide an improvement of the results of [Reference Jagers20, Theorem 6.9.2] and [Reference Jagers and Nerman21, Theorem 3.5] on the asymptotic behavior of the first and second moment of the clonal CMJ-process. Recall that we write
$W^{(p), \phi}_{\varnothing} = (W^{(p), \phi}_{\varnothing}(t), t \geq 0)$
for the process given by
$W^{(p), \phi}_{\varnothing}(t) \coloneqq {\textrm{e}}^{-t\alpha_{p} } Z^{(p), \phi}_{\varnothing}(t)$
, for
$t \geq 0$
. Set
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU39.png?pub-status=live)
Recall also that for
$p\equiv1$
we sometimes remove the superscript (p) and the subscript
$\varnothing$
from the previous notations. That is, we write
$W^{\phi} = (W^{\phi}(t), t \geq 0)$
for the processes given by
$W^{\phi}(t) \coloneqq {\textrm{e}}^{-t\alpha } Z^{\phi}(t)$
and
$m_{t}^{\phi} = \mathbb{E} [ W^{\phi}(t) ]$
.
Proposition 2. Assume that conditions
$(\textbf{A1})$
–
$(\textbf{A4})$
are fulfilled.
(i) For any characteristic
$\phi$ that does not depend on p and that satisfies
$(\textbf{A6})$ , we have
where\begin{equation*} \lim_{t \rightarrow \infty} \sup_{p \in [p^{\ast}, 1]} | m_{t}^{(p), \phi} - m_{\infty}^{(p), \phi} | = 0,\end{equation*}
$m_{\infty}^{(p), \phi}$ is defined in (7). In particular,
$ \sup_{t \geq 0} \sup_{p \in [p^{\ast},1]} m_{t}^{(p), \phi} < \infty$ .
(ii) For the characteristic
$\psi$ defined in (5), we have
In particular,\begin{equation*} \lim_{t \rightarrow \infty} \sup_{p \in [p^{\ast}, 1]} | m_{t}^{(p), \psi} - m_{\infty}^{(p), \psi} | = 0.\end{equation*}
$ \sup_{t \geq 0} \sup_{p \in [p^{\ast},1]} m_{t}^{(p), \psi} < \infty$ .
Proof. We only prove (i). The proof of (ii) follows from exactly same argument and Lemma 1 (i). Recall from Remark 1 that
$\mu_{\alpha}^{(p)}({\textrm{d}} t) \coloneqq {\textrm{e}}^{-t\alpha_{p}} \mu^{(p)}({\textrm{d}} t)$
, for
$p \in [p^{\ast}, 1]$
, is a probability measure on
$(0, \infty)$
. Theorem 2 implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU42.png?pub-status=live)
where we have used that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU43.png?pub-status=live)
From
$(\textbf{A6})$
, we deduce that the family of functions
$t \mapsto {\textrm{e}}^{-t\alpha_{p}} \mathbb{E}[\phi(t)]$
, for
$p \in [p^{\ast}, 1]$
, it is uniformly directly Riemann integrable (see [Reference Tsirelson37, Definition 2.8]). Furthermore,
$(\textbf{A4})$
implies that the family of probability measures
$\{ \mu_{\alpha}^{(p)}\colon p \in [p^{\ast}, 1] \}$
is weakly compact (treated as a set of measure on
$(0,\infty)$
), and uniformly integrable, that is,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU44.png?pub-status=live)
Therefore the point (i) is a consequence of the uniform version of the key renewal theorem [Reference Tsirelson37, Theorem 2.12] since
$\mu$
satisfies
$(\textbf{A2})$
. The second claim in (i) follows from the definition of
$m_{\infty}^{(p), \phi}$
by noting that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU45.png?pub-status=live)
we also need to recall that
$\bar{\mu}^{(1)}(\alpha) >0$
by Remark 2. □
By Proposition 2,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU46.png?pub-status=live)
is well-defined. For
$p \equiv 1$
, we sometimes write
$v_{t}^{\phi} = \operatorname{Var} ( W^{\phi}(t) )$
, for
$t \geq 0$
.
Proposition 3. Assume that conditions
$(\textbf{A1})$
–
$(\textbf{A5})$
are fulfilled.
(i) For any characteristic
$\phi$ that does not depend on p and that satisfies
$(\textbf{A6})$ –
$(\textbf{A7})$ , we have
where\begin{equation*} \lim_{t \rightarrow \infty} \sup_{p \in [p^{\ast}, 1]} |v_{t}^{(p), \phi} -v_{\infty}^{(p), \phi} | = 0,\end{equation*}
\begin{equation*}v_{\infty}^{(p), \phi} \coloneqq ( m_{\infty}^{(p), \phi} )^{2} \dfrac{\operatorname{Var}(\hat{\Xi}^{(p)}(\alpha_{p}))}{1-\hat{\mu}^{(p)}(2 \alpha_{p})}.\end{equation*}
(ii) For the characteristic
$\psi$ defined in (5), we have
where\begin{equation*} \lim_{t \rightarrow \infty} \sup_{p \in [p^{\ast}, 1]} |v_{t}^{(p), \psi} -v_{\infty}^{(p), \psi} | = 0,\end{equation*}
$ v_{\infty}^{(p), \psi} \coloneqq \operatorname{Var}(\hat{\Xi}^{(p)}(\alpha_{p})) (1-\hat{\mu}^{(p)}(2 \alpha_{p}))^{-1}$ .
(iii) For the characteristic
$\phi^{\prime} = \phi + m_{\infty}^{(p), \phi} \psi$ , we have
where\begin{equation*} \lim_{t \rightarrow \infty} \sup_{p \in [p^{\ast}, 1]} |v_{t}^{(p), \phi^{\prime}} -v_{\infty}^{(p), \phi^{\prime}} | = 0,\end{equation*}
$ v_{\infty}^{(p), \phi^{\prime}} = 4 v_{\infty}^{(p), \phi}$ .
Proof. We only prove (i). The proofs of (ii) and (iii) follow similarly by using Lemma 1 and Remark 3. Theorem 2 implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU51.png?pub-status=live)
where the function
$h^{(p)}_{\varnothing}$
is defined in (13). First, note the identity
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn14.png?pub-status=live)
since
$\hat{\mu}^{(p)}(2 \alpha_{p}) < \hat{\mu}^{(p)}(\alpha_{p}) =1$
. Then the triangle inequality implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn15.png?pub-status=live)
where
$(\Xi_{\varnothing}^{(p)}, \phi_{\varnothing})$
is the birth process and weight associated with the progenitor of the population, and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU52.png?pub-status=live)
Let
$I_{1}^{(p)}(t)$
,
$I_{2}^{(p)}(t)$
, and
$I_{3}^{(p)}(t)$
, respectively, denote the first, second, and third terms on the right-hand side of (15). Then the claim in Proposition 3 follows by showing that
(a)
$\lim_{t \rightarrow \infty} \sup_{p \in [p^{\ast}, 1]} I_{1}^{(p)}(t) = 0$ ,
(b)
$\lim_{t \rightarrow \infty} \sup_{p \in [p^{\ast}, 1]} I_{2}^{(p)}(t) = 0$ , and
(c)
$\lim_{t \rightarrow \infty} \sup_{p \in [p^{\ast}, 1]} I_{3}^{(p)}(t) = 0$ .
We start by showing (a). By assumption
$(\textbf{A7})$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn16.png?pub-status=live)
Then (14) and the dominated convergence theorem prove point (a).
Next we show (b). The Cauchy–Schwarz inequality and Proposition 2 imply that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU53.png?pub-status=live)
Since
${\textrm{e}}^{-u\alpha_{p} } \Xi^{(p)}(\textrm{d} u)$
is dominated by
${\textrm{e}}^{-u\alpha_{p^{\ast}}} \Xi(\textrm{d} u)$
, (A4)–(A5) and (16) allow us to deduce that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU54.png?pub-status=live)
Hence an application of the dominated convergence theorem shows (b).
Finally, we prove (c). We show that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn17.png?pub-status=live)
which together with an application of the dominated convergence theorem implies (c). Observe that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn18.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU55.png?pub-status=live)
Proposition 2 and
$(\textbf{A5})$
imply that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn19.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn20.png?pub-status=live)
Furthermore, Proposition 2 implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU56.png?pub-status=live)
Recall that
${\textrm{e}}^{-s \alpha_{p} } \Xi^{(p)}(\textrm{d} s)$
is dominated by
${\textrm{e}}^{-s\alpha_{p^{\ast}}} \Xi(\textrm{d} s)$
and that
$\int_{0}^{\infty} \,{\textrm{e}}^{-s\alpha_{p^{\ast}} } \Xi(\textrm{d} s) < \infty$
, by
$(\textbf{A4})$
. Thus the dominated convergence theorem shows that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU57.png?pub-status=live)
almost surely. This implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn21.png?pub-status=live)
once again using the dominated convergence theorem. Similarly, we can deduce that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn22.png?pub-status=live)
Finally, our claim in (17) follows by combining (18), (19), (20), (21), and (22). □
We now have all the ingredients to prove Lemma 2.
Proof of Lemma 2. Note that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn23.png?pub-status=live)
for
$t \geq 0$
. On the one hand, from properties of square-integrable martingales, we obtain that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn24.png?pub-status=live)
for
$t \geq 0$
. On the other hand, by Doob’s inequality
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn25.png?pub-status=live)
for
$t \geq 0$
. By combining (23), (24), and (25), we deduce that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU58.png?pub-status=live)
since
$W^{(p), \psi}_{\varnothing}$
is a martingale. Therefore the first statement follows from Proposition 3. We turn our attention to the second claim. Observe that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn26.png?pub-status=live)
for
$t \geq 0$
. It follows from the first part that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU59.png?pub-status=live)
In order to conclude, it is enough to show that the first term on the right-hand side of (26) tends to 0 uniformly on
$p \in [p^{\ast},1]$
as
$t \rightarrow \infty$
. By Proposition 2, this is equivalent to showing that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn27.png?pub-status=live)
since
$W^{(p), \phi}_{\varnothing}(t) + m_{\infty}^{(p), \phi}W^{(p), \psi}_{\varnothing}(t) = W^{(p), \phi^{\prime}}_{\varnothing}(t)$
, where
$ \phi^{\prime}(t) = \phi(t) + m_{\infty}^{(p), \phi} \psi(t)$
. But (27) follows from Proposition 3, Remark 3, and the identity
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU60.png?pub-status=live)
□
Finally, we conclude this section with the proof of Lemma 3. The idea of the proof is similar to that of [Reference Bertoin and Uribe Bravo10, Lemma 3].
Proof of Lemma 3. We first prove that the double limit
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn28.png?pub-status=live)
Denote the
$L_{2}(\mathbb{P})$
-norm by
$\| \cdot \|_{2}$
. We claim that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn29.png?pub-status=live)
Recall that at each birth event, independently of all the other individuals, the newborn is a clone of its parent with probability p or a mutant with probability
$1-p$
. Then it should be plain from the thinning property of point measure processes that the birth process of the mutant children of the ancestor
$\varnothing$
, denoted by
$\Xi_{\varnothing}^{(p), \text{m}}$
, has intensity measure given
$(1-p) \mu (\textrm{d}t)$
. Furthermore, the latter is independent of the birth process of the clonal children of the ancestor described in Section 1.2. Let
$Z^{(p), \text{m}} = (Z^{(p), \text{m}}(t), t\geq 0 )$
be the process that counts the number of mutants born up to time
$t \geq 0$
and define
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU61.png?pub-status=live)
to be the first birth time of a mutant. Plainly,
$\lim_{p \rightarrow 1} b^{(p)}_{1} = \infty$
in probability, and the probability of the event
$\{ t \geq b^{(p)}_{1} \}$
can be made as small as we wish by choosing p sufficiently close to 1. On the one hand, as
$ Z^{(p), \phi}_{\varnothing}(t) \leq Z^{ \phi}(t)$
, we have
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU62.png?pub-status=live)
and the right-hand side goes to 0 as
$p \rightarrow 1$
. On the other hand, on the event
$\{ t < b^{(p)}_{1} \}$
, we have
$ Z^{(p), \phi}_{\varnothing}(t) = Z^{ \phi}(t)$
and hence
$ W^{(p), \phi}_{\varnothing}(t) = {\textrm{e}}^{(\alpha-\alpha_{p}) t} W^{ \phi}(t)$
. This yields
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU63.png?pub-status=live)
and the right-hand side goes to 0 as
$p \rightarrow 1$
. This establishes the convergence in (29).
Let
$\varepsilon > 0$
be arbitrary. By Lemma 2, we can find
$t_{\varepsilon} > 0$
such that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn30.png?pub-status=live)
By using (29), we obtain that for
$s \geq t_{\varepsilon}$
there is
$ \delta_{\varepsilon} > 0$
such that
$1-p < \delta_{\varepsilon} $
(for
$p \in [p^{\ast}, 1)$
) implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn31.png?pub-status=live)
Let us take
$s_{1}, s_{2} \geq t_{\varepsilon}$
and
$p_{1}, p_{2} \in [p^{\ast}, 1)$
such that
$1-p_{1} < \delta_{\varepsilon} $
and
$1-p_{2} < \delta_{\varepsilon} $
. The Minkowski inequality implies that for
$s \geq t_{\varepsilon}$
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU64.png?pub-status=live)
By (30) and (31), we deduce that
$\| W^{(p_{1}), \phi}_{\varnothing}(s_{1}) - W^{(p_{2}), \phi}_{\varnothing}(s_{2}) \|_{2} \leq \varepsilon$
. Thus
$W^{(p), \phi}_{\varnothing}(t)$
is
$L_{2}(\mathbb{P})$
-Cauchy. Therefore the claim in (28) follows from the well-known completeness of
$L_{2}(\mathbb{P})$
; see [Reference Bartle3, Theorem 6.14].
Finally, we show that the claim in Lemma 3 holds. Note that (28) implies that there exists a square-integrable variable
$\overline{W}$
such that
$\lim_{p \rightarrow 1, t \rightarrow \infty} W_{\varnothing}^{(p), \phi}(t) = \overline{W}$
in
$L_{2}(\mathbb{P})$
. Thus it is enough to show that
$\overline{W} = m_{\infty}^{\phi} W^{\psi}(\infty)$
, where
$\psi$
is defined in (5) with
$p\equiv1$
. In this direction, for
$t \geq 0$
, recall that (29) shows that
$\lim_{p \rightarrow 1} W_{\varnothing}^{(p), \phi}(t) = W^{\phi}(t)$
in
$L_{2}(\mathbb{P})$
. Furthermore, Lemma 2 implies that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqn32.png?pub-status=live)
On the other hand, (28) implies that for
$\varepsilon > 0$
there are
$\delta_{\varepsilon}, t_{\varepsilon} > 0$
such that for
$1-p < \delta_{\varepsilon}$
(for
$p \in [p^{\ast}, 1)$
) and
$s \geq t_{\varepsilon}$
we have
$\| W^{(p), \phi}_{\varnothing}(s) - \overline{W} \|_{2} \leq \varepsilon$
. Hence (29) and an application of the dominated convergence theorem allow us to conclude that
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20200429081003946-0911:S0001867819000612:S0001867819000612_eqnU65.png?pub-status=live)
i.e.
$\lim_{t \rightarrow \infty} \lim_{p \rightarrow 1} W_{\varnothing}^{(p), \phi}(t) = \overline{W}$
in
$L_{2}(\mathbb{P})$
, which combined with (32) concludes the proof. □
Acknowledgements
This work was started when I was member of the Institut für Mathematische Stochastik of Georg-August-Universität Göttingen and was supported by the DFG-SPP Priority Programme 1590, Probabilistic Structures in Evolution. I would like to thank Juan Carlos Pardo for his comments on an earlier draft of this manuscript. I am very grateful to the referee, whose extremely careful reading and helpful comments led to several improvements in the exposition of this paper.