Approximation of the Height process of a CSBP with interaction
Ibrahima Drame, Etienne Pardoux

TL;DR
This paper demonstrates that the rescaled height process of genealogical trees in continuous time branching processes converges to a limit, extending the results to generalized processes with interaction, thus advancing understanding of their genealogical structures.
Contribution
It introduces convergence results for the height process of genealogical trees in both classical and generalized branching processes with interaction.
Findings
Rescaled height process converges to the height process of a CSBP
Extension of convergence results to processes with interaction
Provides a unified framework for genealogical convergence in branching processes
Abstract
In this work, we first show that the properly rescaled height process of the genealogical tree of a continuous time branching process converges to the height process of the genealogy of a (possibly discontinuous) continuous state branching process. We then prove the same type of result for generalized branching processes with interaction.
Peer 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 · Markov Chains and Monte Carlo Methods · Stochastic processes and financial applications
Approximation of the Height process of a continuous state branching process with interaction
I. Dramé 111 Universit Cheikh Anta Diop de Dakar, FST, LMA, 16180 Dakar-Fann, Sénégal. [email protected]
E. Pardoux 777 Aix-Marseille Université, CNRS, Centrale Marseille, I2M, UMR 7373, 13453 Marseille, France. [email protected]
Abstract
In this work, we first show that the properly rescaled height process of the genealogical tree of a continuous time branching process converges to the height process of the genealogy of a (possibly discontinuous) continuous state branching process. We then prove the same type of result for generalized branching processes with interaction.
Keywords: Continuous-State Branching Processes; Scaling Limit; Galton-Watson Processes; Lévy Processes; Local time; Height Process;
1 Introduction
Continuous state branching processes (or CSBP in short) are the analogues of Galton-Watson (G-W) processes in continuous time and continuous state space. Such classes of processes have been introduced by Jirina [16] and studied by many authors included Grey [14], Lamperti [19], to name but a few. These processes are the only possible weak limits that can be obtained from sequences of rescaled G-W processes, see Lamperti [20] and Li [25], [26].
While rescaled discrete-time G-W processes converge to a CSBP, it has been shown in Duquesne and Le Gall [12] that the genealogical structure of the G-W processes converges too. More precisely, the corresponding rescaled sequences of discrete height process, converges to the height process in continuous time that has been introduced by Le Gall and Le Jan in [22].
A lot of work has been devoted recently to generalized branching processes, which model competition within the population. This includes generalized CSBPs, see among many others Li [24], Li, Yang and Zhou [28] and the references therein. For the approximation of such generalized CSBPs by discrete time generalized GW processes, we refer to the general results in Bansaye, Caballero and Méléard [2], and for the approximation by continuous time generalized GW processes to our recent paper [11].
Some work has been also devoted recently to the description of the genealogy of such generalized CSBPs, see Le, Pardoux and Wakolbinger [23] and Pardoux [29] for the case of continuous such processes and both Berestycki, Fittipaldi and Fontbona [4] and Li, Pardoux and Wakolbinger [27] for the general case. [4] allows processes without a Brownian component unlike [27], but the latter allows more general interactions. The present paper studies the convergence of the genealogy of a generalized continuous time GW process to that of a generalized possibly discontinuous CSBP, under the same assumptions as [27].
We first give a construction of the CSBP as a scaling limit of continuous time G-W branching processes. To then give a precise meaning to the convergence of trees, we will code G-W trees by a continuous exploration process as already defined by Dramé et al. in [10], and we will establish the convergence of this (rescaled) continuous process to the continuous height process defined in [27], see also [12]. Each jump of our generalized CSBP corresponds to the birth of a significant proportion of the total population, whose genealogical tree needs to be explored by our height process. This gives rise to a special term in the equation for the height process, which has possibly unbounded variations and has no martingale property. It also destroys any possible Markov property of the height process. The tightness of such a term cannot be established by standard techniques. We use for that purpose a special method which has been developed in [27], see the proof of Proposition 3.16 below. The main result of this paper is Theorem 4.4 in section 4.
The organization of the paper is as follows : In Section 2 we recall some basic definitions and notions concerning branching processes. Section 3, which is by far the longest one, considers the height process in the case without interaction. It is devoted to the description of the discrete approximation of both the population process and the height process of its genealogical tree. We prove the convergence of the height process, and of its local time. Section 4 introduces the interaction, via a Girsanov change of probability measure, and establishes the main result. We consider first the case where the interaction function has a bounded derivative, and then the general situation, which allows in particular the popular so–called logistic (i.e. quadratic) interaction.
We shall assume that all random variables in the paper are defined on the same probability space . We shall use the following notations , , and . For , denotes the integer part of .
2 The Height process of a continuous state branching process
2.1 Continuous state branching process
A CSBP is a -valued strong Markov process has the property, denoting the law of the process when starts from at time , . More precisely, a CSBP (with initial condition ) is a Markov process taking values in , where [math] and are two absorbing states, and satisfying the branching property; that is to say, it’s Laplace transform satisfies
[TABLE]
for some non negative function . According to Silverstein [33], the function is the unique nonnegative solution of the integral equation
[TABLE]
where is called the branching mechanism associated with and is defined by
[TABLE]
where , and is a -finite measure which satisfies is a finite measure on . We shall in fact assume in this paper that
[TABLE]
The first assumption implies that the process does not explode and we allows to write the last integral in the above equation in the following form
[TABLE]
Let us recall that represents a drift term, is a diffusion coefficient and describes the jumps of the CSBP. The CSBP is then characterized by the triplet and can also be defined as the unique non negative strong solution of a stochastic differential equation. More precisely, from Fu and Li [13] (see also the results in Dawson-Li [8]) we have
[TABLE]
where is a space-time white nose on , is a Poisson random measure on , with intensity , and is the compensated measure of .
2.2 The height process in the case without interaction
We shall also interpret below the function defined by (2.2) as the Laplace exponent of a spectrally positive Lévy process . Lamperti [19] observed that CSBPs are connected to Lévy processes with no negative jumps by a simple time-change. More precisely, define
[TABLE]
Then is a Lévy process of the form until the first that it hits [math]
[TABLE]
where is a standard Brownian motion and , being a Poisson random measure on independent of with mean measure . We refer the reader to [19] for a proof of that result. To code the genealogy of the CSBP, Le Gall and Le Jan [22] introduced the so-called height process, which is a functional of a Lévy process with Laplace exponent ; see also Duquesne and Le Gall [12]. In this paper, we will use the new definition of the height process given by Li et all in [27]. Indeed, if the Lévy process has the form (2.4), then the associated height process is given by
[TABLE]
and it has a continuous modification. Note that the height process is the one defined in Chapter 1 of [12].
Let denote the local time accumulated by the process at level up to time . The existence of was established already in [12]. We have the following Proposition, which can be found in Li et all in [27].
Proposition 2.1
(Itô-Tanaka formula for the local time of ) We have
[TABLE]
2.3 The height process in the case with interaction
Now the stochastic differential equation (2.3) is replaced by
[TABLE]
where is a function , which satisfies
[TABLE]
for all , for some . In this case, the process will be defined as
[TABLE]
where is again standard Brownian motion and again denotes the compensated measure This means that in this subsection .
The SDE for reads, see [27]
[TABLE]
3 Approximation of the Height process without interaction
In the following, we consider a specific forest of Bellman-Harris trees, obtained by Poissonian sampling of the height process . In other words, let and we consider a standard Poisson process with intensity . We denote by the jump times of this Poisson process. If is seen as the contour process of a continuous tree, consider the forest of the smaller trees carried by the jump times . We have the following proposition, which can be found in [12].
Proposition 3.1
* The trees in this forest are trees, which are distributed as the family tree of a continuous-time Galton-Watson process starting with one individual at time [math] and such that :*
* Lifetimes of individuals have exponential distributions with parameter ;*
* The offspring distribution is the law of the variable with generating function*
[TABLE]
Let be an integer which will eventually go to infinity. In the next two sections, we choose a sequence such that, as ,
[TABLE]
This implies in particular that
[TABLE]
Moreover, we will need to consider
[TABLE]
We will also set in the limit of large populations.
3.1 A discrete mass approximation
In this subsection, we obtain a CSBP as a scaling limit of continuous time Galton-Watson branching processes. In other words, the aim of this subsection is to set up a ”discrete mass - continuous time” approximation of (2.3) . To this end, we set
[TABLE]
It is easy to see that is an analytic function in satisfying and
[TABLE]
Therefore is a probability generating function. and we have
[TABLE]
where is probability measure on . Fix the approximation of (2.3) will be given by the total mass of a population of individuals, each of which has mass . The initial mass is , and follows a Markovian jump dynamics : from its current state ,
[TABLE]
In this process, each individual dies without descendant at rate
[TABLE]
dies and leaves two descendants at rate
[TABLE]
and finally dies and leaves descendants () at rate
[TABLE]
Let denote the space of functions from into which are right continuous and have left limits at any (as usual such a function is called càdlàg). We shall always equip the space with the Skorohod topology. The main limit proposition of this subsection is a consequence of Theorem 4.1 in [11].
Proposition 3.2
Suppose that Assumptions is satisfied. Then, as , converges to in distribution on , where is the unique solution of the SDE (2.3).
3.2 The approximate height process
We shall now define , the height process associated to the population process .
Before making precise the evolution of , we need to define its local time , accumulated by at level up to time by
[TABLE]
equals times the number of pairs of -crossings of between times [math] and . In other words, equals times the number of visits at level . Note that this process is neither right- nor left-continuous as a function of .
We shall describe several Poisson processes. All of them will be mutually independent, even if we do not repeat it. Let first be a Poisson process with intensity . This process will describe the “arrival” of mutiple births. Let and be two mutually independent Poisson processes with respective intensities and
, which are globally independent of 888Note that the above intensities are the rates of brith and death of the population process , multiplied by . The slope of is , which explains the factor .. Let us define , . Let be a sequence of i.i.d r.v.’s taking their values in the set , which are independent of the Poisson processes, and whose law is precised as follows.
[TABLE]
Let be the càdlàg -valued process which is such that, almost everywhere, The -valued process solves the SDE
[TABLE]
where the ’s are the successive jump times of the process
[TABLE]
For any , denotes the number of reflections of above the level before the process may go below that level .
3.3 Taking the limit in the SDE for
We write the first line of (3.14) as
[TABLE]
Summing it with the second identity in (3.14) divided by , using the notations
[TABLE]
and the identity for , we obtain
[TABLE]
where
[TABLE]
In the following, we will need the equation (3.19) below. Writing as
[TABLE]
and using (3.3), we deduce from (3.14),
[TABLE]
We first need an apriori estimate on the sequence of processes .
Proposition 3.3
For any ,
[TABLE]
Proof. We first recall that by construction, , for all , a.s. In this proof, we shall make use of several results to be proven below. The reader can easily verify that each of those results will be proven independently of the present result.
We first note that
[TABLE]
and from the identity and the first line of (3.14), we deduce that
[TABLE]
It follows from those two identities that
[TABLE]
We will prove in Lemma 3.14 below that . From (3.16), (3.18) and the last two identities, we deduce that
[TABLE]
Since from assumption , as , the result follows from the next four facts. Concerning , we deduce from the first line of (3.3) and Doob’s inequalities for martingales that
[TABLE]
The same holds concerning . As for , we consider (3.22) below. We first note that the expectation of the sup in of the absolute value of the sum of the last two terms is bounded by
[TABLE]
which we can plug in (3.21) after we have replaced on the left by and taken the expectation. We now consider the first term on the right of (3.22), see (3.23). We deduce from the Burkholder–David–Gundy inequlity for possibly discontinuous martingales (see e.g. Theorem IV.48 in [31]) that there exists a constant such that (we will use a formula from Remark 3.9 below)
[TABLE]
which is bounded, uniformly w.r.t. . It remains to consider the term . It will be shown below in the proof of Lemma 3.5 that , as . This concludes the proof.
The first two identities in the previous proof, combined with the just obtained result, clearly yield the following essential result.
Lemma 3.4
As ,
[TABLE]
a.s., locally uniformly in .
We shall need (recall (3.3))
Lemma 3.5
As ,
[TABLE]
Proof. Since is a purely discontinuous local martingale, we deduce from (3.3) that
[TABLE]
From the Cauchy–Schwartz and Doob’s -inequality for martingales, we deduce that
[TABLE]
which tends to [math] as from assumption (A).
Recalling (3.16), we have the
Proposition 3.6
As
Proof. From (3.13), it is easily checked that . a.s uniformly with respect to . However, from (3.20), we have that
[TABLE]
Combining this with assumption (A) and Proposition 3.3, we deduce that
[TABLE]
The result follows by combining these arguments with (3.18) and Lemma 3.5.
Let , where the ’s are the jump times of the Poisson process , and the ’s are i.i.d., independent of the ’s, with the same law as the ’s. We can couple the two point processes and in such a way that
[TABLE]
It is not hard to see (exploiting e.g. Corollary VI.3.5 in Cinlar [7]) that is a Poisson Point Process with mean measure , where is a measure on which is supported on the set , and is specified by
[TABLE]
Let us establish
Lemma 3.7
The sequence converges to as , in the sense of weak convergence of measures on .
Proof. It suffices to show that for any with compact support, . But
[TABLE]
as . The pointwise convergence of the integrand follows from the fact that, for fixed , if denotes a Poi r.v., since , at least for large enough,
[TABLE]
as from the law of large numbers. Suppose that supp. Lebesgue’s dominated convergence theorem implies that
[TABLE]
It remains to show that . But for ,
[TABLE]
where we have used the fact that Var. The result follows, since , again from assumption .
We now deduce from Lemma 3.4 and Lemma 3.7
Proposition 3.8
As , , in the sense of weak convergence in distribution of random probability measures, where is a Poisson Point Process with mean measure .
Proof. In view of Lemma 3.7, all we need to show is that for any such that , . We first note that converges to a PPP , whose mean measure is twice that of . Next, since is dominated by , it is tight (see the criterion in Lemma 16.15 of [18]), hence it converges along a subsequence to some limiting measure , which must be a simple point measure, by comparison with . We shall not distinguish the subsequence from the original one, by an abuse of notation. Let (resp. ) denote the filtration generated by the process (resp. by its limit in law ). We have that
[TABLE]
This implies that for any , , any bounded
[TABLE]
Taking the limit in this last identity yields that
[TABLE]
This being true for all , all and all bounded , we have that the simple point process is such that is a martingale. This shows that it is a Poisson process with intensity . Hence is a PPP with mean measure , so it has the same law as .
Remark 3.9
From the definition of , we have
[TABLE]
Hence, we can rewrite , which appeared in (3.17), in the following form
[TABLE]
Using the same arguments as in lemma 3.6, we prove that the second term tends to [math] as , locally uniformly in .
We now deduce from the above.
Corollary 3.10
As , in , where
[TABLE]
Proof. We split into two terms. For any such that , one can deduce from Proposition 3.8 that as ,
[TABLE]
On the other hand,
[TABLE]
while
[TABLE]
Since can be made arbitrarily small by choosing small enough, the result follows from the above statements by standard arguments.
The following result is essentially very classical
Lemma 3.11
As ,
[TABLE]
where and are two mutually independent standard Brownian motions.
Proof. The precise result here, with the identification of the constants is Proposition 5.3 in [23], see also Proposition 4.23 in [10].
Let us define
[TABLE]
We deduce readily
Corollary 3.12
As ,
[TABLE]
where is a standard Brownian motion.
Let us rewrite (3.16) in the form
[TABLE]
with
[TABLE]
and
[TABLE]
We have proved so far that and , as . Then taking the weak limit in (3.26), we have in fact the
Corollary 3.13
As , in , where
[TABLE]
Proof. Also we have taken separately the limit in and in , it is clear that, at least along a subsequence, the pair converges, and the limits are independent, since one is Brownian motion, and the other is a Poisson integral, both being martingales w.r.t. the same filtration.
Note that since the jump times do not move only the sequence, in fact for the topology of locally uniform convergence. We shall need the following
Lemma 3.14
For any ,
[TABLE]
Proof. Recall (3.25). We first note that, since increases only when , , where . We also have . Consequently
[TABLE]
To establish the converse inequality, let be such that . Since ,
[TABLE]
We have similarly
Lemma 3.15
For any , such that ,
[TABLE]
for such that .
Proof. The argument is the same as in the previous Lemma. On the considered time interval, is reflected above the level , instead of being reflected above [math].
From Lemma 3.14, we can rewrite (3.25) in the form
[TABLE]
We also rewrite (2.5) as
[TABLE]
We next prove
Proposition 3.16
As , in , where is given by (2.5), in terms of , the limit given in Corollary 3.13.
Proof. It suffices to show that if a.s., locally uniformly in , then in probability, locally uniformly in . We will show that from any subsequence, we can extract a further subsequence which converges a.s., locally uniformly in . We will follow closely the proofs of Proposition 3.13 and Corollary 3.15 in [27]. First of all, the same argument as that of Proposition 3.13 in [27] yields that in probability, for any . We fix arbitrary, and let be a countable dense subset of . Along a subsequence, still denoted as by an abuse of notation, , for any . We first note that, as in [27], we can rewrite (2.5) as follows. Let, for any , . We have
[TABLE]
where denotes the jump at of the increasing function .
Since the process is càdlàg, with only positive jumps,
[TABLE]
is a.s. a continuous function of on , such that . Now
[TABLE]
But since , we have
[TABLE]
It follows from (3.29) that the same formula relates with , and we also have
[TABLE]
However, it is not true that , as , since has negative jumps of size . So . Moreover, since uniformy on , we have that
, for all . Now the fact that uniformly on (hence also on ) follows from the next Lemma. The result follows.
It remains to establish
Lemma 3.17
Consider a sequence of càlàg functions from into , a continuous function from into , and , which are such that , for all . Assume moreover that
[TABLE]
Then, as ,
[TABLE]
The proof of this Lemma, which can be viewed as an extension of the second Dini theorem, is identical to that of Lemma 3.16 in [27], even if its statement is slightly different, so we do not reproduce it.
We now have
Proposition 3.18
As , in .
Proof. We can rewrite (3.27), in the form
[TABLE]
It follows from Proposition 3.16 that the sequence is tight in . However, from Corollary 3.13, we deduce that the sequences and are tight in . Moreover, the limit of the sequence
is a.s. continuous. Hence the tightness of the sequence follows from Proposition 5.4 below. Now since is tight, along an appropriate subsequence (which we do not distinguish from the original sequence),
[TABLE]
Moreover, from (3.29) and the fact that the law of is uniquely specified, we deduce that the limit is unique, which implies that the whole sequence converges.
We shall need below the
Lemma 3.19
For any , as ,
[TABLE]
in .
Proof. Let us decompose and in the form
[TABLE]
where (resp. ) is defined by the second line of (3.27) (resp. of (3.29)),
[TABLE]
and (resp. ) is the remainer of (resp. of ). First we not that for the topology of uniform convergence (the limit is continuous). Next we introduce the decompositions
[TABLE]
Let , . We claim that is tight (see Lemma 3.20 below), and that its limit is and it is continuous. So that the convergence is (locally) uniform in . Finally
[TABLE]
The sum of the first three terms on the right is tight and converges locally uniformly in towards its continuous limit , while the last term can be shown (so to speak “by hand”) to be tight in . Hence the right hand side is tight in , and so is the left hand side. Taking the weak limit in the last identity, we obtain that the limit of is , which is our Lemma.
We want to check the tightness of the sequence using the Aldous criterion (see section 16, page 176 in [3]). Let be a stopping time with value in and let be a real which will eventually go to zero.
Lemma 3.20
The sequence is tight in .
Proof. Recall the notations used in the previous proof. We have
[TABLE]
The tightness in of the sequence is rather clear. We have the following a priori estimates
[TABLE]
We now verify Aldous’s criterion. The first condition (see (16.22) in [3]) follows easily from the inequality
[TABLE]
We next want to establish the second condition (see (16.23) in [3]), which will follow from the fact that for all ,
[TABLE]
In order to verify this condition, we first note that
[TABLE]
Now using the Portmanteau theorem, Corollary 3.13 and Markov’s inequality, we deduce that
[TABLE]
However, using the strong Markov property of , we obtain
[TABLE]
Combining this with the previous inequality and Markov’s inequality, it follows that
[TABLE]
thanks to the monotone convergence theorem.
3.4 Convergence of the local time of the approximate height process
The aim of this subsection is to pass to the limit in the process . The proof of Theorem 3.27 is carried out in two major parts. Recall (3.13) and Proposition 2.1. The first part (Proposition 3.23) provides the tightness of the sequence , for each fixed, the second part (Lemma 3.28) establishes that the mapping is continuous, uniformly in .
We shall need below the
Lemma 3.21
For any , as ,
[TABLE]
Proof. Imitating again the proof of Lemma 3.4, we have
[TABLE]
which clearly tends to [math] in probability, as . It thus remains to take the limit in the sequence . For any , we set
[TABLE]
It follows from the properties of the process that Leb a.s. as , where Leb denotes the Lebesgue measure of the set . We have
[TABLE]
The two first terms on the right hand sides are dominated by Leb. But for , , where is the continuous function from into given as
[TABLE]
We clearly have
[TABLE]
But since and differ only when , if is a continuous function from into which equals on , and [math] outside , and a function from into which equals [math] on and outside ,
[TABLE]
which tends to [math] in probability.
We shall also need below the
Lemma 3.22
For any , , the following identities hold a.s.
[TABLE]
Proof. The proof is essentially the same as that of lemma 5.4 in [23].
A first preparation for the proof of Theorem 3.27 below is
Proposition 3.23
For each fixed, is tight in .
Proof. Writing the second line of Lemma 3.22 as
[TABLE]
and using (3.19), (3.24), (3.22), Lemma 3.15 and the first line of Lemma 3.22, we deduce that for any , a. s.
[TABLE]
where
[TABLE]
and
[TABLE]
The proof is organized as follows. Step 1 establishes that the sequence is tight, and any limit of a converging subsequence is a. s. continuous. Step 2 shows that as ,
[TABLE]
Step 3 establishes that the sequence is tight, and any limit of a converging subsequence is a.s. continuous. Finally step 4 shows that the sequence is tight as random elements of . The desired result follows by combining the above arguments with Proposition 5.4 below.
Step 1. The tightness of two first terms of the right–hand side of (3.31) is established in the same way as in the proof of Proposition 5.7 in [23]. The sup over all of the absolute value of the last term is easily show to go to [math], as , again thanks to **(**A).
Step 2. We first note that
[TABLE]
Thanks Lemma 3.5, it remains to prove
[TABLE]
To this end, we fix , and consider the process
[TABLE]
Let denote the -algebra generated by the random variables
[TABLE]
where is bounded and measurable ( stands for the -algebra of predictable subsets of ) and satisfies . We first establish the fact that is a -martingale. To this end, it suffices to verify that for and any as above. Indeed, it’s a product of two stochastic integrals with respect to , with two integrands whose product is zero. Let . In order to finally establish (3.33), we note that
[TABLE]
whose tends to [math] as , thanks to **(**A), where we have used Cauchy Schwarz’s and Doob’s inequalities. The desired result follows.
Step 3. The tightness of is established in the same way as in the proof of Proposition 5.7 in [23] which we do not reproduce here. On the other hand, we will adapt the idea of this proof to treat the tightness of the sequence .
Step 4. Let be a real which will eventually go to zero. Using the identity for , we can rewrite (3.32) in the following
[TABLE]
where
[TABLE]
From Lemmas 3.7 and 3.21, it is easy to see that
[TABLE]
Moreover, we have
[TABLE]
which is a.s. continuous. So according to Proposition 5.4 below, it remains only to show the sequence is tight as random elements of . To this end, we set
[TABLE]
where
[TABLE]
To show the tightness of the sequence , we first show that for all ,
[TABLE]
After we will prove that the sequence is tight as random elements of . Finally the desired result follows by combining this with Lemma 5.6 below. In order to prove (3.35), we first note that
[TABLE]
where we have used Cauchy Schwarz’s and Doob’s inequalities in the second and the third inequalities. From Markov’s inequality, we deduce that
[TABLE]
since as , , which follows from assumption and the following formula, which is easily established by the same computation as done in the proof of Lemma 3.7,
[TABLE]
However, recalling (3.34), we have
[TABLE]
Now using the Portmanteau theorem, Lemma 3.19 and Markov’s inequality, we deduce that
[TABLE]
We deduce from Corollary 3.5 in [27] and Markov’s inequality that
[TABLE]
with and , which implies that
[TABLE]
Consequently, we obtain (3.35) by combining this with (3.36) and (3.34). It remains to prove that the sequence is tight as random elements of . To this end, we show that the sequence satisfies the conditions of Proposition 5.3 below. The first condition follows easily from the fact that
[TABLE]
In order to verify the second condition, we will show that for any , there exists such that for any ,
[TABLE]
In order to simplify the notations below we let
[TABLE]
An essential property, which will be crucial below, is that . Also , and similarly for . Thus, we have
[TABLE]
and
[TABLE]
Because , the expectation of the product of
[TABLE]
vanishes. We only need to estimate the expectations
[TABLE]
[TABLE]
and
[TABLE]
Since the two first equations are symmetrical, we will only estimate (3.37). To this end, we use the Cauchy-Schawarz inequality and Lemma 3.26 below,
[TABLE]
Finally (3.38), again from Lemma 3.26 with ,
[TABLE]
We now conclude that the sequence is tight as random elements of . The desired result follows.
Recall (3.26). For , let be the time of the first jump of of size greater than or equal to .
Lemma 3.24
Let . Then there exists a constant such that for all
[TABLE]
Proof. By combining (3.18), (3.22) and (3.26), it is easy to obtain that
[TABLE]
It follows that
[TABLE]
From an easy adaptation of the argument used in STEP 1 in the proof of Proposition 3.23, the expectation of the last term on the right hand–side tends to [math] as . We now use Doob’s inequality for martingales, which yields that there exists constant such that for any martingale ,
[TABLE]
Recall (3.3) and (3.24). Hence, it suffices to notice that
[TABLE]
[TABLE]
[TABLE]
The desired result follows by combining the above results.
Lemma 3.25
Let . Then there exists a constant such that for all
[TABLE]
where is defined above.
Proof. From Lemmas 3.14 and 3.15, we can rewrite (3.25) and (3.30) in the following form
[TABLE]
[TABLE]
where
[TABLE]
From an adaption of the argument of proof of Lemma 3.24, we have that there exists a constant such that for all
[TABLE]
We now estimate the last term on the right of (3.41). It is clear that
[TABLE]
Next we observe that
[TABLE]
From the last two inequalities,
[TABLE]
The desired result follows by combining this with (3.42), (3.41) and Lemma 3.24.
Lemma 3.26
Let . Then there exists a constant such that for all and ,
[TABLE]
Proof. We will prove the second inequality, the first one follows from the second one with and the Cauchy-Schwarz inequality. We have
[TABLE]
where we can replace by . Hence the desired result follows by combining this with Lemma 3.25.
We are now ready to state the main result of this subsection. Recall (3.13) and Proposition 2.1.
Theorem 3.27
For any , as ,
[TABLE]
where is for any , the local time accumaled by , solution of (2.6).
We shall need
Lemma 3.28
For any , the mapping is continuous, uniformly for .
Proof. We need to show both that for any decreasing sequence , uniformly for , and for any increasing sequence , uniformly for . Both statements can be proved by exactly the same argument, so we establish the first statement.
For each , is cadlag, with only positive jumps. Consequently it is upper semi–continuous. Moreover, since is continuous and increasing for any , for all . For any , let
[TABLE]
Since is u.s.c., is an open subset of . However, , hence there exists such that , and since is increasing, , and for any , , , which establishes the result.
We are now prepared to complete the
3.27 : For , , we let . Thanks to Proposition 3.23, for each pair , is tight in . Hence along a appropriate subsequence, jointly for all ,
[TABLE]
in . From a theorem due to Skorohod, we can and do assume that those convergences hold a.s. This means that for any ,
[TABLE]
as , where for each , is continuous increasing, satisfies , , and and . The time change is precised in Lemma 3.29 below. It displaces the jumps of to those of . The ’s where those jumps happen do not depend upon , this is why we can choose independent of .
Now choose arbitrary. For any arbitrarily large, there exists such that . We have
[TABLE]
We now choose an arbitrary . Thanks to Lemma 3.28, we can choose large enough so that , for all . Hence we have
[TABLE]
We can now choose large enough so that . We then deduce that for such a , for all , , , hence
[TABLE]
The result follows.
Lemma 3.29
Fix and , and the sequence for . There exists a random time change which is continuous and strictly increasing, such that, along an appropriate subsequence,
[TABLE]
for the topology of uniform convergence on .
Proof. The proof will be divided in three steps. We will first define the sequence , then establish the convergence of , and finally that of for arbitrary. The fact that the above joint convergence holds along an appropriate subsequence then follows from the previous results.
Step 1. We order the points of the measure on the set in decresing order of their second coordinate. This produces the sequence , where . We associate to each . We consider those for which (and delete the others). The corresponding sequence is still denoted by an abuse of notation . is the values of at which the map has a jump of size . Note that for , has a jump at time iff , and has jumps only at times where jumps. Moreover, for each , there exists lare enough (possibly ) such that the jump of at is for all .
Consider now the point measure , the associated , and , where . Again hose points are ordered in decreasing order of the ’s, and only those for which are taken into account. Since , for each , there exists such that for all , the order of is the same as that of .
For each we choose as the piecewise linear function of whose graph joins , , where the ’s are listed in increasing order. If , then is continuous, strictly increasing and verifies , for and . For each , we let , where
[TABLE]
Step 2. Since the limit of is deterministic, what we want to show is in fact that tends to [math] in probability. If , then there are finitely many jumps, and the convergence is uniform w.r.t. . The result follows. If however , then the ’s are dense in , and consequently the ’s are dense in . For large enough, the distance between two consecutive ’s in the sequence is less than . Then for , , and the result follows.
Step 3 We write for . We assume here that all processes have been redefined in such a way that in , and , in probability. According to (3.30), , and combining the fact that in probability uniformly in with STEP 2, we deduce that uniformly in in probability. It remains to treat the term . We now use a similar decomposition as in the proof of Lemma 3.19.
Proposition 3.30
As , a.e.
Proof. In order to simplify the following argument, making use of a famous theorem due to Skorohod, we may and do assume that and a.s. From Proposition 3.16 a.s., locally uniformly in , and according to Theorem 3.27, for all and ,
[TABLE]
then a.e., in probability. For this purpose, for any , we have
[TABLE]
and the latter set is at most countable. Since admit a local time, spends zero time in such a countable set. Hence a.s., a.e., is continuous at . For such an , we have
[TABLE]
where the random function satisfying , , is continuous and strictly increasing and is such that . Define the event ,
[TABLE]
As , the first term on the right tends to [math] thanks to Lemma 3.27, the second term tends to [math] since both uniformly on and uniformly on , and finally the third term tend to [math] since is a continuity point of and again uniformly on . Finally, for each , . The result follows.
4 Convergence of the height process with interaction
In the nonlinear case where the linear drift is replaced by a nonlinear drift , the approximation of (2.7) will be given by the total mass of a population of individuals, each of which has mass . The initial mass is , and follows a Markovian jump dynamics : from its current state ,
[TABLE]
The following result is a consequence of Theorem 4.1 in [11].
Proposition 4.1
Suppose that Assumptions and (2.8) are satisfied. Then, as , converges to in distribution on , where is the unique solution of the SDE (2.7).
The process is piecewise linear, continuous with derivative : at any time the rate of appearance of minima (giving rise to births, i.e. to the creation of new branches) is equal to
[TABLE]
and the rate of of appearance of maxima (describing deaths of branches) is equal to
[TABLE]
We now want to use Girsanov’s theorem, in order to reduce the present model to the one studied in section 3. To this end, for define
[TABLE]
recall that is a Poisson point process with intensity under the probability measure so that has the intensity
[TABLE]
Recall (3.3). We now define the collection of -algebras and we introduce a Girsanov-Radon-Nikodym derivative
[TABLE]
with Under the additional assumption that is bounded, it is clear that is a martingale, hence for all In this case, we define as the probability such that for each
[TABLE]
It follows from Proposition 5.2 below with
[TABLE]
that under ( resp., ) has the intensity
[TABLE]
4.1 The Case where is bouned
We assume in this subsection that for all and some This constitutes the first step of the proof of convergence of As explained at above, in this case we can use Girsanov’s theorem to bring us back to the situation studied in section 3.
Recalling equations (3.24) and (3.26), we can rewrite (3.27) in the form
[TABLE]
Moreover, from (3.3), (4.43) and (4.44), we have
[TABLE]
while
[TABLE]
From Corollary 3.10, Lemma 3.11 and Proposition 3.18, we deduce that is a tight sequence in Since is bounded, the same is true for uniformly with respect to It easy to deduce from (4.44) and Proposition 5.5 that the sequence is tight and as a consequence is a tight sequence in Therefore at least along a subsequence (but we do not distinguish between the notation for the subsequence and for the sequence),
[TABLE]
as in
Moreover, from Lemma 3.4 and Proposition 3.30, we deduce that
[TABLE]
Recall Corollary 3.10, Lemma 3.11 and (3.29). It follows from the above that Proposition 3.18 can be enriched as follows
Proposition 4.2
As ,
[TABLE]
in where and are two mutually independent standard Brownian motions. Moreover
[TABLE]
We clearly have
[TABLE]
Since is bounded for all Let now denote the probability measure such that
[TABLE]
where It follows from Girsanov’s theorem (see Proposition 5.1 below) that there exist two mutually independent standard -Brownian motions and such that
[TABLE]
Consequently
[TABLE]
where
[TABLE]
is a standard Brownian motion under Consequently is a weak solution of the SDE
[TABLE]
We now deduce from Proposition 4.2 and Lemma 24 in [29] the main result of this subsection.
Theorem 4.3
Assume that , and is bounded. Then the law of the approximate height process , defined under (i.e. with the Poisson processes having the intensities specified by (4.45)) converges towards the law of the height process under (i.e. specified by (4.46)).
4.2 The general case and
We first note that condition (2.8) guarantees only local boundedness of . Thus, in order to make sure that Girsanov’s Theorem is applicable, we use a localization procedure and associate to each a function , is uniformly continuous on , and
[TABLE]
From this definition, it is easy to see that , which implies .
Now we define the processes exactly as the process , except that is replaced by . Let us now state our final result.
Theorem 4.4
Assume that , and , for some given . Then, as , the law of , specified by (3.14) with the intensities of the Poisson processes specified by (4.45) converges to the law of , the solution of equation (4.46).
Proof. We work on the probability space . We consider the processes and restricted to an arbitrary time interval . Suppose we have two interaction functions and which both satisfy the above assumption 2.8, and which coincide on the interval . It is then plain that the corresponding processes and (resp. and ) have the same law on the time interval (resp. ), where
[TABLE]
For each , consider the event
[TABLE]
On the event , . On the event , from Proposition 3.16 and Proposition 3.30, for large enough, and . Consequently on the event , for such an , , and from Theorem 4.3 with replaced by tells us that with the intensities specified by (4.45) (but with replaced by ) converges towards , the weak solution of (4.46), but with replaced by . But on the event , and uniformly for large enough, the intensities in (4.45) with and with coincide, and similarly for the equation (4.46). Since , the result follows.
5 Appendix
In this section we recall few important notions and give some results used in this work. We do not give proofs of most of the following statements.
5.1 Two Girsanov Theorems
We state two versions of the Girsanov theorem, one for the Brownian and one for the point process case. The first one can be found, e.g., in [30] and the second one combines Theorems T2 and T3 from [6], pages 165-166. We assume here that our probability space is such that
Proposition 5.1
Let be a standard dimensional Brownian motion (i.e., its coordinates are mutually independent standard scalar Brownian motions) defined on the filtered probability space Let moreover be an -progressively measurable dimensional process satisfying for all Let
[TABLE]
If then is a standard Brownian motion under the unique probability measure on which is such that for all
Proposition 5.2
Let be a -variate point process adapted to some filtration and let be the predictable -intensity of Assume that none of the jump simultaneously. Let be nonnegative -predictable processes such that for all and all
[TABLE]
For and define, denoting the jump times of
[TABLE]
If then, for each the process has the -intensity where the probability measure is defined by for all
5.2 Tightness criteria in
We denote by , the space of functions from into which are right continuous and have left limits at any (as usual such a function is called cÂà dlà Âg).We briefly write for the space of adapted, cÂà dlà Âg stochastic processes. We shall always equip the space with the Skorohod topology, for the definition of which we refer the reader to Billingsley [3] or Joffe, Métivier [17].
We first state a tightness criterion, which is Theorem 13.5 from [3] :
Proposition 5.3
Let be a sequence of random elements of A sufficient condition of to be tight is that the two conditions 1 and 2 be satisfied :
1. For each the sequence of random variables is tight in
2. For each there exists and such that
[TABLE]
for all .
The convergence in is not additive in general. The next proposition gives a sufficient condition to have this additivity, which is Lemma 7.1 of [23].
Proposition 5.4
Let and be two tight sequences of random elements of such that any limit of a weakly converging sub-sequence of the sequence is a.s. continuous. Then is tight in .
Consider a sequence of one-dimensional semi-martingales, which is such that for each ,
[TABLE]
where for each , is a locally square-integrable martingale such that
[TABLE]
and are Borel measurable functions with values into and respectively. We define .
The following statement can be deduced from Theorem 13.4 and 16.10 of [3].
Proposition 5.5
A sufficient condition for the above sequence of semi-martingales to be tight in is that both
[TABLE]
and for some ,
[TABLE]
Those conditions imply that both the bounded variation parts and the martingale parts are tight, and that the limit of any converging subsequence of is a.s. continuous.
If moreover, for any , as ,
[TABLE]
then any limit X of a converging subsequence of the original sequence is a.s. continuous.
Lemma 5.6
Let be a sequence of processes whose trajectories belong to and satisfy
[TABLE]
We assume that for each , there exists a decomposition such that is tight as random elements of , and moreover, for all
[TABLE]
Then the sequence is tight as random elements of .
Proof. We shall exploit Theorem 13.2 from [3]. We will establish tightness in , for arbitrary. The moduli of continuity below are understood to be defined on the time interval . Condition (i) follows from our assumption (5.47). Hence it suffices to verify (ii), namely that for each , there exists such that
[TABLE]
We first note that from the definitions of (resp. ) (see (7.1) (resp. (12.6)) in [3]), for each ,
[TABLE]
But since , for all ,
[TABLE]
Hence from (5.48), we can choose such that
[TABLE]
Since is tight, again from Theorem 13.2 from [3], we can choose small enough such that
[TABLE]
A combination of (5.50), (5.51) and (5.52) yields (5.49).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Athreya, K. B. and Ney, P.E. Branching processes , Springer- Verlag, New York, 1972.
- 2[2] Bansaye, V., Caballero, M.E. and Méléard, S. Scaling limits of population and evolution processes in random environment. Electron. J. Probab. 24 , Paper No. 19, 2019.
- 3[3] Billingsley, P. Convergence of Probability Measures, 2nd edn John Wiley, New York, 1999.
- 4[4] Berestycki, J., Fittipaldi, M.C. and Fontbona, J. Ray–Knight representation of flows of branching processes with competition by pruning of Lévy trees, Probab. Theory and Rel. Fields , to appear.
- 5[5] Bertoin, J. Lévy processes, Cambridge University Press, 1996.
- 6[6] Brémaud, P. Point processes and queues: martingale dynamics. 1981.
- 7[7] Çinlar, E. Probability and Stochastics , Graduate Texts in Mathematics,vol. 261 . Springer Science & Business Media, 2011.
- 8[8] Dawson, D. A. and Li, Z. Stochastic equations, flows and measure-valued processes. The Annals of Probability , 40 (2):813–857, 2012.
