1. Introduction
A branching Lévy process describes a population of particles undergoing spatial movement, death, and reproduction. It can be defined informally as follows (for a formal definition, see Section 2). Initially there is one particle located at the origin of the real line. The particle lives for an exponentially distributed time. During this time it moves according to a Lévy process. At the time of death, the particle is replaced by a random number of new particles, displaced from the parent particle’s death position according to a point process. All particles move, die, and reproduce in a statistically identical manner, independently of every other particle. We are only concerned with the supercritical case. That is, each particle gives birth to more than one particle on average, and thus the total number of particles grows to infinity with positive probability.
The particle positions’ empirical distribution has received much attention, especially for branching random walks and branching Brownian motion, which are special cases of the model. There are many results on the empirical distribution’s maximum [Reference Biggins4, Reference Bramson5, Reference Gantert and Höfelsauer10], as well as on large deviations [Reference Louidor and Tsairi12] and on the almost-sure weak convergence to a Gaussian distribution [Reference Biggins3, Reference Gao and Liu11].
The empirical mean position, which is simple and important for applications, has received relatively little attention. For specific branching random walks, [Reference Meli, Weber and Duffy13] shows that the empirical mean position almost surely grows asymptotically linearly with time, while [Reference Duffy, Meli and Shneer7] shows that the empirical mean position’s variance converges. These results combined raise the question of characterising a second-order limit term.
For branching Lévy processes, under some mild moment assumptions on the number of offspring and their displacements, we prove a second-order limit theorem for the empirical mean position. Namely, we show that the difference between the empirical mean position at time t and rt, for some constant r, converges almost surely to a random variable.
Before proceeding with the remainder of the paper, we discuss some special cases of the model and applications.
First, consider that particles do not move during their lifetime and that each particle is displaced by
${+1}$
from its parent. A particle’s position is its generation. Our result describes the average generation, complementing results of [Reference Meli, Weber and Duffy13] and [Reference Chauvin, Klein, Marckert and Rouault6]. Second, consider instead that displacement sizes are Poisson-distributed. This is a popular model for cancer evolution [Reference Durrett8]. Here particles are cells, and a cell’s position is its number of mutations. Our result gives the average number of mutations per cell. Third, consider that particles are not displaced from their parent but move as a random walk during their lifetime. This model is seen in phylogenetics. The branching process represents speciation [Reference Aldous1], while the positions are lengths of a particular DNA segment [Reference Felsenstein9].
The remainder of the paper is organised as follows. We introduce the model in Section 2, formulate our main result in Section 3, and prove it in Section 4.
2. Model
Initially there is a single particle named
${\emptyset}$
which moves according to a Lévy process
${(Z_{\emptyset,s})_{s\geq0}}$
, with
${Z_{\emptyset,0}=0}$
and
${\mathbb{E}[Z_{\emptyset,1}^2]<\infty}$
. After an exponentially distributed waiting time
${A_\emptyset}$
, the particle dies and is replaced by a random number
${N_\emptyset}$
of new particles with
${\mathbb{E}[N_\emptyset]>1}$
and
${\mathbb{E}[N_\emptyset^2]<\infty}$
. The new particles are born at positions
${(Z_{\emptyset,A_\emptyset}+D_i)_{i=1}^{N_\emptyset}}$
. The
${D_i}$
are
${\mathbb{R}}$
-valued random variables with
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU1.png?pub-status=live)
Independence is assumed between
${(Z_{\emptyset,s})_{s\geq0}}$
and
${A_\emptyset}$
and
${(D_i)_{i=1}^{N_\emptyset}}$
(but the
${D_i}$
need not be independent of each other or of
${N_\emptyset}$
). All particles independently follow the initial particle’s behaviour.
To denote particles we follow standard notation. Let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU2.png?pub-status=live)
Here
${\mathbb{N}^0=\{\emptyset\}}$
contains the initial particle. For
${v=(v_1,\ldots,v_n)\in\mathcal{T}}$
and
${i\in\mathbb{N}}$
, write
${vi=(v_1,\ldots,v_n,i)}$
, where v is the parent of vi. To describe genealogical relationships, the set
${\mathcal{T}}$
is endowed with a partial ordering
${\prec}$
, defined by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU3.png?pub-status=live)
Write
${\preceq}$
for
${\prec}$
or
${=}$
.
Now let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU4.png?pub-status=live)
for
${v\in\mathcal{T}}$
be independent and identically distributed copies of
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU5.png?pub-status=live)
The set of all particles that ever exist is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU6.png?pub-status=live)
The particles alive at time
${t\geq0}$
are
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU7.png?pub-status=live)
Particle v at time t, if it is alive, has position
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU8.png?pub-status=live)
For further notation, the branching rate is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU9.png?pub-status=live)
the effective branching rate is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU10.png?pub-status=live)
and the movement rate is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU11.png?pub-status=live)
3. Main result
Theorem 3.1. Conditional on the event
${\{\lim_{t\rightarrow\infty}|\mathcal{T}_t|=\infty\}}$
, the limit
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU12.png?pub-status=live)
exists and is finite almost surely.
4. Proof of Theorem 3.1
Our proof will involve conditioning on whether branching occurs during the time interval [0, h] for some small
${h>0}$
. Write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU13.png?pub-status=live)
for the event that the first branching occurs after time h. Write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU14.png?pub-status=live)
for the event that the first branching occurs before time h and the second branching occurs after time h. Write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU15.png?pub-status=live)
for the event that the second branching occurs before time h. Note the probabilities
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU16.png?pub-status=live)
as
${h\downarrow0}$
. Observe the conditional distribution
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqn1.png?pub-status=live)
where
${(X_{v,t}^{\prime})_{v\in\mathcal{T}_t'}\overset{d}{=}(X_{v,t})_{v\in\mathcal{T}_t}}$
, and
${(X_{v,t}^{\prime})_{v\in\mathcal{T}_t'}}$
is independent of
${Z_{\emptyset,h}}$
. Meanwhile
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqn2.png?pub-status=live)
where
${(X^i_{v,t})_{v\in\mathcal{T}_t^i}\overset{d}{=}(X_{v,t})_{v\in\mathcal{T}_t}}$
for
${i=1,\ldots,N_\emptyset}$
, the
${(X^i_{v,t})_{v\in\mathcal{T}_t^i}}$
are independent of each other and of
${(D_i)_{i=1}^{N_\emptyset}}$
, and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU17.png?pub-status=live)
Straightforward calculations show that the first and second moments of
${\eta_h}$
converge to 0 as
${h\downarrow0}$
.
Lemma 4.1. For
${t\geq0}$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU18.png?pub-status=live)
Proof. From (4.1),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU19.png?pub-status=live)
From (4.2),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU20.png?pub-status=live)
Taking the unconditional expectation,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU21.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU22.png?pub-status=live)
Rearranging and taking
${h\downarrow0}$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU23.png?pub-status=live)
The statement of the lemma for any t now follows from the above and the fact that it clearly holds for
${t=0}$
. □
Next we determine second moments.
Lemma 4.2. For
${t\geq0}$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU24.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU25.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU26.png?pub-status=live)
Proof. From (4.1),
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU27.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU28.png?pub-status=live)
But
${\mathbb{E}|\mathcal{T}_t|}$
and
${\mathbb{E}[|\mathcal{T}_t|^2]}$
are standard knowledge [Reference Athreya and Ney2]:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU29.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU30.png?pub-status=live)
Therefore
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU31.png?pub-status=live)
where
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU32.png?pub-status=live)
and
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU33.png?pub-status=live)
Rearranging and taking
${h\downarrow0}$
,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU34.png?pub-status=live)
The statement of Lemma 4.2 now follows directly from the differential equation above. □
Next we present a martingale result for which a filtration
${(\mathcal{F}_t)_{t\geq0}}$
needs to be defined:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU35.png?pub-status=live)
Lemma 4.3.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU36.png?pub-status=live)
is a martingale with respect to
${(\mathcal{F}_t)_{t\geq0}}$
.
Proof. Write
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU37.png?pub-status=live)
for the particles alive at time t which are descendants of
${u\in\mathcal{T}}$
. Let
${0\leq s\leq t}$
. Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU38.png?pub-status=live)
Taking conditional expectations,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqnU39.png?pub-status=live)
where the last equality is due to Lemma 4.1. □
Proof of Theorem 3.1. By Lemmas 4.2 and 4.3 and the martingale convergence theorem, there is a
${\mathbb{R}}$
-valued random variable V with
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqn3.png?pub-status=live)
almost surely. But conditioned on the event
${\{\lim_{t\rightarrow\infty}|\mathcal{T}_t|=\infty\}}$
, there is a positive random variable W with
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20201123123247004-0685:S0021900220000601:S0021900220000601_eqn4.png?pub-status=live)
almost surely [Reference Athreya and Ney2]. Combine (4.3) and (4.4) to conclude the proof. □
Acknowledgements
The authors are grateful to Ken Duffy for a number of useful discussions and to the anonymous referee for a number of useful comments on the first version of our paper.