A growth-fragmentation model related to Ornstein-Uhlenbeck type processes
Quan Shi

TL;DR
This paper introduces a new growth-fragmentation model linked to Lévy-driven Ornstein-Uhlenbeck processes, generalizing previous models and establishing convergence and law of large numbers.
Contribution
It presents a novel growth-fragmentation framework related to Ornstein-Uhlenbeck processes, extending prior models and providing convergence and probabilistic laws.
Findings
Established a convergence criterion for the new growth-fragmentation models.
Proved a law of large numbers under certain conditions.
Generalized compensated fragmentation processes.
Abstract
Growth-fragmentation processes describe systems of particles in which each particle may grow larger or smaller, and divide into smaller ones as time proceeds. Unlike previous studies, which have focused mainly on the self-similar case, we introduce a new type of growth-fragmentation which is closely related to L\'evy driven Ornstein-Uhlenbeck type processes. Our model can be viewed as a generalization of compensated fragmentation processes introduced by Bertoin, or the stochastic counterpart of a family of growth-fragmentation equations. We establish a convergence criterion for a sequence of such growth-fragmentations. We also prove that, under certain conditions, this system fulfills a law of large numbers.
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.
A growth-fragmentation model related to Ornstein-Uhlenbeck type processes
Quan Shilabel=e1][email protected] [ University of Oxford, Oxford, OX1 3LB, UK.
University of Oxford
Abstract
Growth-fragmentation processes describe systems of particles in which each particle may grow larger or smaller, and divide into smaller ones as time proceeds. Unlike previous studies, which have focused mainly on the self-similar case, we introduce a new type of growth-fragmentation which is closely related to Lévy driven Ornstein-Uhlenbeck type processes. Our model can be viewed as a generalization of compensated fragmentation processes introduced by Bertoin, or the stochastic counterpart of a family of growth-fragmentation equations. We establish a convergence criterion for a sequence of such growth-fragmentations. We also prove that, under certain conditions, this system fulfills a law of large numbers.
Abstract
[language=french] Les processus de croissance-fragmentation étudient l’évolution au cours du temps de systèmes de particules, dans lesquels la taille de chaque particule peut croître et décroître, les particules pouvant parfois se fragmenter. Contrairement aux études précédentes, qui se sont concentrées principalement sur les cas auto-similaires, nous introduisons un nouveau modèle qui est associé aux processus d’Ornstein-Uhlenbeck liés aux processus de Lévy. Notre modèle peut être vu comme une généralisation des processus de fragmentation compensés introduits par Bertoin, ou la contrepartie stochastique d’une famille d’équations de croissance-fragmentation. Nous établissons un critère de convergence pour une suite de telles croissance-fragmentations, et une loi des grands nombres dans un cas particulier.
growth-fragmentation,
Ornstein-Uhlenbeck type process,
branching particle system,
law of large numbers,
keywords:
[class=MSC] 60G51, 60J80
keywords:
\arxiv
arXiv:1702.01091 \startlocaldefs
\endlocaldefs
1 Introduction
Fragmentation processes describe the evolution of particle systems in which each particle may split randomly into smaller ones as time passes, independently of the others; see [9] for a comprehensive overview. Recently, Bertoin [10, 11] extended fragmentations to growth-fragmentation processes, by allowing the size of each particle to increase or decrease gradually. In both (pure) fragmentations and growth-fragmentations, previous research has mainly focused on the self-similar case, which means that the particle system behaves in the same way when viewed at different scales on space and time.
In the present work, we propose a new type of growth-fragmentation that possesses a different scaling property, to be given shortly. We name it an Ornstein-Uhlenbeck (OU) type growth-fragmentation process. Informally speaking, our model describes a particle system in which the mass of each particle evolves according to the exponential of an OU type process driven by a Lévy process :
[TABLE]
where and the integral is defined in the sense of a stochastic integral, as the Lévy process is a semimartingale. If is a Brownian motion, then is a well-known Gaussian OU process. Furthermore, each particle splits randomly into smaller ones according to a dislocation measure , which is a sigma-finite measure on the mass-partition space
[TABLE]
that satisfies
[TABLE]
For every , a particle with mass splits at rate into a sequence of particles with masses . Each child fragment continues to evolve in a similar way, independently of the others. For , let
[TABLE]
denote the decreasing sequence of the masses of particles alive at time . Then \mathbf{X}:=\Big{(}\mathbf{X}(t),t\geq 0\Big{)} is an OU type growth-fragmentation process. The precise definition of our model is given in Section 3.1.
Let be the space of decreasing null sequences (that converge to [math]), endowed with the -norm. We prove that our process is a -valued Markov process which possesses a càdlàg version, and moreover satisfies the following two properties. For every , let denote the law of with initial value .
- (P1)
(Branching property) For every sequence , the process starting from has the same law as the union of the elements, arranged in decreasing order, of a family of independent OU type growth-fragmentations , where each has distribution . 2. (P2)
(OU property) With being the index appeared in (1.1), for every , the distribution of the rescaled process under is .
The branching property indicates that the fragments evolve independently from one another. The OU property is due to the scaling property of the exponential of an OU type process (a direct consequence of (1.1)). For comparison, note that a self-similar growth-fragmentation (including the case of pure fragmentations) fulfills the same branching property, but a different scaling property: for a certain index , the rescaled process under is ; see [11, Theorem 2] and [7, Definition 2]. The special case of our model coincides with homogeneous growth-fragmentations (self-similar with ).
Our model is partially motivated by [6] (see also a related work [36]), results in which imply that a certain OU type growth-fragmentation naturally arises in dynamical percolation on an infinite recursive tree; see Section 5 for details. Besides this motivation, our model may have potential applications, as OU type processes are widely applied in various domains: in biology, they are used in a neuronal model with signal-dependent noise [32]; in finance, they are used in an option price model with stochastic volatility [4, 5], to name just a few.
Since the dislocation measure is allowed to be infinite, branching events can occur with an infinite intensity. Due to this fact, the construction of our model is subtle. Our approach relies on a truncation procedure introduced by Bertoin [10] to build homogeneous growth-fragmentations (which he called compensated fragmentation processes). Specifically, if we discard the small (in size at birth relative to their parent) fragments, then the truncated process has a finite branching rate, which can be easily built with a genealogical structure. We finally re-incorporate the small fragments by considering the increasing limit. The technical difficulty in adopting this approach is that one needs to check that such a growth-fragmentation does not locally explode, that is, for every , only a finite number of fragments have size greater than at every time. This is justified by Theorem 3.1, which relies crucially on the integrability assumption (1.3). See [16] for a related construction of binary self-similar growth-fragmentations.
It is sometimes more convenient to work with the logarithmic transform of a growth-fragmentation. After logarithmic transformation, homogeneous (pure) fragmentations can be viewed as continuous time branching random walks [15], and homogeneous growth-fragmentations are related with branching Lévy processes [10]. In line with these observations, we first introduce an OU type branching Markov process (Definition 2.2), which is similar to a branching random walk, but with a spatial motion given by an OU type process. An OU type growth-fragmentation process is just the exponential of an OU type branching Markov process. Both the truncation procedure and the non-explosion property mentioned above are established for OU type branching Markov processes in Section 2.
We obtain two major results. We first prove (Theorem 3.12) the convergence of a sequence of OU type growth-fragmentations when their characteristics converge in some sense. This conclusion generalizes [10, Theorem 2]. The other result (Corollary 3.21) concerns the long-time asymptotic behavior of OU type growth-fragmentations. Roughly speaking, we show, for a particular case, that the (random) empirical measure of particle sizes converges in probability to a deterministic measure. This law of large numbers should be compared with the limit theorems for self-similar fragmentations and growth-fragmentations [13, 22], as well as the law of large numbers in the context of branching Gaussian OU processes [1] and branching diffusions [26].
We also find (Proposition 4.6) that OU type growth-fragmentations bear a connection with Bertoin’s Markovian growth-fragmentations [11] and (Proposition 3.11) that they are the stochastic counterparts of a family of (deterministic) growth-fragmentation equations; see [17, 23, 24, 35] for related works on the latter topic.
The paper is organized as follows. Section 2 introduces OU type branching Markov processes. Section 3 studies OU type growth-fragmentations in depth. After giving the construction in Section 3.1, we present a many-to-one formula and related growth-fragmentation equations in Section 3.2, establish a convergence criterion for a sequence of OU type growth-fragmentations in Section 3.3, and prove a law of large numbers in Section 3.4. Section 4 draws connections to Markovian growth-fragmentations [11]. Finally, Section 5 offers a remarkable example related to a destruction process of infinite random recursive tree [6].
2 OU type branching Markov processes
In this section, we first recall some background on OU type processes, and then introduce OU type branching Markov processes.
2.1 Preliminaries: Ornstein-Uhlenbeck type processes
Let us present some elementary background on Ornstein-Uhlenbeck (OU) type processes driven by Lévy processes; see [2] or [38, Section 17]. We also refer to [8] for properties of Lévy processes. Implicitly, throughout this work we only consider OU type processes without positive jumps.
Let be a Lévy process without positive jumps, possibly killed, which is often referred to as a spectrally negative Lévy process. It is characterized by its Laplace exponent such that
[TABLE]
The function is continuous and convex on . Furthermore, it is given by the Lévy-Khintchine formula
[TABLE]
where , , , and the Lévy measure on satisfies
[TABLE]
We say that has characteristics . In the Lévy-Khintchine formula, we can also replace in the integral by , as often in the literature, then we need to change the drift coefficient .
Let , we next define an Ornstein-Uhlenbeck (OU) type process with characteristics or simply , starting from , by
[TABLE]
By convention, if is killed at time , then for every . When , is called an inward OU type process; respectively, while , is called an outward OU type process. Note that in the literature, OU type processes often only refer to the inward case (). Furthermore, it is well-known ([38, equation (17.2) and Lemma 17.1]) that is the pathwise unique solution of the stochastic integral equation
[TABLE]
and that there is
[TABLE]
The next observation follows plainly from (2.3).
Lemma 2.1**.**
If and are independent OU type processes with respective characteristics and , then is an OU type process with characteristics .
Under certain conditions, an inward OU type process converges in distribution to its invariant probability distribution.
Lemma 2.2** ([38, Theorem 17.5 and 17.11]).**
If and satisfies
[TABLE]
then the OU type process possesses a unique invariant probability distribution , which is a probability measure on with Laplace transform
[TABLE]
Moreover, for every bounded and continuous function there is
[TABLE]
If (2.5) does not hold, then does not have any invariant probability distribution.
We remark that the invariant probability distribution is self-decomposable, which means that if a random variable has law , then for every constant , there exists an independent random variable , such that . Conversely, every self-decomposable measure is the invariant probability distribution of a certain OU type process (with possibly positive jumps). See [38, Definition 15.1 and Theorem 17.5] for details.
2.2 OU type branching Markov processes with finite birth-intensity
With convention , introduce the space
[TABLE]
Let be a sigma-finite measure on that satisfies
[TABLE]
Define , with convention , and
[TABLE]
Then (2.6) ensures that the image of the restriction , via the map from to , is a Lévy measure (that satisfies (2.2)), which shall be denoted by .
Informally speaking, an OU type branching Markov process describes the positions of the atoms in the following system. Initially, there is a single atom at the origin. This atom evolves according to a certain OU type process whose Lévy measure is . The branching mechanism is given by . Specifically, a particle at any position splits into two or more particles at with rate , and for every , the child born at position evolves according to the law of (with starting point ), independently of the others. Each child particles continues to branch in a similar way. Recall from the introduction that such processes are tailored for the purpose to study growth-fragmentations; note that the space is obtained by the logarithmic transform from the mass-partition space defined in (1.2), and (2.6) is in line with (1.3).
If we also suppose that
[TABLE]
then the OU type branching Markov process is said to have finite birth-intensity, and can be constructed as a marked Ulam-Harris tree , with and by convention. An element is a finite sequence of natural numbers , where stands for the generation of . Write for her mother and for her -th daughter with . The following construction is similar to that of a branching Lévy process [10, Definition 1]. Notice that combining (2.6) and (2.7) yields
[TABLE]
Definition 2.1**.**
Let , , , and be a sigma-finite measure in such that (2.6) and (2.7) hold. Consider three independent families , and :
- •
is a family of i.i.d. exponential variables with parameter .
- •
is a family of i.i.d. OU type processes, starting from , with characteristics , where
[TABLE]
- •
is a family of i.i.d. sequences, each sequence being distributed according to the conditional probability .
With initial values and , we define recursively
[TABLE]
For every the triple stands for the position at birth, the birth time and the lifetime respectively of the particle indexed by . Note that if , then by convention , which means that the atom (as well as its descendants) is not taken into account. This particle moves according to , which has the law of with by (2.3). Then the positions of the particles alive at time form a multiset (that allows multiple instances of its elements)
[TABLE]
The process is called an OU type branching Markov process with (finite birth-intensity and) characteristics .
Remark 2.1*.*
One can view a multiset as a point measure , where stands for the Dirac mass.
The term in (2.8), which is an analogue of the compensation term in the Lévy-Khintchine formula (2.1), is used to compensate for the negative jumps in the branching events induced by . We place it there for the following purposes. First, this is consistent with [10, Definition 1]. So for the case , an OU type branching Markov process with characteristics is a branching Lévy process with characteristics . Second, this induces an important embedding property that we shall now present. For each , we cut an OU type branching Markov process with characteristics at level , by keeping at each dislocation the child particle which is the closest to the parent, and by suppressing the other child particles if and only if its distance to the position of the parent at death is larger than or equal to . Let be the set of individuals that are killed by this cutting operation, so if and only if
[TABLE]
For every , set
[TABLE]
Then for every , we define
[TABLE]
Let be the image of by the map .
Lemma 2.3** (Key embedding property).**
The truncated process
[TABLE]
is an OU type branching Markov process with characteristics .
It is not difficult to prove Lemma 2.3 by using similar arguments to those of an analogous result [10, Lemma 3] for branching Lévy processes. We include the proof of Lemma 2.3 in Appendix A for the sake of completeness.
For the particular case with , at each branching event we only keep the closest child, and discard all the others. Therefore, at each time there remains at most one particle, called the selected atom. With notation of Definition 2.1, the position of the selected atom is given by
[TABLE]
where for every .
Lemma 2.4**.**
The position of the selected atom is an OU type process with characteristics , where
[TABLE]
The proof of Lemma 2.4 is deferred to Appendix A. Let us now introduce the cumulant , which will play an important role in this work:
[TABLE]
where is as in (2.11). If (2.6) and (2.7) hold, then is finite and continuous.
Lemma 2.5**.**
Let be an OU type branching Markov process with characteristics and suppose that (2.7) holds. Then for every and , we have
[TABLE]
Proof.
With notation in Definition 2.1, write for the lifetime of the ancestor and for the sequence of positions of the first generation at birth. Consider the sub-population generated by the particle , i.e.
[TABLE]
Conditionally on , we deduce by (2.3) and Definition 2.1 that the sequence of processes \big{(}\mathcal{Z}^{i},i\in\mathbb{N}\big{)} are independent, and each has the same law as the process . Let . The decomposition at yields
[TABLE]
Changing variable in the integral by , we have
[TABLE]
Solving this integral equation yields the desired identity. ∎
2.3 OU type branching Markov processes
We next relax the finite birth-intensity assumption (2.7), only suppose that (2.6) holds, and define OU type branching Markov processes in this more general setting. Along the lines of [10, Definition 2], our approach relies on the key embedding property, Lemma 2.3. Specifically, for every , write for the image of by the map , then we have
[TABLE]
Appealing to this fact and (2.6), we hence deduce that (2.7) holds for :
[TABLE]
By Lemma 2.3 and Kolmogorov’s extension theorem, we can build a family of processes on the same probability space, which we still denote by , such that each is an OU type branching Markov process with characteristics , and
[TABLE]
where denotes the process obtained by cutting at level .
Definition 2.2**.**
Suppose that (2.6) holds. In the notation above, we define
[TABLE]
where means the union of multisets. Then is called an OU type branching Markov process with characteristics . For every , we refer to as the truncated process at level .
Remark 2.2*.*
Unlike the finite birth-intensity case, the branching OU type process with infinite birth-intensity does not possess an obvious genealogical structure. Nevertheless, one should be able to build a genealogical structure by using the approach in [40] or [14].
The next statement proves that there is no (local-)explosion, that is, for every and every time , only a finite number of the elements of are larger than . Let us still define as in (2.12), but when , can possibly take the value ; in fact, we observe that, under (2.6),
[TABLE]
This infers that is a right-unbounded interval. As for , condition (2.6) ensures that . Besides, is continuous and convex in .
Theorem 2.6**.**
Let and suppose that . Then for every and , we have
[TABLE]
Proof.
For every , recall that the truncated process with characteristics has cumulant
[TABLE]
Since fulfills (2.6), both (2.6) and (2.7) hold for . Then Lemma 2.5 yields
[TABLE]
Letting , it is plain that for every , there is and . We hence deduce the claim by monotone convergence. ∎
Remark 2.3*.*
The OU type branching Markov processes built here are tailored to make connections with growth-fragmentations. The same construction would be equally applicable for a more general setting: an atom could move according to any Markov process (with possibly positive jumps), and could be a measure on the space of all point measures on . The crucial point is to find a non-explosion condition, which should be a proper intergrable condition similar to (2.6); see also [14, Equation (1.3)] and [11, Theorem 2] for non-explosion conditions in various circumstances.
3 OU type growth-fragmentation processes
3.1 The model and its basic properties
We are now ready to define OU type growth-fragmentation processes. Let , , and be a sigma-finite measure on the space of mass-partitions , fulfilling (1.3). Write for the image of by the map , then is a sigma-finite measure on , and (1.3) ensures that satisfies (2.6). Hence we are allowed to construct by Definition 2.2 an OU type branching Markov process with characteristics . Recall that is the space of all decreasing null sequences endowed with the -distance, i.e. for and . Theorem 2.6 enables us to give the following definition.
Definition 3.1**.**
For every , the elements of can be rearranged in a decreasing null sequence
[TABLE]
The process is called an OU type growth-fragmentation process with characteristics .
Roughly speaking, describes the fluctuations of the size, the constant represents the deterministic dilation (resp. erosion) coefficient when (resp. ). The measure is called the dislocation measure. For every , a fragment of size splits into a sequence of fragments at rate . The constant characterizes the speed at which the size of a fragment evolves towards (when ) or away from (when ) the value (as the central location of an OU type process is [math]).
Remark 3.1*.*
In the following, an OU type growth-fragmentation is always assumed (without loss of generality) to start from one fragment of unit size, i.e. , unless otherwise specified.
Remark 3.2*.*
When , an OU type growth-fragmentation with characteristics is a compensated fragmentation with characteristics in the sense of [10, Definition 3]. To avoid duplication, this case will be implicitly excluded hereafter.
Theorem 2.6 can be easily transferred to OU type growth-fragmentations. Correspondingly, the cumulant of is given by
[TABLE]
By the discussion before Theorem 2.6, as (1.3) holds, we still have that is a right-unbounded interval containing , and that is convex and continuous on .
Theorem 3.1**.**
For every , and , we have
[TABLE]
Proof.
It follows directly from Theorem 2.6. ∎
For every , we refer to the exponential of the truncated process (rearranged in decreasing order) as the truncated OU type growth-fragmentation . When , in the truncated system there is at most one fragment at any time, called the selected fragment of ; however, it is not necessarily the largest one in the system.
Lemma 3.2** (Selected fragment).**
The size of the selected fragment is the exponential of an OU type process with characteristics , where
[TABLE]
Proof.
The law of is given by Lemma 2.4. ∎
With the help of Theorem 3.1, we shall establish some fundamental properties of in the rest of this subsection. We first prove that is a time-homogeneous Markov process. In this direction, let us define a family of probability measures. Specifically, let and , where denotes the space of decreasing null sequences with finite -norm, i.e. . Let be a sequence of i.i.d. copies of . We have for every and that
[TABLE]
so the elements (repeated according to their multiplicity) of can be rearranged in decreasing order. Write for the law of the resulting process on .
Proposition 3.3** (Markov property).**
For every , conditionally on , the process on has distribution .
This statement clearly ensures that fulfills the properties (P1) and (P2) in the introduction.
Proof.
We first derive from Theorem 3.1 that . Since always holds, the law is indeed well-defined.
For every , consider the truncated OU type growth-fragmentation . It is plain from Definition 2.1 that fulfills the claimed Markov property. This observation and Theorem 3.1 entail that the Markov property also holds for . See [11, proof of Proposition 2] for similar arguments and we omit the details. ∎
Remark 3.3*.*
It would be interesting to characterize all càdlàg -valued processes that possess properties (P1) and (P2). It is intuitive to guess that all such processes are the exponential of OU type branching Markov processes (with possibly positive jumps and general offspring distribution as discussed in Remark 2.3). For the homogeneous case , this has been confirmed by [14]. However, the extension of this result to the general case is beyond the scope of this paper and will be taken up separately.
We next obtain the following non-negative martingales, which should be compared with the well-known additive martingales in the context of (pure) fragmentations [15] or branching random walks [19].
Proposition 3.4** (Additive martingales).**
Let be an OU type growth-fragmentation with cumulant and starting point .
- (i)
If , then for every , the process
[TABLE] 2. (ii)
If , then for every , the process
[TABLE]
Proof.
We deduce from Theorem 3.1 and Proposition 3.3 that both processes have a constant mean value, which is . Then the martingale property follows from Proposition 3.3. ∎
Remark 3.4*.*
The (non-negative) additive martingale induces a natural change of measures. Using the methods developed in [40], this would enable us to develop the spinal techniques introduced in the seminal work [34], which are important tools in the study of branching processes. A potential application is to determine whether the limit of the additive martingale is degenerate, for example. Note that to define a spine, we also need a genealogical structure (see Remark 2.2).
Proposition 3.5** (Feller-type property).**
Let and suppose that a sequence in . Then for every , there is the weak convergence
[TABLE]
in the sense of finite dimensional distributions on for every .
Proof.
The idea is from the proof of [10, Corollary 2], but different estimations are needed for our case. Consider a sequence of i.i.d. copies of . As . It follows from Theorem 3.1 that
[TABLE]
If , as the function is concave, then for every there is
[TABLE]
We next consider the case . Since in , we may assume that for every , there is for every , so . Therefore, with a constant , we have
[TABLE]
Combining these observations and that in , we deduce from (3.3) that
[TABLE]
Write and for the decreasing rearrangements of two sequences and in . As the function is convex for , it follows from [33, Theorem 3.5] that . As a consequence, there is
[TABLE]
which leads to
[TABLE]
From the description of and , we deduce the Feller-type property. ∎
We finally establish the sample path regularity.
Proposition 3.6** (Càdlàg path).**
Let , and . Then the process possesses a càdlàg version in . Thus, the non-stopped process possesses a càdlàg version in .
Proof.
We follow the same arguments as in [10, proof of Proposition 2]. For every , let be the truncated OU type branching Markov process and be its associated growth-fragmentation, then it follows plainly from the construction that is almost surely càdlàg in . Therefore, to complete the proof, it suffices to prove that
[TABLE]
Recall that the operation of rearranging two sequences of positive numbers in the decreasing order decreases their -distance, we can easily deduce the following inequality (see [10, Lemma 4] for details):
[TABLE]
By this inequality and the fact that , we deduce that
[TABLE]
where M(t):=\exp\big{(}-\int_{0}^{t}\kappa(q\mathrm{e}^{-\theta r})\mathrm{d}r\big{)}\|\mathbf{X}(t)\|_{\ell^{q}}^{q}, M^{(\ell)}(t):=\exp\big{(}-\int_{0}^{t}\kappa^{(\ell)}(q\mathrm{e}^{-\theta r})\mathrm{d}r\big{)}\|\mathbf{X}^{(\ell)}(t)\|_{\ell^{q}}^{q}, A:=\sup_{0\leq t\leq T}\exp\Big{(}\int_{0}^{t}\kappa(q\mathrm{e}^{-\theta r})\mathrm{d}r\Big{)} is a finite constant, and
[TABLE]
We know by monotone convergence that . Since , it follows from Theorem 3.1 that . Then by dominated convergence we have
[TABLE]
Since it follows from Proposition 3.4 that and are both martingales, using Doob’s inequality leads to (3.4). We have completed the proof. ∎
Remark 3.5*.*
As a consequence of the Feller-type property and the càdlàg path, we deduce that fulfills the strong Markov property by a standard argument (approximate a general stopping time by a decreasing sequence of simple stopping times, and the Markov property holds for simple stopping times).
3.2 Many-to-one formula and growth-fragmentation equations
Let and be an OU type growth-fragmentation process on with characteristics , starting from . For every , define a measure on , such that for every (the space of -functions on with compact support), the identity holds:
[TABLE]
Informally speaking, is the “mean value” of .
In this subsection we study the evolution of as time proceeds. We first aim at expressing in term of the transition kernel of a certain Markov process. This idea is often referred to as a many-to-one formula in the literature, and it has been widely used in the study of branching type processes; see e.g. [41] for branching random walks and [12, Theorem 3.5] for self-similar growth-fragmentations. We shall treat the inward () and outward () cases separately. For the inward case, we need a certain time-inhomogeneous affine Markov process . We refer to [25, 27] for a general study of the latter. To describe the process , let us record the following observation, which extends [17, Lemma 3.1].
Lemma 3.7**.**
For every , there exists a spectrally negative Lévy process with Laplace exponent
[TABLE]
Specifically, the Lévy process has characteristics , where
[TABLE]
and the Lévy measure on is defined such that for every bounded measurable function on there is the identity
[TABLE]
We omit the proof, which is straightforward.
Lemma 3.8**.**
Suppose that . Then for every , there exists a unique time-inhomogeneous affine process (that depends on ) with state space , whose transition kernel is determined by the Laplace transform
[TABLE]
where and \phi(t,T,q):=\int_{t}^{T}\Big{(}\kappa(q\mathrm{e}^{-\theta(T-r)}+\alpha\mathrm{e}^{\theta r})-\kappa(\alpha\mathrm{e}^{\theta r})\Big{)}\mathrm{d}r. The associated time-homogeneous process is a Feller process with infinitesimal generator . Furthermore, every -function on with compact support belongs to the domain of , and we have
[TABLE]
where and are as in Lemma 3.7.
Proof.
With notation of [27, Definition 2.5], let , , , , , , be a null measure, and .111For consistency, here we still use as the truncation function; though it is not the same as the one used in [27], all the results therein still hold, up to a modification of the drift coefficient . We can easily check that these parameters are strongly admissible in the sense of [27, Definition 2.5], and obtain the following functions define by [27, Equations (2.16)–(2.18)]:
[TABLE]
where we have used Lemma 3.7 to get . Then it follows from [27, Theorem 2.13] that there exists a unique strongly regular affine Markov process associated with these parameters, and that has the transition kernel and the infinitesimal generator as in the statement. We complete the proof. ∎
Proposition 3.9** (Many-to-one formula for the inward case).**
Suppose that . Let , be the time-inhomogeneous affine process given as in Lemma 3.8, and be the transition kernel of the process . Then for every and , there is the identity
[TABLE]
Proof.
Define a measure by , then we deduce from Theorem 3.1 that
[TABLE]
By Lemma 3.8, we know that and are the same probability measure. Then the claim follows. ∎
For the outward case with , since we cannot guarantee to be finite for all , the process as in Lemma 3.8 is not well-defined in general. However, for any finite time period we can obtain a similar many-to-one formula.
Proposition 3.10** (Many-to-one formula for the outward case).**
Let and . Suppose that and . Then there exists a unique time-inhomogeneous affine Markov process on with infinitesimal generator : for every -function on with compact support,
[TABLE]
The transition kernel of its exponential is given by
[TABLE]
Besides, for every and , there is the identity
[TABLE]
Proof.
Recall that includes a right-unbounded interval, then infers that . Therefore, with notation of [27, Definition 2.5], we can define , , , , , , to be a null measure, and . In other words, these are defined in the same way as in the inward case for , and moreover extended to by a simple continuous extension. Due to the continuity, it follows again from [27, Theorem 2.13] that, there exists a unique strongly regular affine Markov process associated with these parameters, such that has the desired generator and has the desired transition kernel. Then we easily derive the many-to-one formula by the same arguments as in the inward case. ∎
Remark 3.6*.*
If , then the affine process in the many-to-one formula is just an OU type process with characteristics , where .
Using the many-to-one formula, we next describe by a growth-fragmentation equation. See [17] and [12, Corollary 3.12] for analogous results for self-similar growth-fragmentations.
Proposition 3.11** (Growth-fragmentation equation).**
For every , the family of Radon measures , given by (3.6), is the unique solution to the growth-fragmentation equation
[TABLE]
where
[TABLE]
Proof.
We only prove it for the outward case ; for the inward case the arguments are very similar. Throughout the proof, let and with . Let be as in Proposition 3.10, with transition kernel and generator .
Let us first prove the uniqueness of the solution. For every , suppose that is a solution to (3.7). For every , define a measure on as follows: if , then is the image via of the measure
[TABLE]
otherwise, we simply write . Then, for every and -function on with compact support, we can check the identity (see Appendix B for details)
[TABLE]
By the uniqueness of the affine process [27, Theorem 2.13], we identify . This infers that, at any time , all the solutions to (3.7) have the same value. The arbitrariness of leads to the uniqueness for all time.
We now check that is a solution to (3.7). For every function , similar to (3.9) we find the identity
[TABLE]
where . Appealing to Proposition 3.10 ends the proof. ∎
3.3 Convergence of OU type growth-fragmentations
For every , let be an OU type growth-fragmentation with characteristics starting from and be its cumulant. We establish the following convergence result.
Theorem 3.12**.**
Suppose that
[TABLE]
that
[TABLE]
that
[TABLE]
and that there is the weak convergence of finite measures on
[TABLE]
Write , then for every and , there is the weak convergence
[TABLE]
in the space of càdlàg functions with values in endowed with the Skorokhod topology. As a consequence, the weak convergence
[TABLE]
holds in the space of càdlàg functions with values in endowed with the Skorokhod topology.
This result generalizes Theorem 2 in [10], which deals with the case for every ; the assumptions (3.12) and (3.13) are inherited from there.222There is a typo in Theorem 2 in [10] for the condition (3.12). The condition (3.10) is a minor technical assumption that makes our arguments less cumbersome.
Remark 3.7*.*
The reason for which we consider the space with is as follows. Recall that for all , then (by Theorem 3.1) for every . We further need to enlarge the state space to with , so as to ensure that is tight in , which does not necessarily hold with . See the proof of Lemma 3.17 below for details.
Before tackling the proof of Theorem 3.12, we point out several evidences that suggest its validity. First, (3.12) and (3.13) yield the convergence of the cumulant
[TABLE]
However, this convergence does not necessarily hold for . Second, we have the convergence of the selected fragments defined as in Lemma 3.2. Indeed, one easily deduces from (3.12) and (3.13) the convergence of the Laplace exponents (3.2):
[TABLE]
Then the convergence of the selected fragments is a consequence of the following lemma.
Lemma 3.13**.**
For every , let be an OU type process with characteristics starting from . Suppose that (3.11) and (3.15) hold. Then there exists a coupling of , such that for every
[TABLE]
Proof.
Recall from (2.3) that is a stochastic integral:
[TABLE]
where is a Lévy process with Laplace exponent . We first observe that there exists a coupling of Lévy processes , such that for every
[TABLE]
see e.g. [31, Theorem 15.14 and 15.17]. Therefore, an application of [29, Theorem 5] leads to the claim, if satisfy the so-called condition UT. To check the condition UT, we shall use [30, Lemme 3.1]. Consider . Then is finite, and is a martingale. In other words, the canonical decomposition of the special semimartingale is given by
[TABLE]
The family of the variations of the processes is clearly tight, then it follows from [30, Lemme 3.1] that satisfy the condition UT. ∎
The rest of this subsection is devoted to the proof of Theorem 3.12. By Prokhorov’s theorem (see e.g. [21, Section 5]), we shall prove the weak convergence of finite dimensional distributions and the tightness. In the remaining of this subsection, we fix , and .
Convergence of finite dimensional distributions
The proof of the weak convergence of finite dimensional distributions proceeds as Lemma 7 in [10], though we overcome non–trivial difficulties which require new estimates. Consider for every and the truncated OU type growth-fragmentation . Recall that corresponds to an OU type branching Markov process with characteristics , where is the image of by the map as in (2.9).
Lemma 3.14** ([10, Lemma 6]).**
Suppose that (3.10) and (3.13) hold. Then for every , there is the weak convergence of finite measures on
[TABLE]
and
[TABLE]
These relations lead to the following convergence.
Lemma 3.15**.**
Suppose that (3.10), (3.11), (3.12) and (3.13) hold. Then for every , there exists a coupling of , such that for every and ,
[TABLE]
Proof.
Recall that in the construction of by Definition 2.1, each particle is born at time with initial position , and then moves according to an OU type process with characteristics , where is given by (2.8). After an exponential time with parameter , it splits into at most particles (see (2.13)) whose relative positions are , distributed according to . We shall prove that there exists a coupling of , such that the following sequences indexed by
[TABLE]
converges in probability as , for -distance. Then the claim follows since the rearrangement of sequences in decreasing order decreases the -distance.
For every , we may assume by Lemma 3.14 and Skorokhod representation theorem that the random variables , are coupled in such a way that
[TABLE]
and
[TABLE]
We further deduce from (3.12) and Lemma 3.14 that for every . Using Lemma 3.13 leads to
[TABLE]
Therefore, for every , we have
[TABLE]
Denote the set of vertices alive at time by . Observe that is almost surely a finite set; furthermore, it follows from (3.16) that coincides with with high probability. Summarizing, we have completed the proof. ∎
We also need the following estimation.
Lemma 3.16**.**
For every and , there is
[TABLE]
Proof.
We deduce from (3.5) and Theorem 3.1 that
[TABLE]
where K_{n}(p,t):=\exp\big{(}\int_{0}^{t}\kappa_{n}(p\mathrm{e}^{-\theta_{n}r})dr\big{)} and K^{(\ell)}_{n}(p,t):=\exp\big{(}\int_{0}^{t}\kappa^{(\ell)}_{n}(p\mathrm{e}^{-\theta_{n}r})\mathrm{d}r\big{)}. Since for every , there is
[TABLE]
we have
[TABLE]
It follows that
[TABLE]
As , we have . We also deduce from (3.13) and (3.14) that
[TABLE]
and that
[TABLE]
Then the claim follows. ∎
We are now ready the prove the weak convergence of finite-dimensional distributions.
Lemma 3.17**.**
Suppose that (3.10), (3.11), (3.12) and (3.13) hold, then Theorem 3.12 holds for finite-dimensional distributions in .
Proof.
For simplicity, we shall only establish the convergence for one-dimensional; similar arguments hold for multi-dimensional case.
We first claim that for q^{\prime}\in\big{(}2(\mathrm{e}^{\bar{\theta}T}\vee 1),q\big{)}, the set
[TABLE]
is a compact subset in . Indeed, for any sequence in , we may use the diagonal procedure to extract a subsequence that converges pointwisely, and the limit belongs to due to Fatou’s lemma. Since is equisummable in (because ), the convergence also holds for -distance. Next, it follows from Theorem 3.1 that
[TABLE]
We hence deduce from (3.18) that the sequence is tight in .
So it remains to prove the uniqueness of the limit of a converging subsequence. Let and be a continuous function. For every , write . Then is continuous on . We shall prove for every that
[TABLE]
If this holds for every and such function , then we deduce the uniqueness of the limit.
For every there is
[TABLE]
Let us estimate these three terms. Fix an arbitrarily small . By the tightness of we may choose large enough such that
[TABLE]
Note that if , then for every . So we have
[TABLE]
As is uniformly continuous on the compact subset in , there exists such that
[TABLE]
Using Lemma 3.16 and Markov inequality, we next choose large enough such that
[TABLE]
We hence deduce that
[TABLE]
By Lemma 3.15, we may further choose large enough such that . Applying the same arguments to completes the proof. ∎
Tightness
We finally complete the proof of Theorem 3.12 by checking Aldous’ tightness criterion (see e.g. Theorem 16.11 in [31]).
Lemma 3.18**.**
Let be a sequence of constants with and , and be a sequence of -stopping times with almost surely. Suppose that (3.10), (3.11), (3.12) and (3.13) hold, then we have for every with ,
[TABLE]
Proof.
Denote and
[TABLE]
An elementary inequality leads to
[TABLE]
We shall evaluate the two expected values in (3.19) respectively. Let us start with the first one. Applying the mean value theorem to the function , we obtain that
[TABLE]
Denote and , then
[TABLE]
As and , without loss of generality, we may assume that is small enough such that . Then fix such that . It is elementary to see that there exists such that for all , then we have
[TABLE]
where are constants . These constants are all greater than thanks to the choice of , so we have martingales by Proposition 3.4. As a.s., using the optional stopping theorem to these martingales yields
[TABLE]
As and (3.18) holds, this leads to
[TABLE]
We next proceed to the second term in (3.19). From the strong Markov property (see Proposition 3.3 and Remark 3.5), we have that
[TABLE]
Again, as a.s., it follows from Proposition 3.4 and the optional stopping theorem that
[TABLE]
We hence deduce from (3.18) that
[TABLE]
Write for the sequence obtained from by exchanging the selected fragment (see Lemma 3.2) and the largest one. Rearranging sequences in decreasing order reduces the -distance, so
[TABLE]
Furthermore, it follows from Lemma 3.2 and Theorem 3.1 that
[TABLE]
On the one hand, for an even integer , by Hölder’s inequality we have
[TABLE]
Since for every , we deduce that
[TABLE]
which leads to
[TABLE]
On the other hand, for every , there is
[TABLE]
Then we have
[TABLE]
Since (3.17) and (3.18) hold, then (3.21) converges to [math] as . We hence conclude that
[TABLE]
This and (3.20) entail that
[TABLE]
We have completed the proof. ∎
3.4 A law of large numbers for the inward case
In this subsection we fix an OU type growth-fragmentation with characteristics and cumulant , and always suppose that is inward, i.e. . We shall study the long-time asymptotic behavior of .
Before stating our main results, Theorem 3.20, let us introduce the required assumptions. We first suppose that the cumulant satisfies
[TABLE]
where . Denote
[TABLE]
then (3.22) forces that . So the branching rate is finite and on average a finite number of child particles are generated in each splitting event. Denote the number of particles at time by
[TABLE]
Under condition (3.22), the process is simply a branching process; see e.g. [3] for basic properties. In particular, it is finite at all time.
We further suppose that
[TABLE]
which is known as the supercritical condition for the branching process . It is known (Theorem III.4.1 in [3]) that (3.23) is a sufficient and necessary condition such that the following non-extinction event has strictly positive probability:
[TABLE]
We next replace (3.22) by a stronger condition
[TABLE]
The purpose of this assumption is to make use of the following well-known martingale convergence result.
Lemma 3.19** ([20, Theorem 5]).**
Suppose that (3.23) and (3.24) hold. Then the martingale
[TABLE]
converges to a limit as , almost surely and in . Furthermore, conditionally on non-extinction, the limit is strictly positive.
In particular, Lemma 3.19 entails that is bounded in , i.e. there exists such that
[TABLE]
Note that (3.24) is also a necessary condition for to have finite -moment [3, Corollary III 6.1].
The last assumption is that
[TABLE]
To understand this condition, we recall from Lemma 3.7 that, under condition ,
[TABLE]
is the Laplace exponent of some Lévy process. Then we observe from Lemma 2.2 that (3.26) is the sufficient and necessary condition that an OU type process with characteristics possesses a unique invariant probability distribution . Let be the image of by the map , so is a probability measure on with finite Mellin transform
[TABLE]
We now state the main result of this section.
Theorem 3.20**.**
Suppose that (3.23), (3.24) and (3.26) hold. Then for every bounded and continuous function on ,
[TABLE]
Remark 3.8*.*
It is known (Theorem III.7.2 in [3]) that the martingale converges to in if and only if
[TABLE]
However, when (3.24) is replaced by this weaker condition, our proof of Theorem 3.20 cannot be extended to prove the convergence in .
As a consequence of Theorem 3.20, we obtain a law of large numbers.
Corollary 3.21** (Law of large numbers).**
Suppose that (3.23), (3.24) and (3.26) hold. Then for every bounded and continuous function on , conditionally on non-extinction, there is
[TABLE]
Proof.
Conditionally on non-extinction, is strictly positive. So it follows from Lemma 3.19 that
[TABLE]
Combining this and Theorem 3.20, we deduce the claim. ∎
Theorem 3.20 and Corollary 3.21 should be compared with the law of large numbers for binary branching Gaussian OU process [1] and branching diffusions [26], as well as convergence results for Crump-Mode-Jagers branching processes [37, 28].
Another worthy-noting consequence of Theorem 3.20 is about the long-time asymptotic for the solutions to growth-fragmentation equations; see [18, 35] and references therein for related estimates.
Corollary 3.22**.**
Suppose that (3.23), (3.24) and (3.26) hold. Let be the solution to the growth-fragmentation equation (3.7). Then the probability measure converges weakly to . Furthermore, is a solution to the stationary equation: for every ,
[TABLE]
where is as in (3.8).
Proof.
Taking expectation to (3.28), we deduce that converges vaguely to . We also know that \rho_{\mathbf{X}}(t)\big{(}\mathbb{R}_{+}\big{)}=\mathbb{E}\left[N(t)\right]=\mathrm{e}^{\kappa(0)t}, so is indeed a probability measure and thus the convergence also holds weakly.
It remains to prove that is a solution to (3.29). Since is a solution to (3.7), we easily check that
[TABLE]
Letting , we conclude the claim. ∎
Open question 3.9*.*
A natural question is whether the convergence in Theorem 3.20 also holds almost surely. The methods developed in [26] might be of use: that is, by first proving along lattice times, and then extending to continuous time.
Open question 3.10*.*
It would be interesting to extend Theorem 3.20 to the case when (3.22) does not hold. Taking into account of the many-to-one formula, this would require an in-depth examination of the affine Markov process given in Lemma 3.8.
We now prove Theorem 3.20.
Proof of Theorem 3.20.
Equivalently, we shall prove that for every bounded and continuous function on , we have the convergence
[TABLE]
For simplicity, denote
[TABLE]
Let be the natural filtration of , then it suffices to prove that
[TABLE]
and that there exists a function such that
[TABLE]
We start with (3.30). Let be i.i.d. copies of , then using the Markov property (Proposition 3.3), we have for every the identity in law:
[TABLE]
where
[TABLE]
Let us now recall a useful inequality [20, Lemma 1]: let and be independent (but not necessarily identical) random variables with each , then for every there is
[TABLE]
Since are independent conditionally on , applying (3.33) to (3.32), we have
[TABLE]
For every , using Jensen’s inequality (the finite form) and then conditional Jensen’s inequality, we find that
[TABLE]
By conditioning on and using (3.25), we deduce that
[TABLE]
Summarizing, for every we have
[TABLE]
which converges to [math] as , since . So we have justified (3.30).
It remains to prove (3.31). Recall that
[TABLE]
Let be an OU type process with characteristics , where . Then applying the many-to-one formula (Proposition 3.9 and Remark 3.6) to yields
[TABLE]
Consider a family of increasing compact sets , say . On the one hand, if we only consider those , then it follows from (3.34) that
[TABLE]
By the many-to-one formula, the right-hand-side has mean value , which converges to zero as by Lemma 2.2 and the Portmanteau theorem. As (3.25) holds, we have by the dominated convergence that
[TABLE]
On the other hand, since is uniformly continuous on any compact set on , we deduce by Lemma 2.2 that the following convergence holds uniformly for all :
[TABLE]
Then using (3.34) and Lemma 3.19, we can choose , depending on , such that
[TABLE]
Combining (3.35) and (3.36), we then deduce (3.31), which completes the proof. ∎
4 Relations to Markovian growth-fragmentation processes
In this section, we study Markovian growth-fragmentation processes [11] associated with exponential OU type processes. The main result (Proposition 4.6) shows that such processes form a sub-family of our OU type growth-fragmentations.
4.1 Markovian growth-fragmentations associated with exponential OU type processes
Throughout this section, let be a spectrally negative Lévy process with characteristics , be an inward OU type process with index driven by as in (2.3), and
[TABLE]
The assumption is made only for technical reasons; see Remark 4.2. For every , write for the law of starting from , with convention that denotes the law of the process . Let be the lifetime of , which can be infinite.
Recall that the Laplace exponent of is given by (2.1). We introduce by
[TABLE]
Then , is convex and for all because of (2.2). The function shall be referred to as the cumulant of or or ; we shall later (in Proposition 4.6) see that indeed plays a similar role as the cumulant of an OU type growth-fragmentation defined as in (3.1). We emphasize that does not characterize the law of ; see [39, Lemma 2.1]. The cumulant also plays a crucial role in the study of self-similar growth-fragmentations; see [11, 39].
For future use, we statement the following property of . Let and be a function defined by
[TABLE]
where G_{1}(t):=\exp\Big{(}-\int_{0}^{t}\Phi(2\mathrm{e}^{\theta r})\mathrm{d}r\Big{)} and G_{2}(t):=\exp\Big{(}-\int_{0}^{t}\eta^{-1}\left(\kappa(2\mathrm{e}^{\theta r})-\Phi(2\mathrm{e}^{\theta r})\right)\mathrm{d}r\Big{)}. Note that is non-increasing.
Lemma 4.1**.**
For every , let . Then for every , , we have
[TABLE]
and
[TABLE]
Proof.
Applying (2.4) with , we have for every that
[TABLE]
As (2.3) entails that , applying the compensation formula (see e.g. [8, Sec. O.5]) to the Poisson point process , we have that
[TABLE]
where we have used (4.5) in the second equality. Adding (4.5) to (4.6) and using the fact that is non-increasing, we obtain (4.3). Letting in (4.6), we also have (4.4). ∎
Lemma 4.1 enables us to list the jump times of , excluding , as a sequence such that is decreasing. In the sequel, the -th jump time of shall always refer to the -th element in this sequence.
A Markovian growth-fragmentation process associated with can be constructed by using the approach in [11, 39]. We first construct a cell system driven by , which is a family of processes indexed by the Ulam-Harris tree ,
[TABLE]
where each depicts the evolution of the size of the cell indexed by as time passes. Specifically, the ancestor cell is born at with initial size , and the life career is an OU type process of law . The laws of the first generation are determined by the trajectory of : for , say the -th jump time of occurs at time and has size , we then set and build a sequence of conditional independent processes with respective conditional distribution . We stress that the lifetime of is excluded from the jump sequence , and hence at time no child is born. We continue in this way to construct higher generations recursively: For every individual , the laws of her daughters are determined by the trajectory of : given with lifetime , say the -th jump of is at time with , then its -th daughter is born at time and ’s size process has conditional distribution , independent of the size processes of the other individuals in the same generation. By convention, if (which means that has less than jumps), then we set the cell as well as all its progeny to have degenerate life careers, i.e. for every we set and . The above description uniquely determine the law of the cell system , denoted by .
Lemma 4.2**.**
Let be a function as in (4.2). For every ,
[TABLE]
Proof.
As (4.3) holds, the claim follows from [39, Lemma 3.2]. ∎
In particular, this lemma implies that at every time , we can rank the sizes of the cells alive at , i.e.
[TABLE]
in decreasing order and obtain a sequence in denoted by . We refer to as a (Markovian) growth-fragmentation process driven by . Write for the law of under .
By construction, the law of is determined by the law of . However, in the following statement we find a family of OU type processes which give rise to the same (in finite-dimensional distributions) growth-fragmentation.
Lemma 4.3**.**
Let be an OU type process with characteristics and . Suppose that and have the same cumulant , then the growth-fragmentations and , driven respectively by and , have the same finite-dimensional distributions.
Proof.
In order to apply Theorem 3.7 in [39], we introduce the following manipulation. Since and have the same cumulant , by Proposition 2.5 in [39] we can build a pair of spectrally negative Lévy processes and with respective Laplace exponents and , such that is a switching transform of , see Lemma 2.2 in [39] for the precise meaning. In particular, we have that the switching time is almost surely strictly positive and We may assume and (both starting from [math]) are OU type processes associated respectively with and by (2.3), then is equal to and . Let be an independent copy of and set
[TABLE]
Using (2.3) and the strong Markov property of an OU type process, one easily checks that and further the couple satisfies the following properties:
Let . There is almost surely either or the identity
[TABLE] 2.
(Asymmetric Markov branching property) Conditionally on , the process
[TABLE]
is a copy of ; conditionally given , the two processes and are independent, and have the laws of and respectively.
Therefore, we find that is a bifurcator in the sense of Definition 3.7 in [39]. Combining this and Lemma 4.1, we check that the conditions of Theorem 3.7 in [39] are fulfilled, then it follows that and have the same finite-dimensional distributions. ∎
4.2 Binary OU type growth-fragmentations and Markovian growth-fragmentations
Definition 4.1**.**
A binary dislocation measure is a sigma-finite measure on that satisfies (1.3) and has support on
[TABLE]
An OU type growth-fragmentation process is binary, if its dislocation measure is binary.
In this subsection we study the relation between Markovian growth-fragmentations and OU type growth-fragmentation processes. We first observe that each binary OU type growth-fragmentation can be viewed as a Markovian growth-fragmentation in the following sense.
Proposition 4.4**.**
Let be a binary OU type growth-fragmentation with cumulant defined in (3.1), and be the size of the selected fragment of . Then the cumulant of defined by (4.1) is also . Furthermore, is a Markovian growth-fragmentation associated with .
Proof.
Recall from Lemma 3.2 that evolves as the exponential of an OU type process with characteristics . Write for the Lévy measure of and for the dislocation measure of , then we have the identity
[TABLE]
where the second equality follows from the fact that is binary. This leads to the first statement of the proposition.
The proof of the second statement is an adaptation of arguments in [11, Proof of Proposition 3]. For any , consider the truncated system (see Lemma 2.3 and Definition 2.2). Note that the select fragment of has the same size evolution as . Moreover, the system has a discrete genealogical structure (corresponding to Definition 2.1). Since the select fragment of is obtained by keeping the larger child and discarding the smaller one at each dislocation, the dynamics of can be described in the following way. Let be the law of the process . Initially, there is one fragment whose size evolves according to of law . By (2.9), the first dislocation of the system happens at the first time when , and a child cell is born with initial size . After this branching event, the parent continues to evolve as and the child cell size proceeds independently of its parent, according to a process of law . Furthermore, a new cell is generated at the first time when has a jump such that or has a jump such that . This cell proceeds and produces offspring in a similar way, independently of the others. Iterating this argument, we produce all particles of . We hence conclude that can be viewed as a truncated cell system in the sense of this section, associated with , in which each child cell (together with its descendants) is killed whenever its size at birth is less than or equal to times the size of the parent right before the birth of this child. Letting , the claim follows from the monotonicity. ∎
Corollary 4.5**.**
Suppose that . The law of a binary OU type growth-fragmentation is characterized by .
Proof.
Suppose that another binary OU type growth-fragmentation also has index and cumulant . Then it follows from Proposition 4.4 and Lemma 4.3 that and have the same finite-dimensional distributions. Thus, the two processes and have the same law because of the càdlàg property.
Conversely, suppose that an OU type growth-fragmentation have the same law as . Since it follows directly from Theorem 3.1 that, for any such that , there are the identities
[TABLE]
we conclude that and have the same index and cumulant . ∎
Conversely, each Markovian growth-fragmentation driven by an exponential OU type process is a binary OU type growth-fragmentation.
Proposition 4.6**.**
Let be any OU type process with index and define its cumulant by (4.1). Then the Markovian growth-fragmentation associated with is a version of a binary OU type growth-fragmentation characterized by . In particular, possesses a càdlàg version in and for every and
[TABLE]
Proof.
Write for the characteristics of . Let be the image of by the map , then is a binary dislocation measure in the sense of Definition 4.1, and thus there exists a binary OU type growth-fragmentation with characteristics
[TABLE]
A straightforward calculation shows that has the same cumulant as . Combining Proposition 4.4 and Lemma 4.3, we deduce that has the same finite-dimensional distributions as . We complete the proof by applying Theorem 3.1 to . ∎
Remark 4.1*.*
Let be an OU type process with characteristics , and be two Markovian growth-fragmentations driven respectively by and . Then the following statements are equivalent:
- (i)
and ; 2. (ii)
and can be coupled to form a bifurcator that satisfies and in the proof of Lemma 4.3; 3. (iii)
the growth-fragmentations and have the same finite dimensional distributions.
Indeed, we have already obtained “” and “” from the proof of Lemma 4.3. The implication “” follows from Proposition 4.6. This is an analogous result of Theorem 1.1 (for homogeneous growth-fragmentations) and Theorem 1.2 (for self-similar growth-fragmentations) in [39].
Remark 4.2*.*
When , the function as in Lemma 4.1 is not well-defined in general, unless for all . For this case, unfortunately it seems difficult, if at all possible, to find a time-dependent excessive funtion in the sense of [39], such that (4.3) and (4.4) hold, and that
[TABLE]
So we cannot apply [39, Theorem 3.7] to proceed the proof of Lemma 4.3 for the outward case. However, even without having such a function , we should still be able to prove Lemma 4.3 and Proposition 4.6 by using a direct approach similar to that in [39, Propsition 2.15]. Roughly speaking, this is done by changing the genealogy in the cell system.
5 A connection with random recursive trees
In this section we lift from [6] a certain OU type growth-fragmentation that appears in the destruction of an infinite recursive tree. See also [36] for a related work.
An infinite recursive tree is a random rooted tree with vertices indexed by , constructed recursively in the following way. We start with linking the vertex (the root) to the vertex by an edge denoted by . Then we proceed by induction. For , vertex attaches to a vertex chosen uniformly from , say , by an edge .
We destroy the infinite recursive tree by associating each with an independent exponential clock and breaking each edge when its clock rings. Then the vertices of this tree split into different connected clusters. Let be the resulting partition of at time , such that each is the set of the vertices of a cluster at time , and they are listed in increasing order of the smallest element of the cluster. It has been proven in [6] that
[TABLE]
Furthermore, can be rearranged in decreasing order, which produces a sequence denoted by . Partial results of Proposition 2.3 and Theorem 3.1 in [6] can be rewritten in our terms as follows.
Proposition 5.1** ([6]).**
The process is a binary OU type growth-fragmentation with characteristics in the sense of Corollary 4.5, where
[TABLE]
with denoting the digamma function, that is the logarithmic derivative of the gamma function. Equivalently, has characteristics , where is the Euler-Mascheroni constant, and the dislocation measure is binary in the sense of Definition 4.1, specified by
[TABLE]
Then by Proposition 3.3 and Theorem 3.1, we recover immediately Theorem 3.4 in [6], which states the Markov property of and that for every and , there is
[TABLE]
Indeed, by the property of the digamma function , an easy calculation shows that
[TABLE]
Then (5.1) follows from Theorem 3.1.
For the readers’ convenience, let us briefly justify Proposition 5.1 by using results in [6].
Proof of Proposition 5.1.
Let be a spectrally negative Lévy process with characteristics , where the Lévy measure has density
[TABLE]
We know from [6] that the Laplace exponent of is . 333The Lévy-Khintchine formula in [6] has a compensation term different from (2.1), so the drift coefficient is changed. We also have that
[TABLE]
So has cumulant .
Write for the law of an exponential OU type process with characteristics starting from , then we shall prove that is Markovian growth-fragmentation associated with . In this direction, let us consider a cell system described as follows. Set the Eve process , the weight process of the cluster (that contains the root ). Then has distribution by Theorem 3.1 in [6]. At each jump time of , say , the partition process has a dislocation in which the block splits into and , with being the block that contains . Let , then we deduce by [6, Proposition 2.3 and Theorem 3.1] that the weight process
[TABLE]
has conditional distribution given . We thus view as the daughter process born at the jump time of . In this way we associate each jump time of with a daughter; these daughters are independent one of the others, and form the first generation of the cell system. By iteration of this argument, we obtain a cell system driven by and hence deduce that is a Markovian growth-fragmentation associated with . So we know from Proposition 4.6 that is a binary OU type growth-fragmentation process with characteristics . ∎
Appendix A Proofs of Lemma 2.3 and Lemma 2.4
Proof of Lemma 2.3.
The proof is an adaptation of the arguments in [10, Lemma 3]. We shall check that fulfills Definition 2.1 with a different genealogy.
For every , let , with by convention. With notation in Definition 2.1, we write for every and derive from by (2.9). As has the law of , we easily deduce that . Let , then for each , only the closest child of is kept in the truncated system , but the other children are all killed. Therefore, at any time before , in there is only one particle, which shall be viewed as the ancestor in the truncated system . At its lifetime , it splits into more than one particles, located at . So we define , which is a random variable of law . Since has the geometric distribution with parameter , from basic property of exponential random variables, we know that has the exponential distribution with parameter .
We next investigate the movement of the ancestor . Write recursively a sequence such that and Then we define a process by
[TABLE]
It follows from the simple Markov property that is an OU type process with characteristics . We also define a process
[TABLE]
By (2.3), it is an OU type process associated with a compound Poisson process on with Lévy measure
[TABLE]
Since is the superposition of the two independent processes and , we have by Lemma 2.1 that is an OU type process with characteristics , where
[TABLE]
Using the fact that
[TABLE]
and that infers , we deduce an identity
[TABLE]
By iterating this argument and comparing with Definition 2.1, we complete the proof. ∎
Proof of Lemma 2.4.
From the proof of Lemma 2.3, we readily know that the selected atom is an OU type process with characteristics , with given by (A.1). One easily checks that . ∎
Appendix B Proof of Equation (3.9)
It suffices to prove for the case . For simplicity, write
[TABLE]
Since is a solution to (3.7), we have
[TABLE]
where L(s+r,y):=L_{1}+L_{2}+\frac{1}{2}\sigma^{2}L_{3}+\big{(}c+\frac{1}{2}\sigma^{2}-\theta\log y\big{)}L_{4}+L_{5} and
[TABLE]
On the other hand, let us write , where
[TABLE]
Comparing these terms, we deduce the identity . This entails that
[TABLE]
which ends the proof.
Acknowledgement
The author is very grateful to Jean Bertoin for his guidance and advice throughout this research. The author also warmly thanks Igor Kortchemski, Robin Stephenson, Matthias Winkel and an anonymous referee for their insightful comments which helped to improve the work considerably. This research was partially supported by the pôle mathSTIC of Université Paris 13 and SNSF fellowship P2ZHP2_171955.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] R. Adamczak and P. Miłoś. CLT for Ornstein-Uhlenbeck branching particle system. Electron. J. Probab. , 20:no. 42, 35, 2015.
- 2[2] D. Applebaum. Lévy processes and stochastic calculus , volume 116 of Cambridge Studies in Advanced Mathematics . Cambridge University Press, Cambridge, second edition, 2009.
- 3[3] K. B. Athreya and P. E. Ney. Branching processes . Springer-Verlag, New York-Heidelberg, 1972. Die Grundlehren der mathematischen Wissenschaften, Band 196.
- 4[4] O. E. Barndorff-Nielsen and N. Shephard. Non-Gaussian Ornstein-Uhlenbeck-based models and some of their uses in financial economics. J. R. Stat. Soc. Ser. B Stat. Methodol. , 63(2):167–241, 2001.
- 5[5] O. E. Barndorff-Nielsen and N. Shephard. Econometric analysis of realized volatility and its use in estimating stochastic volatility models. J. R. Stat. Soc. Ser. B Stat. Methodol. , 64(2):253–280, 2002.
- 6[6] E. Baur and J. Bertoin. The fragmentation process of an infinite recursive tree and Ornstein-Uhlenbeck type processes. Electron. J. Probab. , 20:no. 98, 1–20, 2015.
- 7[7] J. Berestycki. Ranked fragmentations. ESAIM Probab. Statist. , 6:157–175 (electronic), 2002.
- 8[8] J. Bertoin. Lévy processes , volume 121 of Cambridge Tracts in Mathematics . Cambridge University Press, Cambridge, 1996.
