Coalescences in Continuous-State Branching Processes
Cl\'ement Foucart, Chunhua Ma, Bastien Mallein

TL;DR
This paper explores the ancestral lineages in continuous-state branching processes, introducing new coalescent models that describe genealogical structures and their long-term behaviors.
Contribution
It introduces the concept of consecutive coalescents and characterizes their law via finite measures, linking genealogies to inhomogeneous Galton-Watson processes.
Findings
Characterization of ancestral lineage processes as Siegmund duals.
Development of non-exchangeable Markovian coalescent processes.
Description of the long-term behavior and generators of these processes.
Abstract
Consider a continuous-state branching population constructed as a flow of nested subordinators. Inverting the subordinators and reversing time give rise to a flow of coalescing Markov processes (with negative jumps) which correspond to the ancestral lineages of individuals in the current generation. The process of the ancestral lineage of a fixed individual is the Siegmund dual process of the continuous-state branching process. We study its semi-group, its long-term behavior and its generator. In order to follow the coalescences in the ancestral lineages and to describe the backward genealogy of the population, we define non-exchangeable Markovian coalescent processes obtained by sampling independent Poisson arrival times over the flow. These coalescent processes are called consecutive coalescents, as only consecutive blocks can merge. They are characterized in law by finite measures on…
Click any figure to enlarge with its caption.
Figure 1
Figure 2
Figure 3
Figure 4Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Theoretical and Computational Physics · Advanced Queuing Theory Analysis
Coalescences in Continuous-State Branching Processes
**Clément Foucart ** ** LAGA, Université Paris 13, France. **[email protected]
**Chunhua Ma ** **School of Mathematical Sciences and LPMC, Nankai University, China. **[email protected]
**Bastien Mallein ** **LAGA, Université Paris 13, France. **[email protected]
Abstract
Consider a continuous-state branching population constructed as a flow of nested subordinators. Inverting the subordinators and reversing time give rise to a flow of coalescing Markov processes (with negative jumps) which correspond to the ancestral lineages of individuals in the current generation. The process of the ancestral lineage of a fixed individual is the Siegmund dual process of the continuous-state branching process. We study its semi-group, its long-term behavior and its generator. In order to follow the coalescences in the ancestral lineages and to describe the backward genealogy of the population, we define non-exchangeable Markovian coalescent processes obtained by sampling independent Poisson arrival times over the flow. These coalescent processes are called consecutive coalescents, as only consecutive blocks can merge. They are characterized in law by finite measures on which can be thought as the offspring distributions of some inhomogeneous immortal Galton-Watson processes forward in time.
Keywords: Branching processes, coalescent processes, continuous-state branching processes, flow of subordinators, genealogy, duality.
Introduction
Random population models can be divided in two classes, those with constant finite size and those whose size is varying randomly. It is known since the 2000s that populations with constant finite size, evolving by resampling, have genealogies given by exchangeable coalescents. These processes, defined by Möhle and Sagitov [MS01], Pitman [Pit99], Sagitov [Sag99] and Schweinsberg [Sch00], are generalisations of Kingman’s coalescent for which multiple coalescences of ancestral lineages are allowed. They correspond to the genealogy backward in time of so-called generalized Fleming-Viot processes. Those processes, which can be seen as scaling limits of Moran models [Mor58], were defined and studied by Donnelly and Kurtz [DK99] (via a particle system called lookdown construction) and by Bertoin and Le Gall [BLG03] (via flows of exchangeable bridges). Both constructions are similar in many aspects and are summarized via the notion of flow of partitions, see Labbé [Lab14a, Lab14b] and Foucart [Fou12]. We refer to Bertoin’s book [Ber06] for a comprehensive account on exchangeable coalescents.
The main objective of this work is to study coalescent processes induced by branching processes. We briefly explain how branching concepts have been developed from the sixties to the beginning of the twenty-first century. Continuous-state branching processes (CSBPs for short) are positive Markov processes representing the size of a continuous population. They have been defined by Jiřina [Jiř58] and Lamperti [Lam67a] and are known to be scaling limits of Galton-Watson Markov chains, see Grimvall [Gri74] and Lamperti [Lam67b]. The most famous CSBP is certainly the Feller’s branching diffusion
[TABLE]
which is the rescaled limit of binary branching processes, see Feller [Fel51] and Jiřina [Jiř69]. Feller’s CSBP is the only CSBP with continuous paths, other ones have positive jumps which represent macroscopic reproduction events in the population.
At about the same time as the rise of exchangeable coalescents, considerable research was devoted to the study of the genealogy of branching processes forward in time. Galton-Watson processes have a natural lexicographical tree’s genealogy. This representation leads Aldous [Ald93] and Duquesne and Le Gall [DLG02] to study scaling limits of discrete trees and establish remarkable convergences towards Brownian continuum tree in the Feller diffusion case and Lévy continuum tree in the case of a general CSBP. Another natural genealogy for a branching population is provided by Bertoin and Le Gall in their precursor article [BLG00] in terms of flows of subordinators. At any fixed times , the population between time and is represented by a subordinator (a Lévy process with non-decreasing paths). Individuals are ordered in such a way that ancestors from time are the jumps locations of the subordinator and each ancestor from time has a family at time whose size is the size of the jump.
Both representations with trees and subordinators are future-oriented and less attention has been paid to the description of coalescences in ancestral lineages of continuous-state branching processes. We briefly review some methods that have been developed recently in order to study the genealogy backwards in time of branching processes.
When reproduction laws are stable, branching and resampling population models can be related through renormalisation by the total size and random time-change. We refer to Berestycki et al [BBS07], Birkner et al. [BBC*+*05], Foucart and Hénard [FH13] and Schweinsberg [Sch03]. The connection between exchangeable coalescents and CSBPs is particular to stable laws and the study of the genealogy of a general branching process requires a different method.
One approach consists of conditioning the process to be non-extinct at a given time, sampling two or more individuals uniformly in the population and study the time of coalescence of their ancestral lineages. This program is at the heart of the works of Athreya [Ath12], Duquesne and Labbé [DL14], Harris et al. [HJR17], Johnston [Joh17], Lambert [Lam03] and Le [Le14].
Starting from a different point of view, Bi and Delmas [BD16] and Chen and Delmas [CD12] have considered stationary subcritical branching population obtained as processes conditioned on the non-extinction. The genealogy is then studied via a Poisson representation of the population. We refer also to Evans and Ralph [ER10] for a study in the same spirit.
A third approach is to represent the backwards genealogy through point processes. Aldous and Popovic [AP05] and Popovic [Pop04] have shown how to encode the genealogy of a critical Feller diffusion with a Poisson point process on called Coalescent Point Process. Atoms of the coalescent point process represents times of coalescences between two “consecutive” individuals in the boundary of the Brownian tree. Such a description was further developed by Lambert and Popovic [LP13] for a Lévy continuum tree. In this general setting, multiple coalescences are possible and the authors build a point process with multiplicities, which records both the coalescence times and the number of involved mergers in the families of the current population. Their method requires in particular to work with the height process introduced by Le Gall and Le Jan in [LGLJ98].
In the present article, we choose a different route and seek for a dynamical description of the genealogy. We first observe that flows of subordinators provide a continuous branching population whose size is infinite at any time and whose ancestors are arbitrarily old. We then study the inverse flow which tracks backward in time the ancestral lineage of an individual in the current population. This process corresponds to the Siegmund dual of the CSBP.
In a second time, we construct random partitions by sampling arrival times of an independent Poisson process (with a fixed intensity) on the flow. We then describe how partitions coagulate when time’s arrow points to the past and define new elementary non-exchangeable Markovian coalescents. We call these processes consecutive coalescents as only consecutive blocks will be allowed to merge. Our method follows closely that of Bertoin and Le Gall for exchangeable coalescents ([BLG03], [BLG05], [BLG06a]). Heuristically, the exchangeable bridges are replaced by subordinators and the uniform random variables by arrival times of a Poisson process.
Consecutive coalescents are simple dual objects of continuous-time Galton-Watson processes and allow one to simplify the description of the genealogy of general CSBPs given by the Coalescent Point Process as introduced in [LP13, Section 4]. We shall also answer an open question in [LP13, Remark 6] by showing how to define the complete genealogy of individuals standing in the current generation when the so-called Grey’s condition is satisfied.
In the case of Neveu’s CSBP (which does not fulfill Grey’s condition), Bertoin and Le Gall in [BLG00] have shown that the genealogy of the CSBP, started from a fixed size (without renormalization nor time-change) is given by a Bolthausen-Sznitman coalescent. We will see that for this CSBP, the consecutive coalescents have simple explicit laws. This will enable us to recover results of Möhle [Möh15] and Möhle and Kukla [KM18] about the number of blocks in a Bolthausen-Sznitman coalescent.
We wish to mention that Grosjean and Huillet in [GH16] have studied a recursive balls–in–boxes model which can be seen as a consecutive coalescent in discrete time. Moreover, Johnston and Lambert [JL18] have independently considered Poissonization techniques for studying the coalescent structure in branching processes.
The paper is organized as follows. In Section 1, we recall the definition of a continuous-state branching process and how Bochner’s subordination can be used to provide a representation of the genealogical structure associated to CSBPs. In Section 2, we investigate the inverse flow by characterizing its semi-group and studying its long-term behavior. In Section 3, we provide a complete study of the inverse flow in the case of the Feller diffusion. We recover with an elementary approach the Coalescent Point Process of Popovic [Pop04]. In Section 4, we study the coalescences in the inverse flow of a general CSBP by defining the consecutive coalescents. We describe the genealogy of the whole population standing at the current generation under the Grey’s condition (recalled in Section 1). In Section 5, we investigate the infinitesimal dynamics of the inverse flow. The process of the ancestral lineage of a fixed individual is characterized by its generator. In Section 6, we provide some examples for which calculations can be made explicitly.
Contents
-
4.1 Consecutive coalescents in continuous-time Galton-Watson processes
-
4.2 Consecutive coalescents in CSBPs through Poisson sampling
Notation.
In the rest of the article, denotes equality in law between random variables. Condition means there exists such that , and similarly means there exists such that . For any such that , the integer interval between and is denoted by .
1 Generalities on continuous-state branching processes
This section is divided in two parts. In the first one, we introduce the continuous-state branching processes as well as their fundamental properties. In the second one, we show how continuous-state branching processes can be constructed as flows of subordinators. Their main properties are also stated.
1.1 Continuous-state branching processes
We give here an overview of continuous-state branching processes and their fundamental properties. Most statements in this section can be found for instance in [Li11, Chapter 3] or [Kyp14, Chapter 12].
Definition 1.1**.**
A continuous-state branching process is a Feller process , taking values in , with [math] and being absorbing states, whose semi-group satisfies the so-called branching property:
[TABLE]
where and are two independent processes with the same law as , started respectively from and .
The branching and the Markov properties ensure that for all there exists a map , which satisfies for all , and
[TABLE]
Silverstein [Sil68] shows that is the unique solution to the integral equation
[TABLE]
where is the largest positive root of , a Lévy-Khintchine function of the form
[TABLE]
with , and a measure on satisfying . The function is called branching mechanism and characterizes the law of the CSBP. We shall say later CSBP for a CSBP with branching mechanism . The extended generator of the CSBP is as follows
[TABLE]
for any 111The space of twice differentiable continuous functions over vanishing at .. The CSBP has infinite variations if
[TABLE]
An important family of branching mechanisms are those of the form
[TABLE]
with , and . The Lévy measure associated to such a mechanism is
[TABLE]
The CSBP() is said to be supercritical, critical or subcritical if respectively , or . In the subcritical and critical cases, the largest root is [math]. In the supercritical case . The following theorem due to Grey [Gre74] summarizes the possible behaviors at the boundaries of a CSBP.
Theorem 1.A** (Grey, [Gre74]).**
Consider a CSBP started from .
For any ,
[TABLE] 2. 2.
For any , the limit exists in if and only if for some and
[TABLE]
If (1.7) holds, then for any , . 3. 3.
Under condition (1.7), the following events coincide almost-surely
[TABLE] 4. 4.
For any , the limit exists in if and only if for some and
[TABLE]
If (1.8) holds, then for any , . 5. 5.
Under condition (1.8), the following events coincide
[TABLE]
The event is called extinction, and is called explosion. We refer to the integral conditions (1.7) and (1.8) as Grey’s condition for extinction and explosion respectively. Lambert [Lam07] and Li [Li00] have studied the quasi-stationary distribution of subcritical CSBPs conditioned on the non-extinction.
Theorem 1.B** (Lambert [Lam07], Li [Li00]).**
In the subcritical case, under Grey’s condition for extinction , there exists a probability measure over such that for any Borelian set
[TABLE]
The Laplace transform of is given by
[TABLE]
1.2 Flows of subordinators
Observe that on the one hand, by the the branching property of CSBP, the random variable is a positive infinitely divisible random variable, parametrized by . Therefore, for all , the process is a positive Lévy process, hence a subordinator. In particular, the map is the Laplace exponent of this (possibly killed) subordinator, and can be written as
[TABLE]
with , and a Lévy measure on such that .
Remark 1.2*.*
Note that the quantities and defined in Theorem 1.A can be rewritten, with the formula in (1.10)
[TABLE]
Therefore (1.7) is equivalent to the finiteness of the measure for all , and (1.8) to the positivity of for all .
On the other hand, the semigroup property entails that for any ,
[TABLE]
Bochner’s subordination implies that if is a subordinator with Laplace exponent and is a subordinator with Laplace exponent , then is a subordinator with Laplace exponent . Therefore, writing an independent copy of the CSBP , we have
[TABLE]
This last observation leads Bertoin and Le Gall [BLG00] to consider representing a CSBP as a flow of subordinators, which we now define.
Definition 1.3**.**
A flow of subordinators is a family satisfying the following properties:
For every , is a càdlàg subordinator, with same law as . 2. 2.
For every , and are independent. 3. 3.
For every , . 4. 4.
For every and , we have in probability.
Remark 1.4*.*
The convergence in (iv) also holds uniformly on compact sets by second Dini’s theorem.
It was proved by Bertoin and Le Gall [BLG00] that any CSBP can be constructed as a flow of subordinators. For the sake of completeness, we prove here that CSBP and flow of subordinators are in one-to-one map.
Lemma 1.5**.**
Let be a flow of subordinators as in Definition 1.3, there exists a branching mechanism such that for all and , is a CSBP() starting from . Reciprocally, for each branching mechanism , there exists a flow of subordinators such that for all and , is a CSBP() starting from .
Proof.
Let be a flow of subordinators. By Definition 1.3(ii) and (iii), we have that is a Markov process for all and . Moreover, Definition 1.3(iv) implies this Markov process to be continuous in probability, therefore Feller, and by Definition 1.3(i), we conclude that this Markov process is homogeneous in time, and satisfies the branching property, as
[TABLE]
and is independent of and has same law as . Reciprocally, by [BLG00, Proposition 1], given a branching mechanism , there exists a process such that almost surely
for all , is a càdlàg subordinator with Lévy-Khintchine exponent , defined in (1.3), 2. 2.
for all , and are independent, 3. 3.
for all , , 4. 4.
the finite dimensional distributions of are the ones of a CSBP().
One readily observe that points (i)–(iii) imply Definition 1.3(i)–(iii). Moreover, by the fourth point, has the law of a CSBP() starting from . As is a Feller process, we have in probability, thus (iv) yields in probability, completing the proof. ∎
A noteworthy consequence of the above lemma is that if is a flow of subordinators associated to the branching mechanism , we have that for all and ,
[TABLE]
where is the function defined in (1.3). One can think of this flow of subordinators as a way to couple on the same probability space every Markov property and every branching property (1.1), for all values of simultaneously in one process.
The flow of subordinators provides a genuine continuous-space branching population model. More precisely, the interval can be interpreted as the set of descendants at time of the population that was represented at time as the interval . With this interpretation, the genealogy forward in time of the population is defined as follows. If , we say that for all , the individual at time is a descendant of the individual living at time . If (i.e. is continuous at ), we then say that individual at time is the descendant of the individual living at time if and only if . One can observe that the cocycle property ensures that this construction indeed defines a genealogy. If at time is a descendant of at time , which is a descendant of at time , we have
[TABLE]
By the cocycle property () and as is non-decreasing then
[TABLE]
thus at time is a descendant of at time . Similar computations can be written if is continuous at point and/or is continuous at point .
Recall the condition (1.6) for the sample paths of the CSBP to have infinite variations. This condition ensures the subordinator to be driftless, i.e. for all in (1.10). As a result, under (1.6), the range of the subordinator has zero Lebesgue measure, ensuring that almost every individual at time belong to one of the infinite families of ancestors at time . This, assumption (1.6) often simplifies the interpretation of results obtained in this article. Under this assumption, we denote by the set of jumps of . By definition of the genealogy, almost surely the population at time , indexed by , can be partitioned according to their ancestor at time by .
Recall that according to Theorem 1.A-(ii), Grey’s condition entails that for any , . Under this condition, the subordinators are therefore compound Poisson processes. In particular, the set is the set of arrival times of a Poisson process with intensity . Note that the partition consists of a family of consecutive intervals. This justifies the introduction of consecutive coalescents on in Section 4.
2 The inverse flow
We start this section by a preliminary observation on the genealogy backward in time of a CSBP. Consider the Poisson point process on
[TABLE]
with some renormalisation constant for all . Recall the largest positive root of and the quasi-stationary distribution (6.2) of a subcritical CSBP conditioned on the non-extinction.
Proposition 2.1**.**
Assume and set if , if . Then
[TABLE]
where is a Poisson point process with intensity respectively when , when , and when .
Remark 2.2*.*
In the supercritical case, flows of CSBPs can be renormalized to converge almost-surely. We refer to Duquesne and Labbé [DL14], Grey [Gre74], and Foucart and Ma [FM16]. Since for any time , and have the same law, we could therefore renormalize in law the size of the descendants at time [math] of from time . Typically, is of order exponential in the finite mean case (), and double exponential in the infinite mean case ().
Proof.
Under Grey’s condition, , and is a compound Poisson process with no drift. Therefore, the point process is a Poisson point process with intensity . Observe additionally that for any ,
[TABLE]
In the supercritical case (), we have for all (while ), and for all . Therefore (2.3) shows that converges weakly toward . As a result, we conclude that converges in law toward a Poisson point process on with intensity .
In the subcritical and critical cases, we have , and we set . By (1.3) and (1.2), we have . Therefore
[TABLE]
One has , thus we obtain that by monotone convergence. This limit is in the critical case (), which by (2.3) and thus converges weakly towards . In the subcritical case (), we see that converges weakly towards the probability measure with Laplace transform (1.9). We conclude the convergence of to the stated limits. ∎
Let us describe in details the meaning of the above convergence, for supercritical, critical and subcritical CSBPs. Observe that encodes information on the individuals at time having a large family of descendants at time [math]. Thus, (2.2) gives information on the origin of the earliest ancestors of the population at time [math]. Depending on the sign of , we have three different behaviours:
If , a unique ancestor from time , located at an exponential random variable with parameter , which generates all individuals at time [math]. This individual is the ancestor of the process. 2. 2.
If , then and the whole population at time [math] has a common ancestor, but the backward lineage of this ancestor converges in law as towards . 3. 3.
If , then the population at time [math] is split into distinct families, each of which coming down from a different ancestor at time .
In the (sub)critical case, individuals from generation with descendance at time [math] are located at distance from [math]. Proposition 2.1 motivates a more complete study of the ancestral lineages of individuals alive in the population at time [math]. Our main aim is to provide an almost-sure description of how the evolves and to get precise information on the sizes of the families.
We now introduce the inverse flow of the flow of subordinators and study some of its properties. We first define, for and
[TABLE]
The process is the right-continuous inverse of the càdlàg process . Note that the individual is the ancestor alive at time of the individual considered at time . It is therefore a natural process to introduce in order to study the genealogy of a CSBP backwards in time. We call inverse flow the process defined for all as follows
[TABLE]
We first list some straightforward properties of inverse flows.
Lemma 2.3**.**
The following properties hold:
Almost surely, for every and , we have . 2. 2.
For every , and are independent. 3. 3.
Almost surely, for every , . 4. 4.
For all , in probability.
Remark 2.4*.*
The convergence in (iv) also holds uniformly on compact sets.
Proof.
These results are an immediate consequence of Lemma A.1, which describes well-known properties of right-continuous inverses, and the definition of flow of subordinators. More precisely, the first point is a consequence of Lemma A.1(ii), the third one of Lemma A.1(iii) and the fourth one follows from Lemma A.1(iv) and Definition 1.3(iv).
Finally, the second point follows simply from the fact that for all , is measurable with respect to . Hence, by Definition 1.3(ii), we conclude that (ii) holds. ∎
We shall denote the flow of inverse subordinators . As noted above, it tracks backwards in time the ancestral lineages of the population at time [math]. Since individuals are ordered, can also be interpreted as the random size of the population at time whose descendance at time [math] has size . Observe that by Lemma 2.3(i) and Definition 1.3(i), we have
[TABLE]
The relation (2.5) is known as Siegmund duality. We refer the reader for instance to Siegmund [Sie76] and Clifford and Sudbury [CS85].
Theorem 2.5**.**
Fix . The process is a Markov process in . Its semigroup satisfies for any bounded measurable function and any
[TABLE]
where and are exponential random variable with parameter and and is independent of .
Observe that (2.6) characterizes the semigroup , by identification of the Laplace transforms, as it can be rewritten as: for all ,
[TABLE]
therefore is the inverse Laplace transform of .
Proof.
We observe that the cocycle property and the independence, obtained in points (ii) and (iii) of Proposition 2.3 readily entail that has the Markov property. Moreover, if then , which is impossible, as is the value at time of a CSBP starting from mass [math], and [math] is an absorbing point for a CSBP. Similarly, yields that , which is impossible as well as is a non-null subordinator.
Finally, we now turn to the computation of the semigroup of , which is obtained through the Siegmund duality. Let be an independent exponential random variable with parameter , we have
[TABLE]
which implies that (2.6) holds. ∎
The above theorem shows that the semigroup of can be expressed in simple terms when applied to exponential distributions. This will motivate later on the study of the action of the flow on Poisson point processes.
We now observe that the Markov process can be straightforwardly extended as a Markov process on .
Proposition 2.6** (Boundaries and Feller property).**
Let fixed, we denote by the Markov process .
The boundary [math] is an entrance boundary of if and only if . In that case, is extended to by
[TABLE]
Otherwise, we set . 2. 2.
The boundary is an entrance boundary of if and only if . In that case, is defined over with
[TABLE]
Otherwise, we set . 3. 3.
The semigroup defined over is Feller.
Remark 2.7*.*
The Markov processes and have the following interpretations, in terms of the CSBP
The process , starting from [math] at time [math], represents the smallest individual at generation to have descendants at time [math]. If , there is extinction in finite time for the CSBP (i.e. with positive probability, ). In that case is a non-trivial Markov process. If , there is no extinction in finite time for the CSBP, thus all individuals at time have descendants at time [math], . 2. 2.
The process , starting from , represents the smallest individual at generation with an infinite progeny at time [math]. If , there is explosion in finite time for the CSBP (i.e. with positive probability, ). In that case, is a non-trivial Markov process. If , there is no explosion in finite time and all individuals at time have finitely many descendants at time [math]. Thus and .
Proof.
For any fixed time , is non-decreasing in . Thus and exist almost-surely in . Recall the duality relation (2.5)
[TABLE]
The first point for the boundary [math] is obtained as follows. By the duality relation, we see that
[TABLE]
By letting to [math], we have
[TABLE]
According to Theorem 1.A-(ii), is a necessary and sufficient condition for . It remains to justify the formula for . By using Theorem 2.5 and the facts that in probability, and , we have for any continuous bounded function on ,
[TABLE]
by dominated convergence. We deduce the formula for . We now prove that the semigroup property holds at [math]. By definition of , we have that
[TABLE]
Therefore, as , we complete the proof of (i).
The proof of (ii) follows very similar lines to the proof of (i), and is based on the fact that is a necessary and sufficient condition for . The expression of is found using that in probability. Finally, to prove that the semigroup extended to is Feller, we observe that the random map jumps only on constant stretch of (being its right-continuous inverse). There is no fixed value in at which is constant and therefore has no fixed discontinuities. This entails that for any continuous function over , is continuous at any point . By definition and . The semigroup maps in and one only needs to show the pointwise continuity at [math] of , which follows from Proposition 2.3(iv). ∎
We study now the long term behaviour of in the critical and subcritical case. By transience, we mean that a.s. for any .
Proposition 2.8**.**
Let be a branching mechanism. We observe that
if is supercritical, then is positive recurrent with stationary law ; 2. 2.
if is subcritical, then is transient; 3. 3.
if is critical, then is transient if and only if , otherwise it is null recurrent.
Remark 2.9*.*
Intuitively, in the subcritical case, for any fixed , individuals below level living at arbitrarily large time in the past will have no progeny at time [math]. Therefore the ancestral lineage of an individual living at time [math], goes above any fixed level as time goes to . This explains the transience. In the critical case, large oscillations can occur when . This latter condition is known see Duhalde et al. [DFM14] to entails that first entrance times of the CSBP have infinite mean, in such case the process is null recurrent. Note that if with then is null recurrent if and transient if .
Proof.
We first prove (i). Let . By duality (2.5) and Theorem 1.A-(i)
[TABLE]
Assume now subcritical or critical. For any Borelian set and any , set
[TABLE]
Fix , recall and . One has
[TABLE]
By monotone convergence
[TABLE]
Set for , then
[TABLE]
In the subcritical case , therefore and for almost every , one has . Since for any , then
[TABLE]
therefore and then for all . We may now invoke Proposition 2.2-(iv’) in Getoor [Get80], by taking the increasing sequence . This entails that the process is transient. In the critical case, if then the process is transient. If now then by (2.7) for any set with positive Lebesgue measure, for all . By Proposition 2.4-(i) in [Get80], we conclude that is recurrent. ∎
3 The Feller flow
In this section, we investigate the genealogy backwards in time of Feller CSBPs. These are continuous CSBPs with quadratic branching mechanisms of the form , with and . For any fixed , the Feller CSBP with mechanism can be constructed as the solution of the stochastic differential equation
[TABLE]
where is a Brownian motion. We study here in detail the flow of CSBPs with branching mechanism and the inverse flow . Many calculations can be made explicit in this setting, see for instance Pardoux [Par08] for a study of the flow .
Note that is subcritical if , critical if and supercritical if . Moreover, in the latter case we have . Observe also that the differential equation (1.3) can be rewritten
[TABLE]
and it is a simple exercise to solve it into
[TABLE]
Therefore, one can write , by setting
[TABLE]
where by definition, for and if . Observe that in both cases, is an exponential law with parameter , which can be rewritten as
[TABLE]
Remark 3.1*.*
Observe that above, we often make a distinction between and , but the functions , or that we defined are continuous at .
We now study the law of the inverse Feller flow , in particular characterizing its marginal distributions as a process in the variable or .
Theorem 3.2**.**
The inverse flow is characterized as follows. Setting
[TABLE]
we have
for any fixed , is a Markov process with semigroup given by
[TABLE] 2. 2.
For any fixed , is a subordinator with Laplace exponent started from the positive random variable whose Laplace transform is .
Remark 3.3*.*
The map is solution to (1.3) with function . The two-parameter process is a flow of continuous-state branching processes with immigration with mechanisms and linear immigration . In particular, is a Feller CSBP with branching mechanism .
Proof.
As is a subordinator with Lévy-Khintchine exponent
[TABLE]
we obtain that this is in fact a compound Poisson process, with jump rate and exponential jump distribution with parameter . Therefore, writing an homogeneous Poisson process with intensity and i.i.d. exponential random variables with parameter , one can rewrite as
[TABLE]
We set the sequence of inter-arrival times of which are i.i.d. exponential random variables, and reciprocally we write for all , which is the Poisson process with inter-arrival times . We observe that by (3.1), being the right-continuous inverse of , we have
[TABLE]
Note that we have , contrarily to , but that is also a compound Poisson process with exponential jump rate. The construction of and are represented on Figure 1.
Note that by (3.2), we have that
[TABLE]
and moreover, for all
[TABLE]
by straightforward Poisson computations. It remains to verify that
[TABLE]
We observe that , thus deduce that from the identity ,which concludes the proof. ∎
The inverse Feller flow being itself a flow of subordinators with explicit law, many quantities can be computed explicitly, such as the most recent common ancestor of a population. Picking two individuals at time [math], the age of the most recent common ancestor of and is the first time such that there exists an individual at generation that gave birth to both and , or more precisely
[TABLE]
This definition of most recent common ancestor can naturally be generalized as follows: given a subset of , we set
[TABLE]
However, as the partition of , is a partition in intervals, we have
[TABLE]
Therefore, obtaining the law of will be enough to study the genealogy of the Feller flow.
Proposition 3.4**.**
For any , we have
[TABLE]
and and are independent. In particular, we have
[TABLE]
Among other things, this proposition proves that the population comes down from a single ancestor in critical or supercritical cases (), while in the subcritical case, for , the population at time [math] can be separated into families with different ancestors at time .
Proof.
This result is a consequence of the inverse flow representation of Theorem 3.2. Indeed, for all and , we have
[TABLE]
thus, letting we obtain . Moreover, we observe that , proving the first equation.
By (3.3), and given that and are independent Feller CSBP with mechanism , starting from and respectively, we conclude that and are independent.
To obtain we compute
[TABLE]
concluding the proof. ∎
Remark 3.5*.*
A straightforward consequence of the above coalescent is that for any choice of of individuals at generation [math], the coalescent tree of this family of individuals will only consist in binary merging. Indeed, for every pair of consecutive individuals, their time of coalescence is independent from the time of coalescence of any other pair of consecutive individuals in the population, and has density with respect to the Lebesgue measure. Therefore, almost surely the first coalescing time will consists in the merging of only two neighbours.
Proposition 3.4 readily entails the representation of the genealogical tree of the population at time [math] as a functional of a Poisson point process. The following construction is reminiscent of the comb representation by Lambert and Uribe Bravo [LUB17].
Proposition 3.6**.**
There exists a Poisson point process with intensity on where
[TABLE]
such that almost surely, for any and , we have
[TABLE]
In other words, the coalescent time of and is given by the position of the largest atom in the point process . In particular, in the critical case (), this result recovers the Brownian coalescent point process of Popovic [Pop04, Lemma 4 and Theorem 5]. In the subcritical case () when two individuals have no common ancestor, there are separated by an infinite atom of the point process .
Proof.
We observe from Proposition 3.4 that for all , and are independent and . Moreover, note by definition that a.s. This yields that for all ,
[TABLE]
We consider the event of probability one for which the above equation is true simultaneously for all . As a result, the field is decreasing in and increasing in . Therefore, there exists a càdlàg modification of the field satisfying (3.4) simultaneously for all .
As a result, we can construct a simple point process on satisfying
[TABLE]
via the construction . The point process is simple (i.e. each atom in the point process has mass one). Moreover, note that
[TABLE]
where is a Poisson point process with intensity . Hence, by monotone classes theorem, for all measurable relatively compact set , we have
[TABLE]
As a result, by [Kal02, Theorem 10.9], we have , which concludes the proof. ∎
Pitman and Yor [PY82, Sections 3 and 4], see also [DL14] for a more general setting, have shown that any flow of Feller’s branching diffusions can be represented through a Poisson point process on , where denotes the space of continuous paths on . In our setting, the flow can be represented as follows: for all ,
[TABLE]
where is a PPP with intensity and is the so-called cluster measure (see [DL14]). The atoms can be interpreted as the ancestral lineages of the initial individuals . They are independent Feller diffusions with mechanism starting from infinitesimal masses. For any , denote by . The time represents a binary coalescence time between two “consecutive” individuals. By definition of , for any , and therefore has the same law as . We represent the ancestral lineages and their coalescences in Figure 2. Recall also from Remark 2.7 that is the first individual from generation to have descendants at time [math].
In the subcritical case, , is a flow of supercritical CSBPs. Following Bertoin et al. [BFM08] (see also Pardoux [Par08, Section 7]), one can define the random sequence recursively as follows:
[TABLE]
The random sequence is known as the initial prolific individuals of the flow of supercritical CSBPs and corresponds to the jumps times of a Poisson process with intensity . Within the framework of inverse flow, the random partition of : corresponds to current families with distinct common ancestors. Note that the sequence is also the sequence of atoms of the point process , defined in Lemma 3.6.
We observed in this section that the law of the flow is explicit when is a Feller flow. When the branching mechanism is not of the quadratic form, multiple births occur in the population. Thus, when time runs backward, coalescences of multiple lineages should arise. The law of the inverse flow becomes then more involved. In the next section, we construct a simple class of Markovian coalescents which will allow us to encode easily multiple coalescences in lineages backward in time. The law of the lineage’s location for a fixed individual is studied further in Section 5.
4 Consecutive coalescents
In this section we study the genealogy of branching processes both forward and backward in time, using random partitions of consecutive integers. We shall see how to define a coalescent process in this framework and that the associated coalescent theory is elementary. In a second time, we apply these results to the genealogy of a population in a continuous-state branching process sampled according to a Poisson point process with intensity . In a third time, by making the parameter increase to , we obtain a full description of the genealogical tree of individuals in a CSBP under Grey’s condition.
4.1 Consecutive coalescents in continuous-time Galton-Watson processes
In this section, we construct a class of simple Markovian coalescents arising when studying the genealogy backward in time of continuous-time Galton-Watson processes. We begin by introducing the classical notation for coalescent processes on the space of partitions. For a more precise description of that framework, in the context of exchangeable coalescents, we refer to Bertoin’s book [Ber06, Chapter 4], from which we borrow our definitions and notation.
Let , we denote by the set of integer smaller or equal to . We call consecutive partition of a collection of disjoint subsets with consecutive integers (i.e. intervals of ), such that . Without loss of generality, we will always assume that the subsets of the collection are ranked in the increasing order of their elements. We denote by the set of consecutive partitions of . Note that any is characterized by the ranked sequence of its blocks sizes , as
[TABLE]
Clearly, a consecutive partition has at most one block with infinite size. For any , we write if and only if and belongs to the same block of . For any , we set and . We introduce some classical operations on . For each and , we denote by
[TABLE]
the restriction of to and
[TABLE]
the number of blocks of . Note that for any , .
We define a distance on the set of consecutive partitions of by setting
[TABLE]
Note that the metric space is compact. We next introduce the coagulation operation. For any and such that , we define the partition by
[TABLE]
It is straightforward that , as each of its blocks are the union of a consecutive sequence of consecutive blocks. Thus, defines an internal composition law on . Moreover for any , such that and
[TABLE]
The operator is therefore Lipschitz continuous with respect to and we easily see that it is associative. For any partition , and .
We are interested in random consecutive partitions such that blocks sizes are i.i.d. random variables in . We observe that if and are two independent random consecutive partitions with i.i.d. block sizes, then
[TABLE]
hence is a random consecutive partition with blocks coarser than those of , and with i.i.d. sizes. In view of the very particular form of a consecutive partition, it is legitimate to question whether the framework of partitions is needed. However, the use of the operator enables us to encode easily multiple coalescences and to follow closely the theory of exchangeable coalescents and its terminology. This encoding simplifies the main formulas we obtain when studying the genealogy of a continuous-state branching population.
Definition 4.1**.**
A Markov process with values in is called consecutive coalescent if its semigroup is given as follows: the conditional law of given is the law of where is some random consecutive partition with i.i.d blocks sizes and whose law may depend on and . A consecutive coalescent is said to be homogeneous if depends only on and standard if .
We now recall further well-known material on continuous-time Galton-Watson processes. We refer to Athreya and Ney [AN04, Chapter III] for more details on these processes. Consider a finite measure on such that . A continuous-time Galton-Watson process with reproduction measure , is a Markov process counting the number of individuals in a random population with ancestors where all individuals behave independently, and each individual has an exponential lifetime with parameter and begets at its death a random number of children with probability distribution . The process is characterized in law by and thus by the function
[TABLE]
The process satisfies the branching property
[TABLE]
where is a continuous-time Galton-Watson process independent of , and with the same law as . This entails that the generating function of for any has the form
[TABLE]
where for all , is the solution of for any . When has no mass at [math], the process is called immortal. Each individual has at least two children and is non-decreasing in time.
With the same procedure as in Definition 1.3, we can represent the family of continuous-time branching processes by considering a flow of random walks satisfying the following properties:
for any , is a continuous-time random walk whose jump law has support included in and generating function . 2. 2.
For every , the random walks are independent and satisfy
[TABLE] 3. 3.
For any and , is an immortal homogeneous continuous-time Galton-Watson process started from individuals.
We now construct a flow of partitions describing the genealogy of an immortal continuous-time Galton-Watson process constructed via this flow of random walks. For any , set
[TABLE]
with . Then by (ii), for any ,
[TABLE]
i.e. and by definition for any and any . We introduce the time-reversed flow of partition by defining for all ,
[TABLE]
We sum up the main straightforward properties of in the following proposition.
Proposition 4.2**.**
The stochastic flow of consecutive partitions satisfies:
For any
[TABLE] 2. 2.
If , the partitions ,…, are independent. 3. 3.
The random variables are valued in and i.i.d. 4. 4.
nd when . 5. 5.
The random variable has the same law as .
The Markov process defined by for any is an homogeneous standard consecutive coalescent in the sense of Definition 4.1. Note that by (i), for any ,
[TABLE]
namely for any ,
[TABLE]
so that consecutive blocks are merging as time runs.
Remark 4.3*.*
One can readily check from (4.2) that for any , and
[TABLE]
Processes satisfying (4.3) have been studied in discrete time by Grosjean and Huillet [GH16].
By stationarity, for any , . Therefore the coalescent process is characterized by the reproduction measure of the associated continuous-time Galton-Watson process . Moreover, note that by construction, for any
[TABLE]
This consistency property ensures that the family of jump rates of characterizes the law of . In the next lemma, the coagulation rate of a consecutive coalescent restricted to is provided.
Lemma 4.4** (Law of the -coalescent).**
Let and . Set and assume . For any , consider the consecutive partitions of
* for any , and attach to each an independent exponential clock with parameter ,*
- -
, and attach to each an independent exponential clock with parameter
where for any . Then the process jumps from the partition to with the partition in associated to the first random clock that rings.
Proof.
For any , any ,
[TABLE]
Moreover, by associativity of the operator Coag, the restricted process starting from , whose number of blocks is , has the same law as the process where is the restriction at of the standard process started from . Therefore, we only need to focus on the jump rates of the standard coalescent.
For any , the rate at which the process jumps from to is therefore given by
[TABLE]
Since has the same law as the random variable where is a continuous-time Galton-Watson process with reproduction measure , then the latter limit is .
Similarly, for any , the rate at which the process jumps from to is
[TABLE]
There is no simultaneous births forward in time and therefore no simultaneous coalescences. ∎
By letting and to in Lemma 4.4, we see that the coalescences in the consecutive coalescent process valued in can be described in the following way: to each block of is associated a family of exponential clocks, that ring at rate . Each time a clock rings, the consecutive blocks , , … , coalesce into one. Note that these clocks could also be used to construct the immortal Galton–Watson process forward in time: each time the clock rings, the th individual produces children.
We now take interest in the number of blocks of a consecutive coalescent. Similarly to the continuous-state space, the dual process defined for any and any by
[TABLE]
The process is a Markov process, and for all , is the ancestor at time of the individual considered at time [math].
Proposition 4.5**.**
For any , and any , and
[TABLE]
For any , the process jumps from to at rate and is absorbed at .
Proof.
By definition
[TABLE]
with . Consider now an integer . If then and . The rates of jumps in are readily obtained by Lemma 4.4. ∎
Remark 4.6*.*
Consecutive coalescents can be defined for a measure with a mass at [math] from the relation (4.4). However the process in this case is inhomogeneous in time. We mention that the process is studied by Li et al. in [LPLG08].
4.2 Consecutive coalescents in CSBPs through Poisson sampling
We now explain how consecutive coalescents arise in the study of the backward genealogy of CSBPs. Loosely speaking, exchangeable bridges in the theory of exchangeable coalescents, [BLG03], are replaced by subordinators and the sequence of uniform random variables by the arrival times of a Poisson process with intensity . The following typical random consecutive partitions will play a similar role as paintboxes for exchangeable coalescents.
Definition 4.7**.**
We call -Poisson box a random consecutive partition obtained by setting
[TABLE]
where is a subordinator with Laplace exponent and are the ranked atoms of an independent Poisson process with intensity .
The -Poisson boxes will occur as typical random partitions in genealogical trees of CSBPs. More precisely, in the coalescent process describing the genealogy of individuals sampled according to a Poisson point process, the partitions will be distributed as -Poisson boxes. The following Lemma is proved in Appendix A.2, and can be thought of as a revisiting of Pitman’s discretization of subordinators [Pit97].
Lemma 4.8**.**
Consider a subordinator with Laplace exponent
[TABLE]
and the arrival times of an independent Poisson process with intensity . Let be the -Poisson box constructed with and and set for any , for . Then
* is a random consecutive partition with i.i.d blocks sizes and for any *
[TABLE]
i.e. for all . 2. 2.
The sequence are the arrival times of a Poisson process of intensity . 3. 3.
* and are independent.*
Remark 4.9*.*
We shall also consider killed subordinators with a Laplace exponent that satisfies , or equivalently . The above Lemma can be extended to this case. See Corollary A.4. The associated -Poisson box has finitely many blocks. Formulas in (i) hold true and additionally each block has probability to be infinite. The sequence forms the first arrival times of a Poisson process with intensity .
We now construct consecutive coalescent processes related to the genealogy of the flow of subordinators . Denote by the sequence of arrival times of an independent Poisson process with intensity . For any , we define as
[TABLE]
The next theorem describes the law of the process .
Theorem 4.10**.**
For any , the partition-valued is a consecutive coalescent. Its semigroup is Feller and its one-dimensional marginal law is characterized by
[TABLE]
There is no simultaneous coalescences and for any , the rate at time at which given consecutive blocks coalesce is
[TABLE]
In the supercritical case, by choosing for intensity , the process becomes time-homogeneous. Corollary 4.11 is obtained by a direct application of Theorem 4.10 since for any .
Corollary 4.11**.**
Assume supercritical and take . The coalescent process is homogeneous in time and the coagulation rate of given consecutive blocks is
[TABLE]
Remark 4.12*.*
Bertoin et al. [BFM08] have shown that in any flow of supercritical CSBPs one can embedd an immortal continuous-time Galton-Watson process counting the so-called prolific individuals, whose lines of descent are infinite. The prolific individuals are located in as the arrival times of a Poisson process with intensity at any time. Moreover, this continuous-time Galton-Watson process has reproduction measure . The consecutive coalescent represents its genealogy backward in time.
We prove Theorem 4.10. We stress that by definition, from (4.5), is a -Poisson box and since . Our first lemma proves that the partition-valued process is Markovian in its own filtration and is a consecutive coalescent (possibly inhomogeneous in time) in the sense of Definition 4.1.
Lemma 4.13**.**
For any
[TABLE]
where is a -Poisson box which is independent of .
Proof.
For any and all , set for all . Let the random consecutive partition defined by
if and only if .
Then by the key lemma 4.8-(ii), is a -Poisson box which is independent of . Recall the cocycle property (Theorem 2.5-i)). Let . Set and such that and . By the cocycle property, holds if and only if and (4.8) holds by definition of the operator , see (4.2). ∎
The generating function of the block’s size at time , given in (4.6), is obtained by a direct application of the Key lemma 4.8 since is a -Poisson box. We now show that the semigroup satisfies the Feller property.
Lemma 4.14**.**
The process is Feller and for any , in probability.
Proof.
The Feller property corresponds to the continuity of the map
[TABLE]
for any continuous function from to . This is clear since is Lipschitz continuous. We now show the weak continuity of the semigroup. By definition for any and for any , . By Lemma 2.3-(ii) and independence between and , we see that is independent of . By Lemma 2.3-(iv), since uniformly on compact sets, in probability, then for any ,
[TABLE]
Therefore ∎
We now seek for the coagulation rate (4.7).
Lemma 4.15**.**
For any ,
[TABLE]
Proof.
Let , since by Lemma 4.8, the random variables are the arrival times of an independent Poisson process with intensity , then
[TABLE]
Thus
[TABLE]
The latter convergence holds since solves (1.3) and . ∎
By letting in the next technical lemma, we see that for any , the measures on defined in (4.7) have generating function .
Lemma 4.16**.**
Recall in (1.4). For any and any ,
[TABLE]
with .
Proof.
It is easy to see that , where
[TABLE]
Then we have that
[TABLE]
The last equality follows from the fact that
[TABLE]
Thus we have for any . ∎
We now explain how coalescences take place in the process . By construction, the laws of for are consistent and as in Lemma 4.4 the family of jump rates of characterizes the law of . The following lemma is obtained along the same lines as Lemma 4.4 but in an inhomogeneous time setting.
Lemma 4.17**.**
Let , the -coalescent process has jump rates characterized by and the coalescence events are as follows. For all , conditionally on , for any , consider the consecutive partitions of
* for any and attach to each a random clock with law*
[TABLE]
- -
* and attach to each a random clock with law*
[TABLE]
Then the process jumps from the partition to with the partition in associated to the first random clock that rings.
Proof of Theorem 4.21.
It follows directly by combination of Lemmas 4.13–4.17. ∎
We provide now some basic properties of the consecutive coalescent .
Proposition 4.18**.**
Fix . If is critical or supercritical then converges almost-surely towards the partition . If is subcritical, then the process converges almost-surely towards a partition , whose law is characterized by
[TABLE]
In this case, individuals belong to families with i.i.d sizes distributed as .
Proof.
Recall that for any , . Therefore
[TABLE]
If , then and by monotone convergence . By Theorem 4.10, we have
[TABLE]
The process is non-decreasing and thus converges almost-surely in . Therefore a.s. Recall that converges almost surely towards if and only if for large enough . Since , then with the coalescence time of the ancestral lineages of and . If , then and by monotone convergence . By Theorem 4.10, we have for any ,
[TABLE]
By monotonicity, a.s. Therefore for large enough time , for , . Since there is no coalescence between blocks and after time , the process is non-decreasing and converges almost-surely towards . By induction, for any , there exists such that for any , for all . Thus, for any , , and then . ∎
The following proposition is a direct consequence of the strong law of large numbers.
Proposition 4.19** (Singletons).**
For any , and any there are infinitely many singleton blocks at time and
[TABLE]
with . This represents the proportion of ancestors that have not been involved in coalescences by time .
We have seen in Theorem 1.A-(iv) and Proposition 2.6 that when , the CSBP explodes and is an entrance boundary of . Recall that for any , is the first individual from generation to have an infinite progeny at time [math].
Proposition 4.20** (Coming down from infinity).**
For any , a.s if and only if . Moreover
[TABLE]
where is an exponential random variable with parameter .
Proof.
Recall that if and only if . By Theorem 4.10, for any , and therefore the number of blocks is a geometric random variable with parameter . For any fixed , one has
[TABLE]
4.3 Backward genealogy of the whole population
In the previous section, we have defined some coalescent processes arising from sampling initial individuals along a Poisson process with an arbitrary intensity . The consecutive coalescents obtained by this procedure are only approximating the backward genealogy. They give the genealogy of a random sample of the population. The objective of this subsection is to observe that when the Grey condition holds, one can define a consecutive coalescent matching with the complete genealogy of the population from any positive time. In all this section, assume the Grey’s condition
[TABLE]
Heuristically, we make in Theorem 4.10, to study the genealogy of the whole population. The limiting process would indeed characterize the genealogy of the CSBP as in this case, an everywhere dense sub-population would be sampled and its genealogy given, which is enough to deduce the genealogical relationship between any pair of individuals. However, this method cannot work directly as one would have jump rates that may explode.
Fix a time . The subordinator is a compound Poisson process with Lévy measure independent of . Let be the jump times of . They are arrival times of a Poisson process with intensity , independent of . Consider the partition-valued process defined by
[TABLE]
The process provides a dynamical description of the genealogy of initial individuals whose most recent common ancestors are found at time . The following theorem is a direct application of Theorem 4.10.
Theorem 4.21**.**
For any , the flow of random consecutive partitions satisfies for any ,
[TABLE]
where is a Poisson box with parameters independent of . Moreover for any , and ,
[TABLE]
and the consecutive coalescent has coagulation rates with
[TABLE]
We see in the next corollary that by reversing time in any block of the consecutive coalescent , one obtains an inhomogeneous continuous-time Galton-Watson process. Fix an horizon time and consider the consecutive partitions for any .
Corollary 4.22**.**
The processes are i.i.d inhomogeneous continuous-time Galton-Watson processes. For any , and any
[TABLE]
Moreover, denoting by , the time of its first jump, one has for any
[TABLE]
Proof.
The law of for fixed is obtained by a direct application of Theorem 4.21. Only remains to show the branching property. By (4.10) for any and such that
[TABLE]
which provides and the branching property. ∎
Remark 4.23*.*
The process corresponds to the reduced Galton-Watson process obtained by Duquesne and Le Gall [DLG02, Theorem 2.7.1] in the (sub)critical case. We refer also to Fekete et al. [FFK17] for an approach with stochastic differential equations. In the supercritical case, since for any , , we see in (4.12) that converges, as goes to infinity, in the finite-dimensional sense, towards a Markov process whose semigroup satisfies for any
[TABLE]
Namely, is a continuous-time Galton-Watson process, homogeneous in time, with reproduction measure . Heuristically, individuals from time with descendants at time will correspond at the limit with prolific individuals.
The coalescent process only describes coalescence in families from time . We define now a coalescent process from time [math] by using the flow of subordinators. Denote by the space of partitions of into consecutive half-closed intervals. That is to say, partitions of the form for some non-decreasing sequence of positive real numbers . The space of consecutive partitions of , , acts as follows on : for any and , for any
[TABLE]
where and . The following theorem achieves one of our goals and has to be compared with our preliminary observation in Proposition 2.1. It describes completely the genealogy backwards in time as well as the sizes of asymptotic families.
Theorem 4.24**.**
Define the process valued in as follows:
[TABLE]
The process is a time-inhomogeneous Markov process such that for any ,
[TABLE]
In the critical or supercritical case, a.s. In the subcritical case, a.s and the length of a typical interval at the limit has for law the quasi-stationary distribution of the CSBP conditioned on the non-extinction:
[TABLE]
Proof.
Recall that and . This entails that for any ,
[TABLE]
For any and any , set with . By definition of and (4.13), we have
[TABLE]
Proposition 4.18 ensures that converges almost-surely as goes to . This entails the almost-sure convergence of . In the supercritical or critical case, and then , where denotes the partition of with only one block. In the subcritical case, Proposition 2.1 entails that for all and ,
[TABLE]
Note moreover that for any . ∎
Remark 4.25*.*
Bertoin and Le Gall in [BLG06b, Proposition 3] have shown that in the critical case the Lévy measures solve the following Smoluchowski equation
[TABLE]
where is continuous function on with compact support and . The process sheds some light on this deterministic equation since is the rate in at which given intervals coagulate and by the strong law of large numbers,
[TABLE]
where denotes the length of the interval in . We refer the reader to Iyer et al. [ILP15], [ILP18] for recent works on Equation 4.14.
When the CSBP explodes, the individuals in the current generation have finitely many ancestors. The following proposition is the analogue of Proposition 4.20.
Proposition 4.26**.**
Assume , then the consecutive coalescent comes down from infinity and
[TABLE]
where is a standard exponential random variable.
Proof.
For any , the lengths of the intervals in are i.i.d random variable with law . Under the assumption, , and therefore the number of intervals in has a geometric law with parameter . The convergence in law is proved by a similar calculation as in Proposition 4.20.∎
We saw in Proposition 4.5 that the number of blocks in , the coalescent process associated to a continuous-time Galton-Watson process, corresponds to the inverse flow of random walks at a fixed level . Recall that in continuous-state space the process can then be interpreted as the size of the ancestral population whose descendants at time [math] form a family of size . The study is more involved than in the discrete setting and is the aim of the next section.
5 A martingale problem for the inverse flow
We investigate the infinitesimal dynamics of through its extended generator . Recall that we write the generator of the CSBP with mechanism . As we consider the flow of subordinators over , it is natural to express as follows for all bounded function :
[TABLE]
with .
Theorem 5.1**.**
For any function in 222the space of twice differentiable bounded functions over with bounded continuous derivatives, set
[TABLE]
with
[TABLE]
Then for any , solves the following well-posed martingale problem
[TABLE]
is a martingale for any function in .
Remark 5.2*.*
Note that is the right-continuous inverse function of . For any , if individual makes at time a progeny of size , then at time is the infinitesimal parent of individual at time : if , then has no parent but himself, if , the parent of is , if then its parent is . If then if and only if .
The proof of Theorem 5.1 is divided in four lemmas.
Lemma 5.3**.**
The operator is well-defined on .
Proof.
Let , for any
[TABLE]
where for any . For any , and , we have
[TABLE]
Therefore, if , we have that
[TABLE]
On the one hand,
[TABLE]
and
[TABLE]
On the other hand
[TABLE]
and
[TABLE]
Thus, for any
[TABLE]
with a certain constant independent of and . The integral with respect to in is therefore convergent and well-defined. ∎
We now follow the same method as Bertoin and Le Gall in [BLG05, Theorem 5] to show that is an extended generator, i.e. that is a martingale for all in . Let be a continuous function over and a function in . Set and . Note that
[TABLE]
Moreover, one classically has that
[TABLE]
Recall that by (2.5), we have for all . Then, integrating this equality with respect to provides
[TABLE]
Therefore, a first step in the search for is computing the right-hand side of (5.3).
Lemma 5.4**.**
Let and for any then for any
[TABLE]
Proof.
Assume that for some , the function is in the domain of the generator of the CSBP (defined in (5.1)) and therefore
[TABLE]
where we write for all twice derivable function ,
[TABLE]
which denote respectively the continuous and discontinuous parts of the generator . We start by studying the discontinuous part. For any , we can rewrite
[TABLE]
We first compute
[TABLE]
By Lemma A.1(ii) and Remark 5.2, one has if and only if , therefore
[TABLE]
Integrating with respect to we obtain
[TABLE]
We now compute the compensated part of the discontinuous generator , by integration by part we have
[TABLE]
Moreover, we observe that
[TABLE]
Therefore, as , (5.7) becomes
[TABLE]
Using the above result and (5.6), (5.5) yields
[TABLE]
where
[TABLE]
Above, (5.8) and (5.9) follow from applying Fubini’s theorem, which we now justify. For any and ,
[TABLE]
Since then , and by Taylor’s inequality
[TABLE]
Since is integrable then the upper bound is integrable with respect to , which justifies the application of Fubini’s theorem in (5.8).
We now explain why (5.9) holds. Recall first that . By Theorem 2.5, for any we have therefore for a.e. . This, with the bound (5.2) allows us to conclude that is integrable with respect to .
In a second time, we deal with the continuous part of the generator . Applying Fubini’s theorem, one has
[TABLE]
Set and . Since by assumption , then . We now compute . By two integration by parts
[TABLE]
We can now conclude as follows. One has
[TABLE]
Lemma 5.5**.**
For any and any , is a martingale.
Proof.
Recall that . We will show that (5.10) entails that for any and any :
[TABLE]
From the Feller property of and the continuity of for any function in , the map is continuous. For any , and any , a.s. therefore using the bound (5.2), we see that the function defined on by
[TABLE]
is continuous, and since is arbitrary, the mapping is continuous on . This corresponds to the continuity of . On the other hand, one can check the continuity of and by injectivity of the Laplace transform, (5.10) entails (5.12). This provides the martingale problem, as the following routine calculation shows. Let and . Denote by the natural filtration associated to ,
[TABLE]
In the following Lemma, we rewrite the generator of the one-point motion in its Courrège form. We refer to Kolokoltsov [Kol11] for a general study of generators of stochastically monotone Markov processes.
Lemma 5.6**.**
For any ,
[TABLE]
with
[TABLE]
and
[TABLE]
Moreover, the martingale problem is well-posed.
Remark 5.7*.*
The jump measure can be compared to the jumps rate of obtained in Proposition 4.5. Moreover, in the finite mean case, , the drift can be rewritten as follows
[TABLE]
In particular, for any , , and is concave.
Proof.
Recall . Note that:
[TABLE]
Therefore, one has
[TABLE]
For the first integral :
[TABLE]
one has
[TABLE]
Thus
[TABLE]
For the second integral :
[TABLE]
Summing both expressions, equals to:
[TABLE]
Therefore
[TABLE]
with
[TABLE]
and we obtain
[TABLE]
We now verify uniqueness of the solution to by applying Theorem 5.1 of Kolokoltsov [Kol11]. Assumptions (i) and (ii) of the theorem can be readily checked. The third assumption (iii) is that for any , for some . Let , one has
[TABLE]
where for the first inequality we use the fact that and we choose a large enough for the second inequality. ∎
Proof of Theorem 5.1..
It follows directly by combination of Lemmas 5.5 and 5.6. ∎
Remark 5.8*.*
Similar computations to the ones made in the proof of Lemma 5.4 can be done for the -point motion from the duality relation
[TABLE]
Consider for example the case . For any function in , where we denote by , we set
[TABLE]
with . Then
[TABLE]
is a martingale, where .
6 Examples
In this section, we apply the results obtained in the previous ones to the two following important examples: the stable CSBP and the Neveu CSBP. These CSBPs arise in many different frameworks and are known for instance to be closely related to the class of exchangeable coalescents called Beta-coalescents.
6.1 Feller and stable CSBPs
A stable CSBP is a continuous-state branching process with branching mechanism given by , for some , and . Note in particular that the Feller flow, whose inverse flow was studied in details in Section 3 is a stable CSBP with . As a direct application of Theorem 4.24, we obtain that the Markovian coalescent associated to the Feller flow has coagulation rates
[TABLE]
In particular, in the subcritical case (), converges almost-surely as towards intervals with i.i.d. exponentially distributed lengths with parameter . This corresponds to the partition of into random intervals corresponding to different ancestors at time found in Section 3.
We now assume that for some , with (which corresponds to a simple time dilatation). By assumption and Grey’s condition holds . Solving the differential equation (1.3) satisfied by , we have in particular that
[TABLE]
For the stable CSBP, the coagulation rates of its associated Markovian coalescent are given by
[TABLE]
with . The normalized associated probability measure is
[TABLE]
which is time-independent. This probability distribution corresponds to the reproduction measure of prolific individuals in supercritical stable CSBP, see Example 3 in [BFM08]. It also appears in the study of reduced -stable trees and -exchangeable coalescents, see respectively Duquesne and Le Gall [DLG02, page 74] and Berestycki et al. [BBS07, Section 5].
The inhomogeneous consecutive coalescent representing the genealogy of any stable CSBP from time is obtained by a deterministic time-change of the homogeneous consecutive coalescent with coagulation rates via the transformation: for any ,
[TABLE]
Note that which is finite if and only if is subcritical (). According to Theorem 4.24, in the subcritical case converges almost-surely as towards a partition of intervals with i.i.d. lengths with law such that
[TABLE]
We now turn to the martingale problem satisfied by the inverse flow of the stable CSBP. One easily computes the drift and the jump measure from Remark 5.7.
Proposition 6.1**.**
The process is characterized by the martingale problem associated to , acting on , given in Lemma 5.6, with
[TABLE]
In the critical case, one can identify the law of through some random-time change.
Proposition 6.2**.**
If , the process is a positive self-similar Markov process with index . Namely for any and any ,
[TABLE]
Moreover,
[TABLE]
where and is a spectrally negative Lévy process started from with Laplace exponent
[TABLE]
with and .
Proof.
Recall that the critical CSBP is itself selfsimilar with index . See for instance Kyprianou and Pardo [KP08]. For any and any , . Thus for any
[TABLE]
By Lamperti’s representation of positive self-similar Markov process, see e.g. [Kyp14, Chapter 13], is of the form for some Lévy process where the time-change given in the statement. To identify the Laplace exponent of , note that by -self-similarity, one has with . The result follows from simple computations. ∎
6.2 Neveu CSBP
We now turn in this section to the Neveu CSBP. This CSBP has branching mechanism . Recall its Lévy-Khintchine form
[TABLE]
where is the Euler-Mascheroni constant. Note that Grey’s condition is not verified by this process. Solving the differential equation (1.3) yields for any and . For any fixed , the subordinator is stable with parameter . For Neveu CSBP, the consecutive coalescent process defined in Section 4 happens to be homogeneous in time, and not to depend on .
Proposition 6.3**.**
For any , the consecutive process is an homogeneous consecutive coalescent whose coagulation rate is for any . The block sizes at time have generating function and for any
[TABLE]
Proof.
By Theorem 4.10, and applying the change of variable , we see that for any ,
[TABLE]
which does not depend on nor on . Since is a -Poisson box with , the other statements can be obtained by a direct application of Theorem 4.10. See also the calculations around Lemma 7 in Pitman [Pit97]. ∎
Lemma 6.4**.**
Consider a consecutive coalescent with coagulation rate for any then, as goes to
[TABLE]
in finite-dimensional sense in time and in the Skorokhod topology in .
Proof.
We simply prove the convergence in law of toward for a fixed value of , with the Skorokhod topology. Then, the finite-dimensional convergence is deduce from the cocycle property of (Proposition 2.3) and (Proposition 4.2). For any and , set . The process is a random walk and from Proposition 6.3 we see that
[TABLE]
Therefore, the law of is in the domain of attraction of a stable random variable with parameter . Using an extension of Donsker’s theorem to stable distributions, due to Prokhorov [Pro56], we obtain that
[TABLE]
where is a stable subordinator with Laplace exponent .
To conclude, we observe that has the same law as the right-continuous inverse of and that is the right continuous inverse of . Hence, as is continuous for the Skorokhod topology, we have convergence in law of toward . ∎
Lemma 6.5** (Möhle [Möh15], Mittag-Leffler process).**
The process has for generator
[TABLE]
Proof.
By Lemma 5.6, we see that . For any ,
[TABLE]
Proposition 6.6** (Bertoin and Baur [BB15]).**
The process is a generalized Ornstein-Uhlenbeck process:
[TABLE]
where is a spectrally negative Lévy process with Laplace exponent
[TABLE]
Proof.
By injectivity of , the generator of is given by and a computation provides
[TABLE]
with . It is well-known that the process with generator is a weak solution of the equation (6.3). See for instance, Sato and Yamazato [SY84, Theorem 3.1]. ∎
The last two statements already appear in the study of the Bolthausen-Sznitman coalescent. We explain now some connections between the Neveu consecutive coalescent and the Bolthausen-Sznitman exchangeable coalescent. The following is a rephrasing of an observation made by Hénard [Hén15] and Möhle [Möh15]. Denote by the number of blocks in a Bolthausen-Sznitman coalescent started from blocks. Recall that jumps from to at rate for any . By Proposition 4.5, one can check that loses blocks at the same rate as . Therefore and have the same law and by Lemma 6.4, as goes to
[TABLE]
in the Skorohod topology. Such result was shown by Möhle in [Möh15, Theorem 1.1], Kukla and Möhle in [KM18, Theorem 2.1-(a)] with different techniques. We refer also to Bertoin and Baur [BB15, Theorem 3.1-(i)] for an almost-sure convergence. The connections between Neveu’s consecutive coalescent and Bolthausen-Sznitman exchangeable one are not surprising since it is known that for any initial size , the genealogy of i.i.d random variables sampled in is described by a Bolthausen-Sznitman coalescent, see Bertoin and Le Gall [BLG00, Theorem 4].
Several natural questions on the inverse flow and its consecutive coalescent have not been addressed here and are left for possible future works. It might be interesting for instance to look for a complete description of the two-parameter flow in the general case, as given for the Feller flow in Section 3. Moreover, the genealogy of the total population has only been characterized under the Grey’s condition. When this condition is not fulfilled the process cannot be described by a single consecutive coalescent on . We recall that Duquesne and Winkel [DW07] have described the genealogy forward in time of a CSBP (including those without Grey’s condition) through a collection of continuous-time Galton-Watson processes. A natural question is thus to see if in a dual way, one can represent the backward genealogy of the total population with a collection of consecutive coalescents on .
Acknowledgement. C.F and B.M are partially supported by the French National Research Agency (ANR): ANR GRAAL, ANR MALIN and LABEX MME-DII. C.M is supported by the NSFC of China (11671216). C.F would like to thank T. Duquesne and V. Rivero for fruitful discussions at early stages of this work.
Appendix A Intermediary results
A.1 Right-continuous inverse
In this section, we recall and compile some elementary properties on right continuous inverse of càdlàg non-decreasing functions. As multiple competing definitions of generalized inverse coexist, it can be challenging to find a single reference for the results we need. Therefore we give a short proof of these well-known facts, in order to be self-contained. Let be a càdlàg non-decreasing function on , we denote by
[TABLE]
its right continuous inverse.
Lemma A.1**.**
Let be càdlàg non-decreasing functions on .
The function is non-decreasing and càdlàg. 2. 2.
For every , we have . 3. 3.
We have . 4. 4.
If pointwise, then pointwise, with being the identity function on .
Remark A.2*.*
Dini’s theorems imply that both convergences in (iv) hold uniformly on compact sets.
Proof.
Let be a càdlàg non-decreasing function, note that for all , we have
[TABLE]
Therefore , which proves that is increasing. In particular, it has left limits at each point. We now observe that for all , as is non-decreasing,
[TABLE]
proving that is right continuous at point , which proves (i).
Let , we first assume that . Then by definition of , there exists such that . As is non-decreasing, we deduce that .
We now assume that . As is non-decreasing, we observe that . Therefore, the only thing left to prove is that
[TABLE]
We write . By definition of , for all , there exists such that . Then, as is right-continuous, we have , thus for all , there exists such that if , then . As a result, for all , there exists such that . This inequality being true for all , we therefore conclude that , completing the proof (A.2). We thus deduce that , completing the proof of (ii).
In a third time, we note that given and two càdlàg non-decreasing functions on , we have for all ,
[TABLE]
By point (ii), this can therefore be rewritten as
[TABLE]
proving point (iii).
We finally prove the last point. Let be a sequence of non-decreasing càdlàg functions such that pointwise. We prove that for all , . Let , by point (ii), we have that
[TABLE]
As , we conclude that for all large enough, . Similarly, we also have
[TABLE]
therefore for all large enough by pointwise convergence of at point . This concludes the proof of (iv). ∎
A.2 Discretization of subordinators
In this section, we introduce the key lemma allowing to study the genealogical structure of CSBPs. Namely, we prove that the pullback measure of a Poisson process by a subordinator is a Poisson process decorated by i.i.d. integer-valued random variables.
Lemma A.3**.**
Let and be a subordinator with Lévy-Khinchine exponent
[TABLE]
We denote by an independent Poisson point process with intensity , and we write the positions of the atoms of , ranked in the decreasing order. Then, setting the image measure of by , we have
[TABLE]
where are the atoms of a Poisson point process with intensity and are i.i.d. random variables, independent of , such that
[TABLE]
i.e. for all .
Proof.
The proof is based on a joint construction by the same “master” Poisson point process of the subordinator and the Poisson point process , in such a way that becomes a simple functional of that master point process. To see why such a construction is possible, we write
[TABLE]
with the drift and the Lévy measure of on . By the Lévy-Itô décomposition, one can write
[TABLE]
with being the atoms of a Poisson point process with intensity . The proof being slightly simpler for , we focus here on the case .
Recalling that denote the set of càdlàg non-decreasing functions on , we introduce the point process on with intensity , with begin the law of a Poisson point process with intensity on . We also set an independent Poisson point process with intensity . We then define
[TABLE]
which is a subordinator with Lévy-Khinchine exponent . Then, denoting the atoms of the Poisson point process , we set
[TABLE]
Heuristically, the point process can be thought of as follows: is divided in intervals corresponding to jumps in the subordinator and the remaining space corresponding to points with an antecedent by . Atoms are added to the interval according to the point process , and to the set with the point process . It should then be heuristically clear that is a Poisson point process with intensity independent of . To verify it, we compute its conditional Laplace transform against a smooth locally compact test function . By construction, are i.i.d. Poisson point process with intensity , which are further independent from , thus
[TABLE]
by change of variable, using that at all continuity points of .
As a result, the couple has same law as given in the lemma. Moreover, we have immediately by construction that
[TABLE]
and computing the law of that point process is straightforward by the definition of . Indeed, by independence, for any continuous function with compact support, we have
[TABLE]
Then, using Campbell’s formula, we have both
[TABLE]
[TABLE]
But as under law , is a Poisson random variable with parameter , the last inequality can be written, by Fubini theorem
[TABLE]
We deduce that the Laplace transform of is the same as the one of given in the lemma, which concludes the proof. ∎
This result can be straightforwardly extended to killed subordinators, by constructing it as a limit of non-killed subordinators. For the sake of completeness, we add a proof of the following result.
Corollary A.4**.**
Let and be a subordinator with Laplace exponent
[TABLE]
With the same notation as in the previous lemma, we have , where are the atoms of a Poisson point process with intensity , are i.i.d. random variables, independent of , such that
[TABLE]
[TABLE]
Proof.
Let be a subordinator with Laplace exponent , and an independent Poisson process with intensity . Observe that for all , the process defined by
[TABLE]
is a Lévy process, and that is a Lévy process with Laplace exponent . We set , and the quantities obtained by applying Lemma A.3, and
[TABLE]
Observe that for all such that , the quantities and do not depend on . On the contrary, for all such that , as , all value converge toward , and the associated value of to the atom at position converges toward .
Explicit formulas for the law of are straightforward Poisson computations. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Ald 93] David Aldous, The continuum random tree. III , Ann. Probab. 21 (1993), no. 1, 248–289. MR 1207226
- 2[AN 04] K. B. Athreya and P. E. Ney, Branching processes , Dover Publications, Inc., Mineola, NY, 2004, Reprint of the 1972 original [Springer, New York; MR 0373040]. MR 2047480
- 3[AP 05] David Aldous and Lea Popovic, A critical branching process model for biodiversity , Adv. in Appl. Probab. 37 (2005), no. 4, 1094–1115. MR 2193998
- 4[Ath 12] K. B. Athreya, Coalescence in critical and subcritical Galton-Watson branching processes , J. Appl. Probab. 49 (2012), no. 3, 627–638. MR 3012088
- 5[BB 15] Erich Baur and Jean Bertoin, The fragmentation process of an infinite recursive tree and Ornstein-Uhlenbeck type processes , Electron. J. Probab. 20 (2015), no. 98, 20. MR 3399834
- 6[BBC + 05] Matthias Birkner, Jochen Blath, Marcella Capaldo, Alison Etheridge, Martin Möhle, Jason Schweinsberg, and Anton Wakolbinger, Alpha-stable branching and beta-coalescents , Electron. J. Probab. 10 (2005), no. 9, 303–325. MR 2120246
- 7[BBS 07] Julien Berestycki, Nathanaël Berestycki, and Jason Schweinsberg, Beta-coalescents and continuous stable random trees , Ann. Probab. 35 (2007), no. 5, 1835–1887. MR 2349577
- 8[BD 16] Hongwei Bi and Jean-François Delmas, Total length of the genealogical tree for quadratic stationary continuous-state branching processes , Ann. Inst. Henri Poincaré Probab. Stat. 52 (2016), no. 3, 1321–1350. MR 3531711
