Convergence to a Continuous State Branching Process with jumps and Height Process
Ibrahima Drame, Etienne Pardoux

TL;DR
This paper investigates the asymptotic behavior of Galton-Watson genealogies, demonstrating convergence of rescaled processes to a continuous state branching process with jumps and the associated height process.
Contribution
It establishes the convergence of the rescaled height process of Galton-Watson trees to the continuous height process introduced by Le Gall and Le Jan.
Findings
Rescaled Galton-Watson processes converge to CSBP with jumps.
Rescaled height processes converge to the continuous height process.
Provides a functional convergence result for genealogical structures.
Abstract
In this work, we study asymptotics of the genealogy of Galton-Watson processes. Thus we consider a offspring distribution such that the rescaled Galton-Watson processes converges to a continuous state branching process (CSBP) with jumps. After we show that the rescaled height (or exploration) process of the corresponding Galton-Watson family tree, converges in a functional sense, to the continuous height process that Le Gall and Le Jan introduced in 1998 on their paper "branching processes in L\'evy processes : The exploration process".
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 · Theoretical and Computational Physics · Markov Chains and Monte Carlo Methods
Convergence to a Continuous State Branching Process with jumps and Height Process.
I. Dramé 111 Aix-Marseille Université, CNRS, Centrale Marseille, I2M, UMR 7373, 13453 Marseille, France. [email protected]
E. Pardoux 777 Aix-Marseille Université, CNRS, Centrale Marseille, I2M, UMR 7373, 13453 Marseille, France. [email protected]
Abstract
In this work, we study asymptotics of the genealogy of Galton-Watson processes. Thus we consider a offspring distribution such that the rescaled Galton-Watson processes converges to a continuous state branching process (CSBP) with jumps. After we show that the rescaled height (or exploration) process of the corresponding Galton-Watson family tree, converges in a functional sense, to the continuous height process that Le Gall and Le Jan introduced [22].
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 [17] 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 [20]). In Li ([23] ,[24]), it was shown that the CSBP arises naturally as the scaling limit of a sequence of discrete G-W branching processes.
However, If a scaling limit of discrete-time G-W processes converges to a CSBP, then it has been shown in [11], Chapter 2, 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].
In this work, we are interested in continuous versions of this correspondence. Indeed we first give a construction of CSBP as scaling limits of continuous time G-W branching processes. To 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 these (rescaled) continuous process to the continuous height process defined in [25], which is also the one defined in Chapter 1 of [11].
In [10] Dramé et al study the convergence of a general continuous time branching processes which describes a population where multiple births are allowed (in the case where the number of children born at a given birth event has a finite moment of order for some arbitrarily small). In the present work, we aim to extend those results to G-W trees with possibly infinite variance of the numbers of children born at a given birth event. In this paper we use some recent results concerning the genealogical structure of CSBP that can be found in ([22],[11], [25]).
The organization of the present paper is as follows : In Section 2 we recall some basic definitions and notions concerning branching processes. In Section 3 and 4, we present our main results and the proofs. 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 Preliminaries
2.1 Continuous state branching process
A CSBP is a -valued strong Markov process starting from the value at time [math] whose probabilities is such that for any , , is equal in law to the convolution of and . 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 [29], 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 on which satisfies
[TABLE]
We shall sometimes write for the function attached to the triple .
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 [9]) we have
[TABLE]
where is a standard Brownian motion, is a Poisson random measure with intensity independent of , and is the compensated measure of .
Remark 2.1
The assumption (2.3) is equivalent to being locally Lipschitz; see the proof of Proposition 1.45 of Li [23]. This property plays an important role in what follows.
The following result is Theorem 2.1.8 in Li [24]
Proposition 2.2
Suppose that is given by (2.2). Then there is a Feller transition semigroup on defined by
[TABLE]
A Markov process is called a CSBP with branching mechanism if it has transition semigroup defined by (2.5).
2.2 The height process
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
[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] and [6] for a proof of that result. In the sequel of this paper (in subsection 3.2), we will assume that is a Lévy process with no negative jumps, whose Laplace exponent has the form (2.2), where , and is a -finite measure on which satisfies (2.3), and we exclude the case . We note that our standing assumption implies the Grey condition
[TABLE]
This assumption ensures also that the corresponding height process is continuous, see [11] (recall that if this condition does not hold, the paths of have a very wild behavior). 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 [11]. In this paper, we will use the new definition of the height process given by Li et all in [25]. Indeed, if the Lévy process has the form (2.6), 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 [11]. We shall need the following result which is Lemma 1.3.2 in [11].
Lemma 2.3
For every ,
[TABLE]
Let us fix our notations concerning the local times. We define the local time accumulated by (the height process associated with the Lévy process ) at level up to time :
[TABLE]
Combining Lemma 2.3 with (2.8) leads to
Remark 2.4
The scaling of is such that
[TABLE]
3 Scaling Limits of continuous time branching processes
In this section, we obtain the CSBP as a scaling limit of continuous Galton-Watson branching processes. We will start with the general case and then we will treat a special case. Let be an integer which will eventually go to infinity.
3.1 The general case
In this subsection, we obtain the general form of the branching mechanism of CSBP. We then provide a construction of these processes via an approximation by continuous-time Galton-Watson processes. To this end, let us define by
[TABLE]
where satisfies (2.3).
Remark 3.1
The family (3.9) contains the functions
[TABLE]
that correspond to that we will develop in the next subsection but in a more general context.
We set
[TABLE]
and
[TABLE]
It is easy to see that is an analytic function in satisfying and
[TABLE]
Therefore is a probability generating function. Now, let be a random variable whose generating function is . In what follows, we set , and , where
Let us define for ,
[TABLE]
It is easy to check that is a probability generating function. Let be a random variable whose generating function is . For the rest of this subsection we set,
[TABLE]
Let be a random variable defined by
[TABLE]
We assume that the three variables , and are independent. Let be a random variable defined by
[TABLE]
Now we consider a continuous time -valued branching process which describes the population size at time . In this population, each individual dies independently of the others at the constant rate , and gives birth to new offspring individuals. In other words, from (3.15) the generating function of the branching distribution is
[TABLE]
Such a process is a Bienaymé-Galton-Watson process in which to each individual is attached a random vector describing her lifetime and her number of offsprings. We assume that those random vectors are independent and identically distributed (i.i.d). The rate of reproduction is governed by a finite measure on , satisfying and , for every . More precisely, each individual lives for an exponential time with parameter , and is replaced by a random number of children according to the probability for every . Hence the dynamics of the continuous time Markov process is entirely characterized by the measure . We have the following proposition, which can be seen in Athreya-Ney [2]; see also Pardoux [27].
Proposition 3.2
The generating function of the process is given by
[TABLE]
where
[TABLE]
and the function id defined by
[TABLE]
where and is the generating function given by
[TABLE]
(Recall that was also defined in (3.16)).
We are interest in the scaling limit of the process : We will start with for some fixed , and study the behaviour of . The continuous time process is a Markov process with values in the set . We denote by the transition probability of the process . For
[TABLE]
where was given in Proposition 3.2. This suggests to define
[TABLE]
The function solves the equation
[TABLE]
where . However, from the definition of in Proposition 3.2, we have
[TABLE]
Note that
[TABLE]
The following Lemma plays a key role in the asymptotic behavior of
Lemma 3.3
The sequence converges to defined in (2.2) as .
Proof. Combinng (3.16) and (3.19), we have
[TABLE]
From (3.12) it is easy to check that
[TABLE]
Hence, it follows that the sequence converges to as . However, from (3.9) and (3.11) it is easy to see that . The desired result follows readily by combining the above arguments.
Proposition 3.4
Let be the unique locally bounded positive solution of (2.1). Then we have for every , uniformly on compact sets in , as . (recall that was given in (3.18))
Proof. We take the difference between (2.1) and (3.18), and use Lemma 3.3 and the fact that is Lipschitz on (see Remark 2.1) to obtain that for ,
[TABLE]
where as , and is the Lipschitz constant for on . We conclude from Gronwall’s lemma that for every ,
[TABLE]
uniformly on compact sets in .
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 theorem of this section is the following :
Theorem 3.5
Let be the càdlàg CSBP defined in (2.4) with transition semigroup defined by (2.5). Since converges to , converges to in distribution on .
Proof. The proof of the theorem follows by Proposition 3.4 and an argument similar to the proof of theorem 3.43 in Li [23] (see, also Theorem 2.1.9 in Li [24]).
3.2 A special case
We now want to specify the above statement in particular case. In other words, in this case we give a special case of triplet characterizing the branching mechanism. To this end, let and be two probability generating functions defined respectively by
[TABLE]
, where . Let be a probability measure on . We define
[TABLE]
where is the Dirac measure at . For the rest of this section we set
[TABLE]
Let be a random variable with in values in , and its probability generating function defined by
[TABLE]
Remark 3.6
The interest of this special case is that not only will we have an explicit measure , which is the mean measure of a mixture of -stables processes. In other words, in the case where the measure is given by (where is the Dirac measure at ), then we find the classical -stable case.
We consider a continuous time -valued branching process which describes the population size at time . In this population, each individual dies independently of the others at constant rate , and gives birth to new offspring individuals.We now define the rescaled continuous time process
[TABLE]
In particular, we have that
[TABLE]
Following the same approach as general case, the approximate branching mechanism defined in (3.19) is obtained by an easy adaptation. In other words, in this case, the equation (3.19) takes the following form
[TABLE]
We now prove
Lemma 3.7
The sequence converges to
[TABLE]
as , where
[TABLE]
Proof. Combining (3.20), (3.21), (3.22) and (3.23), we have
[TABLE]
with
[TABLE]
and
[TABLE]
In the same way as done in the proof of Lemma 3.3, we have that the sequence converges to as . However, from (3.20) and (3.25), it is easily to see that . Now, noting that
[TABLE]
we deduce from Fubini’s Theorem that
[TABLE]
The desired result follows readily by combining the above arguments.
For the convenience of statement of the result, we assume that satisfies the following condition
[TABLE]
Condition (3.26) combined with Remark 2.1 leads to
Corollary 3.8
The function with the representation (3.24) is locally Lipschitz.
The rest is entirely similar to the general case. Therefore, we obtain a similar convergence result.
Theorem 3.9
Let be a càdlàg CSBP defined as (2.4) with transition semigroup defined by (2.5). Since converges to in distribution, then converges to , where the triplet is given by
[TABLE]
The convergence holds in the sense of weak convergence on .
4 Convergence of the Exploration process
In this section, we show that the rescaled exploration process of the corresponding Galton-Watson family tree, converges in a functional sense, to the continuous height process associated with the CSBP. In this section, we assume that
[TABLE]
and we renforce (2.3), and assume that for some ,
[TABLE]
Let us rewrite (2.6) in the following form
[TABLE]
Consequently, we can rewrite (2.7) in the form
[TABLE]
Remark 4.1
Note that the last term on the right end side of (4.27) is an continuous and increasing process. And we notice also that the second writing of is possible thanks to the assumption .
Let us note that according to an inequality due to Li et all in [25], we have
[TABLE]
So the first writing of has a meaning without the supplementary assumption . But we were not able to establish the convergence of the exploration process without the assumption .
The measure will appear many times in this section. It will always refer to a measure on satisfying .
Let us state some intermediate results which will be useful in the sequel.
4.1 Preliminary results
We notice that one of the aims of this subsection is construct the random measure , which will be specified below in (4.39). It is an complicated construction but essential for the rest.
Let us define and by
[TABLE]
where satisfies (2.3). In what follows, we set
[TABLE]
[TABLE]
Note that , where was defined in . From an adaptation of the argument used after equation (3.11), we deduce that and are probability generating functions. We define and by
[TABLE]
where and denote the -th derivative of and respectively. Hence it is well known that and can be written as
[TABLE]
However, it is easy to check that
[TABLE]
and
[TABLE]
Now, let and be two random variables with the generating functions and respectively. Let be a random variable defined by
[TABLE]
We assume that the three variables , and are independent. Let be a random variable defined by
[TABLE]
We denote by the probability generating function of . We deduce from (4.31) that
[TABLE]
where
[TABLE]
Let us rewrite in the form
[TABLE]
where was defined in (3.9). We notice that , (recall that was defined in (3.11)). It is plain as previously that
[TABLE]
Let be a random variable whose generating function which was defined in (3.12). Let us define
[TABLE]
Hence, it is easy to see that can be written as
[TABLE]
We assume that the three variables , and are independent, recall that was defined in (3.14). Let be a random variable defined by
[TABLE]
We denote by the probability generating function of . Hence, it is easy to see that
[TABLE]
where
[TABLE]
In other words, can be written in the form
[TABLE]
We notice that , (recall that was defined in (3.16)). Now, let be a random variable with with probability distribution and let be a random variable with value in defined by
[TABLE]
It is easy to check that
[TABLE]
In what follows, we set However, it is also easy to check that, for all ,
[TABLE]
Therefore, is a probability distribution on However, from (4.32) and (4.35), we deduce that
[TABLE]
with
[TABLE]
For the same arguments as previously and are probabilities distributions on Let and be two random variables with probabilities distributions and respectively. Let be a random variable defined by
[TABLE]
We assume that the three variables , and are independent. From (4.1) it is easy to see that can be written as
[TABLE]
We define , the expectations of . From (4.35), we have the
Remark 4.2
[TABLE]
Let be a probability measure on defined by . For the rest of this subsection, we set
[TABLE]
In what follows, we will use the bounds
[TABLE]
We shall need below the
Lemma 4.3
For all
[TABLE]
Proof. We have
[TABLE]
where we have used (4.39). However from (4.34), we deduce that
[TABLE]
However, we deduce from (4.40) that
[TABLE]
The desired result follows.
The end of the present section will be devoted to the proof of
Proposition 4.4
For every continuous function from into such that for some constant we have
[TABLE]
We will need the following technical results on Galton-Watson trees. To this end, let be a sequence of Galton-Watson branching process with offspring distribution , with offspring generating function Recall that and were defined in (4.32) and (4.1) respectively. We have the following
Proposition 4.5
*(Theorem 3.43 in Li [24])
For any ,*
[TABLE]
where is a -CSBP.
We define another probability measure on by setting for every . We denote by a discrete-time random walk on with jump distribution and started at [math]. We get the following result, which plays an important role in our approach.
Proposition 4.6
*(Theorem 2.1.1 in Duquesne and Le Gall [11])
Proposition 4.5 implies that for any *
[TABLE]
where is a -Lévy process.
Let be a truncation function, that is a bounded continuous function from into such that for every belonging to a neighborhood of By standard results on the convergence of rescaled random walks (see e.g. Theorem II.3.2 in [16], see also the proof of Theorem 2.2.1 in [11]), the convergence (4.41) implies the two following condition satisfied:
[TABLE]
However, from (4.35) and (4.39), we have that
[TABLE]
Let us define by and we set for all
[TABLE]
Note that is also a finite measure on Furthermore, a simple consequence of implies that for any such that on a neighborhood of
[TABLE]
where and
We shall need below the
Lemma 4.7
For any there exists such that
[TABLE]
where
Proof. Let us define
[TABLE]
Now, since we then obtain
[TABLE]
However, from (4.43), it follows that
[TABLE]
It is plain that
[TABLE]
Combining this with (4.44) and (4.45), we deduce that
[TABLE]
It follows that for any there exists such that
[TABLE]
Consequently, there exists such that for any We then obtain the
Corollary 4.8
The sequence is tight.
Consequently there exists a subsequence (which we denote as the whole sequence, as an abuse notation) which converges weakly. We prove the
Lemma 4.9
As for every continuity point of .
Proof. Let us define
[TABLE]
From (4.43), we deduce easily that
[TABLE]
However, we have
[TABLE]
Therefore, the result follows by letting tend to since provided is a continuity point of ,
[TABLE]
Since all converging subsequences have the same limit, the whole sequence converges :
Corollary 4.10
For any ,
We can now establish
Lemma 4.11
For every continuous function from into such that for some constant we have
[TABLE]
Proof. Recalling (4.42)and Corollary 4.10, we have that
[TABLE]
4.4. We shall use in two instances the fact that any continuous function with compact support in satisfies , so that we can apply Lemma 4.11 to it.
Let be the continuous function from into defined for any by
[TABLE]
Let be an arbitrary continuous function from into such that, we some constant , . It is plain that
[TABLE]
From Lemma 4.11, for any , as ,
[TABLE]
Next we define for any the continuous function by
[TABLE]
We now note that
[TABLE]
Consequently
[TABLE]
Finally, combining (4.46) and (4.47), we obtain
[TABLE]
The result follows by taking the limit as , thanks to the dominated convergence theorem, in the system of inequalities
[TABLE]
Thanks to these results, we are now in position to study the asymptotic properties of the exploration process.
4.2 Tightness and Weak convergence of the Contour process
Consider , the contour process of the forest of trees representing the population . We define , the (scaled) local time accumulated by at level up to time , as
[TABLE]
The motivation of the factor will be clear after we have taken the limit as . equals times the number of pairs of -crossings of between times [math] and . Note that this process is neither right- nor left-continuous as a function of .
Now, we will need to write precisely the evolution of To this end, we first recall (4.35) and (4.39). Let be a sequence of i.i.d r.v’s with as joint law of Let be a Poisson process, with intensity We assume that the two sequences and are independent. Let be the sequence of successive jump times of the Poisson process Since is independent of it follows from Corollary 3.5, p.265 in [7] that forms a Poisson random measure on with mean measure , recall that . More precisely
Remark 4.12
For fixed , we have
[TABLE]
This implies that one can write
[TABLE]
where is a Poisson random measures on with mean measures recall that was defined in (4.39).
Let and be three mutually independent Poisson processes, with respective intensities and We assume that the four processes and are independent. Let us define
[TABLE]
It is well known that the random process and are Poisson processes, with intensity and respectively. Let be the c?àdlà?g -valued process which is such that, almost everywhere, with The -valued process solves the SDE
[TABLE]
where the are the successive jump times of the process
[TABLE]
For any , denotes the number of reflections of above the level . We deduce from (4.2)
[TABLE]
where
[TABLE]
with
[TABLE]
[TABLE]
Observe that , for almost every . Writing the first line of (4.2) as
[TABLE]
denoting by , , and the four local martingales
[TABLE]
[TABLE]
[TABLE]
and
[TABLE]
and recalling (4.2), we deduce from (4.2)
[TABLE]
with
[TABLE]
and
[TABLE]
The first following statement is elementary.
Lemma 4.13
The sequence is tight in
Moreover, since and are purely discontinuous local martingales, we deduce from (4.54), (4.55) and (4.56) that
[TABLE]
[TABLE]
It follows readily that there exists a constant such that
[TABLE]
Hence is a square integrable martingale. We can prove similarly that is a square integrable martingale. However, we deduce from the proof of Lemma 4.3 that there exists a constant such that
[TABLE]
Corollary 4.14
* and are square integrable martingales.*
We shall need below the
Lemma 4.15
There exists a constant such that for all ,
[TABLE]
recall that denote a constant which may differ from line to line.
Proof. We have
[TABLE]
This together with (4.60), Doob’s -inequality for martingales implies
[TABLE]
We can prove similarly that
[TABLE]
From this proof, we deduce the following
Corollary 4.16
As ,
[TABLE]
It is easy to obtain from Remarks 4.12, (4.49) and (4.2) that
[TABLE]
Recall that is a Poisson random measures on with mean measures
We shall need below the
Lemma 4.17
There exist a constant such that for all ,
[TABLE]
Proof. we first note that
[TABLE]
By taking the limit on both side, we obtain
[TABLE]
Hence the Lemma follows readily from Lemma 4.3 and assumption .
For , define
[TABLE]
Let resp. denote the intensity of the process resp. where was defined in (4.51). In other words, we have
[TABLE]
For the rest of this subsection we set
[TABLE]
[TABLE]
Remark 4.18
Note that ( resp. ) can be viewed as time-changed of mutually independent standard Poisson processes (resp. ) i.e.
[TABLE]
From (4.58) and Remark 4.18, we deduce that
[TABLE]
where denotes the length of the time interval during which and is the first jump time of after . It is easily seen that has the standard exponential distribution and we notice that is a sequence of independent random variables. By the same computations, we deduce from (4.53)
[TABLE]
where . From (4.55), we have also
[TABLE]
where and where denotes the length of the time interval during which and is the first jump time of after . As previously has the standard exponential distribution and is a sequence of independent random variables.
We notice that
[TABLE]
If we define for
[TABLE]
we obtain the following relations
[TABLE]
with
[TABLE]
and
[TABLE]
with
[TABLE]
We shall need below the
Lemma 4.19
As , .
Proof. The proof follows an argument similar to the proof of Lemma 4.24 in [10].
Moreover, we have
Lemma 4.20
There exist a constant such that for all ,
[TABLE]
Proof. We notice that
[TABLE]
this implies
[TABLE]
Hence taking expectation in both side and using wald’s identity, we deduce that
[TABLE]
where we have used the same arguments as in the proof of Lemma 4.3. Hence the desired result follows.
We next define for
[TABLE]
Recalling (4.63) and let us rewrite (4.2) in the form
[TABLE]
We want to estimate the stochastic process Thus, we first need to prove some intermediate results.To this end, let us define Recall that is fixed real number with . In what follows will be a random variable satisfying , , and will be independent random variables each having the distribution of will be positive constants depending only However, we deduce from (4.38) that
[TABLE]
For define
[TABLE]
We first need the two following Lemmas.
Lemma 4.21
There exist such that
[TABLE]
where was defined in (4.39).
Proof. We first recall that is a random variable with probability distribution and where was defined in (4.37). Now, we have
[TABLE]
However, recalling (4.29), we deduce from (4.37) that
[TABLE]
Now, combining this with (4.2) and the fact that
[TABLE]
we deduce that
[TABLE]
Hence the Lemma follows readily from assumption .
Lemma 4.22
There exist such that
[TABLE]
Proof. In this proof, we shall use the following inequality
[TABLE]
Recall that is a random variable with probability distribution and where was defined in (4.37). Now, we have
[TABLE]
However, recalling (4.30), we deduce from (4.37) that
[TABLE]
However, using (4.68), we have
[TABLE]
Combining this with (4.2), we deduce that
[TABLE]
Now, combining this with (4.2) and the fact that
[TABLE]
we deduce that
[TABLE]
Hence the Lemma follows readily from Assumption
Let be a random variable. For , we define its -norm by \|\bf{X}\|_{\ell}=\big{[}{\mathbb{E}}|\bf{X}|^{\ell}\big{]}^{\frac{1}{\ell}}. The main tool in the following lemma is the existence of positive constants and depending only on such that for all ,
[TABLE]
see Theorem 5 in [26]. Recall that was given by
[TABLE]
where is a sequence of i.i.d rv’s. Note also that and the sequence are independent. We now prove
Lemma 4.23
There exists a constant such that for all
[TABLE]
Proof. Recalling the inequality
[TABLE]
and recall also that Using the righthand side of (4.71),
[TABLE]
where we have used the Minkowski inequality for the second inequality, (4.72) for the 3th inequality, the Wald identity for the 4th inequality and finally Lemmas 4.21 and 4.22 and the fact that
Lemma 4.23 combined with (4.65) leads to
Corollary 4.24
There exists a constant such that for all
[TABLE]
We will need the following lemmas
Lemma 4.25
There exists a constant such that for all ,
[TABLE]
(recall that was defined in (4.65)).
Proof. We have
[TABLE]
From (4.65), it is easy to check that is a discrete-time martingale. Moreover, note that is a stopping time. Hence, from Doob’s inequality we have
[TABLE]
The result now follows readily from Corollary 4.24.
The following Proposition plays a key role in the asymptotic behaviour of
Proposition 4.26
There exist a constant such that for all ,
[TABLE]
Proof. Let us rewrite (4.2) in the form
[TABLE]
where
[TABLE]
since, from (4.48), it is easily checked that . Set
[TABLE]
then the fact that is increasing, and increases only on the set of time when proves that and . Hence, we obtain that
[TABLE]
It follows that
[TABLE]
Since, moreover is a process with values in see (4.61), we have from (4.2) that
[TABLE]
Combining this inequality with (4.75), we deduce that
[TABLE]
Hence taking expectation in both side, we deduce that
[TABLE]
This together with (4.59), Lemmas 4.15, 4.17, 4.20, 4.25, Doob’s -inequality for martingales implies the result.
We shall need below the
Lemma 4.27
For any ,
[TABLE]
in probability, as .
Proof. We have (the second line follows from (4.2))
[TABLE]
[TABLE]
We conclude by adding and substracting the two above identities and using Proposition 4.26.
Thus, we have the following result
Lemma 4.28
For any in probability, as where
Moreover, we have the following result which is Proposition 4.23 in [10].
Lemma 4.29
As ,
[TABLE]
where and are two mutually independent standard Brownian motions.
Let us rewrite (4.2) in the following form
[TABLE]
with
[TABLE]
From (4.2), (4.53) and (4.58), we deduce that
[TABLE]
with
[TABLE]
and
[TABLE]
We first prove the
Lemma 4.30
As ,
[TABLE]
Proof. From (4.51) we have
[TABLE]
where is a local martingale (recall that was a Poisson process with intensity ). However, we deduce from 4.39 and the proof of Lemma 4.3 that
[TABLE]
recall that It follows from Proposition 4.4 that as
However, it is easy to check that
[TABLE]
Using Doob’s inequality, we obtain
[TABLE]
where we have used assumption for the last inequality. It follows that
[TABLE]
Hence, the desired result follows readily by combining the above arguments.
We shall need below
Lemma 4.31
For any in probability, as , where
[TABLE]
Proof. From (4.79) and the proof of Lemma 4.3, we have
[TABLE]
The result now follows from Proposition 4.4 and Lemma 4.27.
It is easy to obtain from Remarks 4.12, (4.49) and (4.80) that
[TABLE]
Recall that is a Poisson random measures on with mean measures We now want to estimate the stochastic process . In the next statement, we shall write to mean except when in which case For , define
[TABLE]
Let be a stopping time, with We first check that
Lemma 4.32
For any we have
[TABLE]
where
[TABLE]
Proof. FISRT STEP Suppose . We can write the restriction of to as , where are stopping times. Let . Since is -mesurable, we have
[TABLE]
where we have used the fact that for any for the 4th equality, the fact that for the 5th equality.
SECOND STEP : We now treat the case . It follows from the above result that for any ,
[TABLE]
We can take the limit in that identity as , thanks to the monotone convergence theorem.
Recall the definition (4.81) of the stochastic process . We have
Lemma 4.33
For any stopping time such that a.s, arbitrary,
[TABLE]
where is an arbitrary constant.
Proof. From (4.81), we have that
[TABLE]
where we have used assumption for the last inequality.
We need the following
Lemma 4.34
For any , there exists such that
[TABLE]
Proof. This is an immediate consequence of (4.73) and the arguments in the proof of Proposition 4.26.
We are now in a position to prove tightness of the stochastic process . To this end, let be a sequence of stopping times in . We have the
Proposition 4.35
For any , we have
[TABLE]
Proof. From (4.61), we have
[TABLE]
It follows that
[TABLE]
The Proposition is now a consequence of two next lemmas.
Lemma 4.36
For any ,
[TABLE]
Proof. From an adaptation of the argument of Lemma 4.32, we deduce that
[TABLE]
The rest is entirely similar to the proof of Lemma 4.33.
Lemma 4.37
For any ,
[TABLE]
Proof. We have
[TABLE]
From an adaptation of the argument of Lemma 4.32, we deduce that
[TABLE]
It follows from (4.2) and Lemma 4.34 that
[TABLE]
Thanks to Proposition 4.4, by taking the limit on both side, we then obtain
[TABLE]
Now, from the dominated convergence theorem, we deduce that
[TABLE]
Thus, Lemma 4.33 combined with Proposition 4.35 and Aldous’ tightness criterion in [1] (see e.g. Theorem 16.10 in [4]) leads to
Corollary 4.38
The sequence is tight in
Recalling (4.2), we can rewrite (4.76) in the form
[TABLE]
where
[TABLE]
We have the following result.
Lemma 4.39
The sequence is tight in .
Proof. The proof follows by an argument similar to the proof of Lemma 4.37 in [10].
Recall (4.83). We now deduce the tightness of from the above results concerning , without having to worry about the local time terms.
Proposition 4.40
The sequence is tight in .
Proof. The proof follows by an argument similar to the proof of Proposition 4.39 in [10].
Recall that is a Poisson random measures on with mean measures 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 following result is Proposition 2.15 in ([8], p. 60).
Lemma 4.41
The sequence converges in distribution in iff the mean measure converges to a measure . Then in where is a Poisson random measure on with mean measure
Lemma 4.41 combined with Proposition 4.4 leads to
Corollary 4.42
As in where is a Poisson random measure on with mean measure where was defined in (2.3).
In what follows, we set
[TABLE]
We need to prove
Proposition 4.43
As in where is a Poisson random measure on with mean measure where was defined in (2.3).
We first establish a few lemmas
Lemma 4.44
As in the sense of finite-dimensional marginals.
Proof. Let We have that
[TABLE]
Hence, from Corollary 4.42 , it follows easily that for any the sequence of random variable \Big{\{}\sup_{0\leq s\leq\bar{s},\ 0\leq z\leq\bar{z}}\widetilde{M}^{N}\big{(}(0,s]\times(0,z]\big{)},\ N\geq 1\Big{\}} is tight. This implies immediately that the finite-dimensional marginals are tight. In other words, for all the sequence
\Big{\{}\widetilde{M}^{N}\big{(}A_{1}\big{)},...,\widetilde{M}^{N}\big{(}A_{k}\big{)},\ N\geq 1\Big{\}} is tight, with for Hence at least along a subsequence (but we do not distinguish between the notation for the subsequence and for the sequence),
[TABLE]
Now we want to identify the limit To this end, let us first state a basic result on point process, which will be useful in the sequel.
Lemma 4.45
Assume that there exist a filtration such that, for the processes are point processes and are real non negative satisfying: is a -martingale and is also a point process. Then for the processes are mutually independent Poisson processes, with respective intensities
Proof. It is enough to show that for any for all
[TABLE]
In the following calculation, we will exploit the fact that never jump at the same time, which follows from the fact that is a point process.
[TABLE]
Hence
[TABLE]
Consequently
[TABLE]
The desired result follows.
4.43. Now, from the convergence of finite-dimensional marginals, we deduce that for any
[TABLE]
Let us define \widehat{\mathcal{M}}^{N}(s)=\left(\begin{array}[]{ccc}&\widetilde{M}^{N}\big{(}(0,s]\times(0,z_{1}]\big{)}&\\ &\cdot&\\ &\cdot&\\ &\cdot&\\ &\widetilde{M}^{N}\big{(}(0,s]\times(z_{k-1},z_{k}]\big{)}&\end{array}\right).
Note that [resp. \widetilde{M}^{N}\big{(}(0,s]\times(0,z_{k}]\big{)}] is a point process with value in (resp. ). However, let For let and let be a sequence of function whose support is included in It is easily seen that
[TABLE]
is a martingale (see e.g. chap 6 in [7]). It is also plain that
[TABLE]
It follows from Proposition 4.4, Lemma 4.27 and (4.2) that
[TABLE]
Now let be the filtration defined by
[TABLE]
Hence, it is easy to check that for any \Pi\big{(}(0,s]\times(z_{i-1},z_{i}]\big{)}-s\mu(z_{i-1},z_{i}] is a -martingale. Moreover, \left\{\Pi\big{(}(0,s]\times(z_{i-1},z_{i}]\big{)}\right\}_{2\leq i\leq k} are point processes and \Pi\big{(}(0,s]\times(z_{1},z_{k}]\big{)} is also a point process. We deduce from Lemma 4.45 that for the processes \Pi\big{(}(0,s]\times(z_{i-1},z_{i}]\big{)} are mutually independent Poisson processes, with respective intensities Summarizing, we obtain that is a point process on such that for any \Pi\big{(}(0,s]\times(z_{1},z_{2}]\big{)},...,\Pi\big{(}(0,s]\times(z_{k-1},z_{k}]\big{)} are mutually independent Poisson process, with respective intensities Consequently, is a Poisson random measure on with mean measure
Now, it remains to show the functional convergence of To this end, combining the definition of Bickel and Wichura in [3], p. 1663 of the modulus of continuity and Corollary 4.42, we deduce that satisfy condition (10) of Corollary in [3]. Moreover, since then satisfy the same condition (10). Hence the desired result follows by combining the above results with Corollary in [3].
Corollary 4.46
We have moreover
[TABLE]
as Where is a standard brownian motion independent of the Poisson random measure .
Proof. The fact that the vector converges weakly along a subsequence follows from tightness. We have identified the limit of the first (resp. of the second) coordinate in Lemma 4.29 (resp. in Proposition 4.43). The fact that the two components of the limit are independent follows from an easy extension of Lemma 4.45. Finally the whole sequence converges, since the limit is unique.
Recall (2.7). We have
[TABLE]
where
[TABLE]
Let be the Lévy process defined by
[TABLE]
Let be the height process associated to the Lévy process . In other words, is given by
[TABLE]
We first prove
Lemma 4.47
As , in mean square, locally uniformly with respect to .
Proof. It is plain that
[TABLE]
where we have used Doob’s inequality. The result follows.
We shall need below
Proposition 4.48
For any , in probability, locally uniformly in .
Proof. From Lemma 4.47 follows that
[TABLE]
in mean square, locally uniformly in . We now consider the last term in (4.87) and prove pointwise convergence. We first notice that
[TABLE]
From an adaptation of the argument of Lemma 4.32, we deduce that
[TABLE]
We deduce from Lemma 4.47 that
[TABLE]
The desired result follows from the dominated convergence theorem.
From (4.81), we have
[TABLE]
Let us now rewrite (4.83) in the form
[TABLE]
with
[TABLE]
and
[TABLE]
By combining Corollary 4.16 with Lemma 4.30, we have prove
Lemma 4.49
As
Let us define
[TABLE]
[TABLE]
and
[TABLE]
We first prove
Lemma 4.50
For any , as ,
[TABLE]
Proof. From the proof of Lemma 4.30, we have
[TABLE]
where
[TABLE]
Hence using Jensen’s and Doob’s inequalities, it is plain that
[TABLE]
The first assertion follows easily from Proposition (4.4). However, from the proof of Lemma 4.15, we can prove similarly the second assertion.
We need to prove
Lemma 4.51
For any , as ,
[TABLE]
Proof. We have
[TABLE]
The result now follows by combining the above arguments with Lemmas 4.49 and 4.50.
We shall need
Lemma 4.52
For any , there exists a function such that as and
[TABLE]
Proof. It is plain that
[TABLE]
It follows that
[TABLE]
The desired result follows by combining this with Lemma 4.51.
We prove the
Lemma 4.53
For any , there exists a function such that as and
[TABLE]
Proof. We first note that, whenever (resp. ) hits [math], the last term in the corresponding formula (4.88) for (resp. (4.89) for ) equals zero, so that at each time where (resp. ) increases,
[TABLE]
The result will follow from Lemma 4.52, and the fact that as ,
[TABLE]
We will establish only the second statement. At each time when hits zero, makes a jump of size , which is the increase in . However, when hits zero, continues to go down to a negative value which, due to the properties of the Poisson processes, has an exponential law with the parameter , where
[TABLE]
Consequently, each visit of to zero yields an increase in which is an exponential random variable with the parameter . The r.v.’s corresponding to successive visits of to zero are mutually independent. The number of those up to time is of the order of , since of . Hence it follows from a martingale argument that, if denote mutually independent Exp() random variables,
[TABLE]
as , uniformly w.r.t. .
We have also
Proposition 4.54
For any , there exists a function such that as and
[TABLE]
Proof. We now consider the last term in (4.89) and prove pointwise convergence. We first notice that
[TABLE]
For the rest of this proof, we set
[TABLE]
From an adaptation of the argument of Lemma 4.32, we deduce that
[TABLE]
We deduce from Lemma 4.53 that
[TABLE]
The desired result follows from the dominated convergence theorem.
We can establish
Lemma 4.55
For all , in as
Proof. We first notice that in this situation is a finite measure. We can rewrite (resp. ), where (resp. ) are stopping times. Let us rewrite (4.87) (resp. (4.89)) in the form
[TABLE]
resp.
[TABLE]
Until the first jump, we have exactly the same situation as that in Dramé et all in [10], Proposition 4.40. So in particular . From the first jump , the process is reflected above the level until the local time associated with this level accumulated from time reaches the level . Again the approximate equation is the same as in [10], with the level [math] moved to the level . The proof follows the same reasoning. The proof of the lemma follows by repeating this same argument.
We are now ready to state the main result.
Theorem 4.56
As ,
[TABLE]
as , where is the unique weak solution of the SDE
[TABLE]
where was defined in (2.6).
Proof. We only prove that , in order to simplify our notations. The proof for the pair follows the exact same reasoning. It follows from tightness that along a subsequence,
[TABLE]
as All we want to show is that . This will follow from a combination of Proposition 4.48, Proposition 4.54 and Lemma 4.55. Indeed, from Proposition 4.54, for any , we can choose and such that for all , ,
[TABLE]
Consequently, if satisfies , it follows from Lemma 4.55
[TABLE]
Consequently, whenever ,
[TABLE]
Hence Proposition 4.48,
Remark 4.57
From our convergence results, we can as in [25] deduce the well known second Ray-Knight theorem, in the subcritical and critical cases (i.e
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Aldous, D. Stopping times and tightness. The Annals of Probability , 6(2):335–340, 1978.
- 2[2] Athreya, K. B. and Ney, P. E. Branching processes. Springer- Verlag, New York, 1972.
- 3[3] Bickel, P. J. and Wichura, M. J. Convergence criteria for multiparameter stochastic processes and some applications. The Annals of Mathematical Statistics , pages 1656–1670, 1971.
- 4[4] Billingsley, P. (1999). Convergence of Probability Measures, 2nd edn John Wiley, New York.
- 5[5] Bertoin, J. Lévy processes, Cambridge University Press, 1996.
- 6[6] Caballero, M. E., Lambert, A. and Bravo, G. U. Proof(s) of the Lamperti representation of continuous-state branching processes. Probability Surveys , 6:62–89, 2009.
- 7[7] Çınlar, E. Probability and stochastics , volume 261. Springer Science & Business Media, 2011.
- 8[8] Cont, R. and Tankov, P. Financial modelling with jump processes , volume 2. CRC press, 2004.
