This paper investigates the long-term behavior of super Ornstein-Uhlenbeck processes, establishing law of large numbers and stable central limit theorems with phase transitions depending on the branching rate.
Contribution
It introduces new stable central limit theorems for super Ornstein-Uhlenbeck processes with detailed phase transition analysis based on branching rates.
Findings
01
Law of large numbers for super Ornstein-Uhlenbeck processes
02
$(1+eta)$-stable central limit theorems with phase transitions
03
Different CLT forms in small, large, and critical branching regimes
Abstract
In this paper, we study the asymptotic behavior of a supercritical (ξ,ψ)-superprocess (Xt)t≥0 whose underlying spatial motion ξ is an Ornstein-Uhlenbeck process on Rd with generator L=21σ2Δ−bx⋅∇ where σ,b>0; and whose branching mechanism ψ satisfies Grey's condition and some perturbation condition which guarantees that, when z→0, ψ(z)=−αz+ηz1+β(1+o(1)) with α>0, η>0 and β∈(0,1). Some law of large numbers and (1+β)-stable central limit theorems are established for (Xt(f))t≥0, where the function f is assumed to be of polynomial growth. A phase transition arises for the central limit theorems in the sense that the forms of the central limit theorem are different in three different regimes corresponding the branching rate being…
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 · Stochastic processes and financial applications · Theoretical and Computational Physics
Full text
Stable Central Limit Theorems for Super Ornstein-Uhlenbeck Processes
Yan-Xia Ren, Renming Song, Zhenyao Sun and Jianjie Zhao
Yan-Xia Ren
LMAM School of Mathematical Sciences & Center for Statistical Science
In this paper, we study the asymptotic behavior of a supercritical (ξ,ψ)-superprocess (Xt)t≥0
whose underlying spatial motion ξ is an Ornstein-Uhlenbeck process on Rd with generator L=21σ2Δ−bx⋅∇ where σ,b>0;
and whose branching mechanism ψ satisfies Grey’s condition and some perturbation condition which guarantees that,
when z→0, ψ(z)=−αz+ηz1+β(1+o(1)) with α>0, η>0 and β∈(0,1).
Some law of large numbers and (1+β)-stable central limit theorems are established for
(Xt(f))t≥0, where the function f is
assumed to be of polynomial growth.
A phase transition arises for the central limit theorems in the sense
that the forms of the central limit theorem are different in three different regimes corresponding the branching rate
being relatively small, large or critical at a balanced value.
Key words and phrases:
Superprocesses, Ornstein-Uhlenbeck processes, Stable distribution, Central limit theorem, Law of large numbers, Branching rate regime
2010 Mathematics Subject Classification:
60J68, 60F05
The research of Yan-Xia Ren is supported in part by NSFC (Grant Nos. 11671017 and 11731009) and LMEQF.
The Research of Renming Song is support in part by a grant from the Simons Foundation (#429343, Renming Song)
Jianjie Zhao is the corresponding author
1. Introduction
1.1. Motivation
Let d∈N:={1,2,…} and R+:=[0,∞).
Let ξ={(ξt)t≥0;(Πx)x∈Rd} be an Rd-valued Ornstein-Uhlenbeck process (OU process) with generator
[TABLE]
where σ>0 and b>0 are constants.
Let ψ be a function on R+ of the form
[TABLE]
where α>0, ρ≥0 and π is a measure on (0,∞) with ∫(0,∞)(y∧y2)π(dy)<∞.
ψ is referred to as a branching mechanism and π is referred to as the Lévy measure of ψ.
Denote by M(Rd) the space of all finite Borel measures on Rd.
For f,g∈B(Rd,R) and μ∈M(Rd),
write μ(f)=∫f(x)μ(dx)
and ⟨f,g⟩=∫f(x)g(x)dx whenever the integrals make sense.
We say a real-valued Borel function f:(t,x)↦f(t,x) on R+×Rd is locally bounded if, for each t∈R+, we have sups∈[0,t],x∈Rd∣f(s,x)∣<∞.
We say that an M(Rd)-valued Hunt process X={(Xt)t≥0;(Pμ)μ∈M(Rd)}
on (Ω,F)
is a super Ornstein-Uhlenbeck process (super-OU process) with branching mechanism ψ, or a (ξ,ψ)-superprocess, if for each non-negative bounded Borel function f on Rd, we have
[TABLE]
where (t,x)↦Vtf(x) is the unique locally bounded non-negative solution to the equation
[TABLE]
The existence of such super-OU process X is well known, see [13] for instance.
Recently, there have been quite a few papers on laws of large numbers for superdiffusions.
In [15, 16, 17], some weak laws of large numbers (convergence in law or in probability) were established.
The strong law of large numbers for superprocesses was first studied in [9], followed by [10, 11, 14, 26, 30, 44] under different settings.
For a good survey on recent developments in laws of large numbers for branching Markov processes and superprocesses, see [14].
The strong law of large numbers for the super-OU process X above can be stated as follows:
Under some conditions on ψ (these conditions are satisfied under our Assumptions 1 and 2 below),
there exists an Ω0 of Pμ-full probability for every μ∈M(Rd) such that on Ω0, for every Lebesgue-a.e. continuous bounded non-negative function f on Rd, we have
limt→∞e−αtXt(f)=H∞⟨f,φ⟩,
where H∞ is the limit of the martingale e−αtXt(1)
and φ is the invariant density of the OU process ξ defined in (1.8) below.
See [11, Theorem 2.13 & Example 8.1] and [14, Theorem 1.2 & Example 4.1].
In this paper, we will establish some spatial central limit theorems (CLTs) for the super-OU process X above.
Our key assumption is that ψ satisfies Grey’s condition and some perturbation condition which guarantees that,
when z→0, ψ(z)=−αz+ηz1+β(1+o(1)) with α>0, η>0 and β∈(0,1).
Our goal is to find (Ft)t≥0 and (Gt)t≥0 so that
(Xt(f)−Gt)/Ft converges weakly to some non-degenerate random variable as t→∞, for a large class of functions f.
Note that, in the setting of this paper, Xt(f) typically has infinite second moment.
There are many papers on CLTs for branching processes, branching diffusions and superprocesses under the second moment condition.
See [18, 20, 21] for supercritical Galton-Watson processes (GW processes),
[24, 25] for supercritical multi-type GW processes, [4, 5, 6]
for supercritical multi-type continuous time branching processes and [3] for general supercritical branching Markov processes under certain conditions.
Some spatial CLTs for supercritical branching OU processes with binary branching mechanism were proved in [1] and some
spatial CLTs for supercritical super-OU processes with branching mechanisms satisfying a fourth moment condition were proved in [33].
These two papers made connections between CLTs and branching rate regimes.
Some spatial CLTs for supercritical super-OU processes with branching mechanisms satisfying only a second moment condition were established in [36].
Moreover, compared with the results of [1, 33], the limit distributions in [36] are non-degenerate.
Since then, a series of spatial CLTs for a large class of general supercritical branching Markov processes and superprocesses with spatially dependent branching mechanisms were proved in [37, 38, 39].
The functional version of the CLTs were established in [23] for supercritical multitype branching processes, and in [40] for supercritical superprocesses.
There are also many limit theorems for supercritical branching processes and branching Markov processes with branching mechanisms of infinite second moment.
Heyde [19] established some CLTs for supercritical GW processes when the offspring distribution belongs to the domain of attraction of a stable law of index α∈(1,2], and proved that the limit laws are stable laws.
Similar results for supercritical multi-type GW processes and supercritical continuous time branching processes,
under some p-th (p∈(1,2]) moment condition on the offspring distribution, were given in Asmussen [2].
Recently, Marks and Miloś [31] considered the limit behavior of supercritical branching OU processes with a special stable offspring distribution.
They established some spatial CLTs in the small and critical branching rate regimes, but they did not prove any CLT type result in the large branching rate regime.
We also mention here that very recently [22] considered stable fluctuations of Biggins’ martingales in the context of branching random walks and [35] considered the asymptotic behavior
of a class of critical superprocesses with spatially dependent stable branching mechanism.
As far as we know, this paper is the first to study spatial CLTs for supercritical superprocesses without the second moment condition.
1.2. Main results
We will always assume that the following assumption holds.
Assumption 1**.**
The branching mechanism ψ satisfies Grey’s condition, i.e., there exists z′>0 such that ψ(z)>0 for all z>z′ and ∫z′∞ψ(z)−1dz<∞.
For μ∈M(Rd), write ∥μ∥=μ(1).
It is known (see [27, Theorems 12.5 & 12.7] for example) that, under Assumption 1, the extinction eventD:={∃t≥0,s.t.∥Xt∥=0} has positive probability with respect to Pμ for each μ∈M(Rd).
In fact, Pμ(D)=e−vˉ∥μ∥ where vˉ:=sup{λ≥0:ψ(λ)=0}∈(0,∞) is the largest root of ψ.
Denote by Γ the gamma function.
For any σ-finite signed measure μ, we use ∣μ∣ to denote the total variation measure of μ.
In this paper, we will also assume the following:
Assumption 2**.**
There exist constants η>0 and β∈(0,1) such that
[TABLE]
for some δ>0.
We will show in Subsection 2.1 that if Assumption 2 holds, then η and β are uniquely determined by the Lévy measure π.
In the reminder of the paper, we will always use η and β to denote the constants in Assumption 2.
Note that δ is not uniquely determined by π.
In fact, if δ>0 is a constant such that (1.5) holds, then replacing δ by any smaller positive number, (1.5) still holds.
Therefore, Assumption 2 is equivalent to the following statement:
There exist constants η>0 and β∈(0,1) such that, for all small enough δ>0, (1.5) holds.
Remark 1.1**.**
Roughly speaking, Assumption 2 says that ψ is “not too far away” from ψ(z):=−αz+ηz1+β near [math].
In fact, if we consider their difference
[TABLE]
then it can be verified that (see Lemma 2.1 below) ψ1(z)/z1+βz→00.
Therefore, we can write ψ(z)=−αz+z1+β(η+o(1)) as z→0.
One can further write that ψ(z)=−αz+z1+βl(z) where l is a function on [0,∞) which is slowly varying at [math].
Remark 1.2**.**
It will be proved in Lemma 2.3 that, under Assumption 2,
ψ satisfies the LlogL condition, i.e., ∫(1,∞)ylogyπ(dy)<∞.
This guarantees that H∞, the limit of the non-negative martingale (e−αt∥Xt∥)t≥0, is non-degenerate.
Let us introduce some notation in order to give the precise formulation of our main result.
Denote by B(Rd,R) the space of all R-valued Borel functions on Rd.
Denote by B(Rd,R+) the space of all R+-valued Borel functions on Rd.
We use (Pt)t≥0 to denote the transition semigroup of ξ. Define
Ptαf(x):=eαtPtf(x)=Πx[eαtf(ξt)]
for each x∈Rd, t≥0 and f∈B(Rd,R+).
It is known that, see [28, Proposition 2.27] for example, (Ptα)t≥0 is the mean semigroup of X in the sense that
Pμ[Xt(f)]=μ(Ptαf)
for all μ∈M(Rd), t≥0 and f∈B(Rd,R+).
The limit behavior of X is closely related to the spectral property of the OU semigroup (Pt)t≥0 which we now recall (See [32] for more details).
It is known that the OU process ξ has an invariant probability on Rd
[TABLE]
which is a symmetric multivariate Gaussian distribution.
Let L2(φ) be the Hilbert space with inner product
[TABLE]
Let Z+:=N∪{0}.
For each p=(pk)k=1d∈Z+d, write ∣p∣:=∑k=1dpk, p!:=∏k=1dpk! and ∂p:=∏k=1d(∂pk/∂xkpk).
The Hermite polynomials are defined by
[TABLE]
It is known that (Pt)t≥0 is a strongly continuous semigroup in L2(φ) and its generator L has discrete spectrum σ(L)={−bk:k∈Z+}.
For k∈Z+, denote by Ak the eigenspace corresponding to the eigenvalue −bk, then Ak=Span{ϕp:p∈Z+d,∣p∣=k} where
[TABLE]
In other words,
Ptϕp(x)=e−b∣p∣tϕp(x)
for all t≥0, x∈Rd and p∈Z+d.
Moreover, {ϕp:p∈Z+d} forms a complete orthonormal basis of L2(φ).
Thus for each f∈L2(φ), we have
[TABLE]
For each function f∈L2(φ), define the order of f as
[TABLE]
which is the lowest non-trivial frequency in the eigen-expansion (1.12).
Note that κf≥0 and that, if f∈L2(φ) is non-trivial, then κf<∞.
In particular, the order of any constant non-zero function is zero.
Denote by Mc(Rd) the space of all finite Borel measures of compact support on Rd.
For p∈Z+d, define
Htp:=e−(α−∣p∣b)tXt(ϕp)
for all t≥0.
If αβ~>∣p∣b,β~:=β/(1+β), then for all γ∈(0,β) and μ∈Mc(Rd), we will prove in Lemma 3.2 that (Htp)t≥0 is a Pμ-martingale bounded in L1+γ(Pμ).
Thus the limit H∞p:=limt→∞Htp exists Pμ-almost surely and in L1+γ(Pμ).
We first present a law of large numbers for our model which extends the strong laws of large numbers of [11, 14] in which the first order asymptotic (κf=0) was identified.
Denote by P the class of functions of polynomial growth on Rd, i.e.,
[TABLE]
It is clear that P⊂L2(φ).
Theorem 1.3**.**
If f∈P satisfies αβ~>κfb, then for all γ∈(0,β) and μ∈Mc(Rd),
[TABLE]
Moreover, if f is twice differentiable and all its second order partial derivatives are in P, then we also have almost sure convergence.
If f∈B(Rd,R+) is non-trivial and bounded, then κf=0.
Hence, Theorem 1.3 says that for any γ∈(0,β) and μ∈Mc(Rd), as t→∞,
e−αtXt(f)→⟨f,φ⟩H∞
in L1+γ(Pμ).
Moreover, if f is twice differentiable and all its second order partial derivatives are in P, then we also have a.s. convergence.
However, to get a.s. convergence for bounded non-negative
Lebesgue-a.e. continuous functions f, we do not need f to be twice differentiable.
See [11, Theorem 2.13 & Example 8.1] and [14, Theorem 1.2 & Example 4.1].
For the rest of this subsection, we focus on the CLTs of Xt(f) for a large collection of f∈P∖{0}.
Write u~=1+uu for each u=−1.
It turns out that there is a phase transition in the sense that the results are different in the following three cases:
(1)
the small branching rate case where
f satisfies αβ~<κfb;
2. (2)
the critical branching rate case where
f satisfies αβ~=κfb; and
3. (3)
the large branching rate case where
f satisfies αβ~>κfb.
Here, the small (resp. large) branching rate case means that the branching rate α is small (resp. large) compared to κf;
and the critical branching rate means that the branching rate α is at a critical balanced value compared to κf.
To present our result, we define a family of operators (Tt)t≥0 on P by
[TABLE]
and a family of C-valued functionals (mt)0≤t<∞ on P by
[TABLE]
Define Cs:=P∩Span{ϕp:αβ~<∣p∣b}, Cc:=P∩Span{ϕp:αβ~=∣p∣b}
and Cl:=P∩Span{ϕp:αβ~>∣p∣b}.
Note that Cs is an infinite dimensional space, Cl and Cc
are finite dimensional spaces, and Cc might be empty.
For f∈P∖{0}, in Lemma 2.6 and Proposition 2.7 below, we will show that
[TABLE]
is well defined, and moreover, there exists a (1+β)-stable random variable ζf with characteristic function θ↦em[θf].
The main result of this paper is as follows.
Theorem 1.4**.**
If μ∈Mc(Rd)∖{0}, then under Pμ(⋅∣Dc), the following hold:
(1)
if f∈Cs∖{0}, then ∥Xt∥−1+β1Xt(f)dt→∞ζf;
2. (2)
if f∈Cc∖{0}, then ∥tXt∥−1+β1Xt(f)dt→∞ζf;
3. (3)
if f∈Cl∖{0}, then
[TABLE]
At this point, we should mention that the theorem above does not cover all f∈P.
Theorem 1.4.(1) can be rephrased as if f∈P∖{0} satisfies αβ~<κfb, then under Pμ(⋅∣Dc), ∥Xt∥−1+β1Xt(f)dt→∞ζf.
Combining the first two parts of Theorem 1.4, one can easily get that if f∈P satisfies αβ~=κfb, then under Pμ(⋅∣Dc),
∥tXt∥−1+β1Xt(f)dt→∞ζf.
A general f∈P can be decomposed as fs+fc+fl with fs∈Cs, fc∈Cc and fl∈Cl.
For f∈P satisfying αβ~>κfb, fs and fc maybe non-trivial.
In this case, we do not have a CLT yet.
We conjecture that the limit random variables in Theorem 1.4 for f∈Cs, f∈Cc and f∈Cl are independent. If this is valid, we can
get a CLT for Xt(f) for all f∈P.
This independence is valid under the second moment condition, see [38].
We leave the question of independence of the limit stable random variables to a future project.
We now give some intuitive explanation of the branching rate regimes and the phase transition.
Similar explanation has been given in the context of branching-OU processes, see [31].
First we mention that a super-OU process arises as the “high density” limit of a sequence of branching-OU processes, see [28] for example. A superprocess can be thought of as a cloud of infinitesimal branching “particles” moving in space.
The phase transition is due to an interplay of two competing effects in the system: coarsening and smoothing.
The coarsening effect corresponds to the increase of the spatial inequality and is a consequence of the branching: simply an area with more particles will produce more offspring.
The smoothing effect corresponds to the decrease of the spatial inequality and is a consequence of the mixing property of the OU processes: each OU “particle” will “forget” its initial position exponentially fast.
Let us consider Xt(ϕp) as an example and discuss how the parameters α,β,b and ∣p∣
influence those two effects:
•
The branching rate α captures the mean intensity of the branching in the system.
Therefore, the lager the branching rate α, the stronger the coarsening effect.
•
The tail index β describes the heaviness of the tail of the offspring distribution which belongs to the domain of attraction of some (1+β)-stable random variable.
When β is smaller i.e. the tail is heavier, then it is more likely that
one particle can suddenly have a large amount of offspring.
In other words, the larger the tail index β, the smaller the fluctuation of offspring number, and then the stronger the coarsening effect.
•
The drift parameter b is related to the level of the mixing property of the OU particles.
The larger the drift parameter b, the faster the OU-particles forgetting their initial position, and therefore the stronger the smoothing effect.
•
The order ∣p∣ is related to the capability of ϕp capturing the mixing property of the OU particles.
In particular, in the case that ∣p∣=0, no mixing property can be captured by ϕp≡1 since we are only considering the total mass ∥Xt∥.
In general, the higher the order ∣p∣, the more mixing property can be captured by ϕp, and therefore the stronger the smoothing effect.
Here we discuss the role of the other parameters ρ,η and σ in our model:
•
The coefficient ρ dose not influence the result since ρz2 in the branching mechanism ψ is a part of the small perturbation ψ1
(see Remark 1.1).
•
The coefficients η and σ are hidden in the definition of the functional m[f], and therefore influence the actual distribution of the limiting (1+β)-stable random variable ξf.
Their role in the coarsening and smoothing effects are negligible compared to the four parameters α,β,b and ∣p∣ mentioned above.
1.3. An outline of the methodology
Let us give some intuitive explanation of the methodology used in this paper.
For any μ∈Mc(Rd) and any random variable Y with finite mean, we define
IstY:=Ist[Y,μ]:=Pμ[Y∣Ft]−Pμ[Y∣Fs]
where 0≤s≤t<∞.
We will use the shorter notation IstY when there is no danger of confusion.
For f∈P, consider the following decomposition over the time interval [0,t]:
[TABLE]
To find the fluctuation of Xt(f), we will investigate the fluctuation of each term on the right hand side above.
The second term and third term are negligible after the rescaling, and for the first term we will establish
a multi-variate unit interval CLT which says that
[TABLE]
where (ζkf)k∈N are independent (1+β)-stable random variables.
If f∈Cs∖{0}, then it can be argued that ∑k=0⌊t⌋ζkfdt→∞ζf and then intuitively we have
∥Xt∥−1+β1Xt(f)dt→∞ζf.
If f∈Cc∖{0}, then it can be argued that
t−1+β1∑k=0⌊t⌋ζkdt→∞ζf
and then intuitively we have
∥tXt∥−1+β1Xt(f)dt→∞ζf.
If f∈Cl, the general idea is almost the same, except that we need to consider the decomposition over the time interval [t,∞).
This paper is our first attempt on stable CLTs for superprocesses.
There are still many open questions.
Ren, Song and Zhang have established some spatial CLTs in [38] for a class of superprocesses with general spatial motions under
the assumption that the branching mechanisms satisfy a second moment condition.
We hope to prove spatial CLTs for superprocesses with general motions without the second moment assumption on the branching mechanism in a future project.
Recall that our Assumption 2 says that the branching mechanism ψ is −αz+ηz1+β plus a small perturbation
ψ1(z)
which satisfies (1.5) with some δ>0.
It would be interesting to consider more general branching mechanisms.
The following correspondence between (sub)critical branching mechanisms and Bernstein functions is well known, see, for instance,
[7, Theorem VII.4(ii)] and [8, Proposition 7]. Suppose that f,g:(0,∞)→[0,∞) are related by f(x)=xg(x).
Then f is a (sub)critical branching mechanism with limx→0f(x)=0 iff g is a Bernstein function with a decreasing Lévy density.
We now use this correspondence to give some examples of branching mechanisms satisfying Assumptions 1 and 2.
If h is a complete Bernstein function which is regularly varying at 0 with index β1∈(β,1), then
[TABLE]
satisfies Assumptions 1 and 2.
If β1∈(β,1), c1∈(0,η/Γ(−1−β)) and c2≥1, then
The rest of the paper is organized as follows:
In Subsection 2.1 we will give some preliminary results for the branching mechanism ψ.
In Subsections 2.2 and 2.3 we will give some estimates for some operators related to the super-OU process X.
In Subsection 2.4 we will give the definitions of the (1+β)-stable random variables involved in this paper.
In Subsection 2.5 we will give some refined estimate for the OU semigroup.
In Subsection 2.6 we will give some estimates for the small value probability of continuous state branching processes.
In Subsection 2.7 we will give upper bounds for the (1+γ)-moments for our superprocesses.
These estimates and upper bounds will be crucial in the proofs of our main results.
In Subsection 3.1, we will give the proof of Theorem 1.3.
In Subsections 3.2–3.5, we will give the proof of Theorem 1.4.
In the Appendix, we consider a general superprocess (Xt)t≥0 and we prove that the characteristic exponent of Xt(f) satisfies a complex-valued non-linear integral equation.
This fact will be used at several places in this paper, and we think it is of independent interest.
2. Preliminaries
2.1. Branching mechanism
Let ψ be the branching mechanism given in (1.2).
Suppose that Assumptions 1 and 2 hold.
In this subsection, we give some preliminary results on ψ.
Recall that η and β are the constants in Assumption 2.
Let C+:={x+iy:x∈R+,y∈R} and C+0:={x+iy:x∈(0,∞),y∈R}.
Lemma 2.1**.**
The function ψ1 given by (1.6) can be uniquely extended as a complex-valued continuous function on C+ which is holomorphic on C+0.
Moreover, for all δ>0 small enough, there exists C>0 such that for all z∈C+, we have ∣ψ1(z)∣≤C∣z∣1+β+δ+C∣z∣2.
Proof.
According to Lemma A.2 below and the uniqueness of holomorphic extensions, we know that ψ1 can be uniquely extended as a complex-valued continuous function on C+ which is holomorphic on C+0.
The extended ψ1 has the following form:
[TABLE]
Now, according to Assumption 2, for all small enough δ>0, we have
[TABLE]
as desired.
∎
The following lemma says that the constants η,β in Assumption 2 are uniquely determined by the Lévy measure π.
Lemma 2.2**.**
Suppose Assumption 2 holds. Suppose that there are η′,δ′>0 and β′∈(0,1) such that
[TABLE]
Then η′=η and β′=β.
Proof.
Without loss of generality, we assume that β+δ≤β′+δ′.
Using the fact that y1+β+δ≤y1+β′+δ′ for y≥1, we get
In other words, if we denote by π(dy) the measure η′Γ(−1−β)−1y−2−β′dy, then π is a Lévy measure which satisfies Assumption 2.
Applying Lemma 2.1 to π, we have that there exists c>0 such that
[TABLE]
Dividing both sides by z1+β we have
∣η−η′zβ′−β∣≤czδ+cz1−β,z∈R+.
This implies that η′zβ′−βR+∋z→0η>0.
So we must have β′=β and η′=η.
∎
Lemma 2.3**.**
If ψ satisfies Assumption 2, then ψ satisfies the LlogL condition, i.e.,
∫(1,∞)ylogyπ(dy)<∞.
Proof.
Using Assumption 2 and the fact that ylogy≤y1+β+δ for y large enough, we get
[TABLE]
Therefore we have
[TABLE]
Combining this with
∫(1,∞)Γ(−1−β)y1+βηlogydy<∞,
we immediately get the desired result.
∎
2.2. Definition of controller
Denote by B(Rd,C) the space of all C-valued Borel functions on Rd.
Recall that P is given in (1.13).
Define P+:=P∩B(Rd,R+) and P∗:={f∈B(Rd,C):∣f∣∈P+}.
In this paper, we say R is a monotone operator on P+ if R:P+→P+ satisfies that Rf≤Rg for all f≤g in P+.
For a function h:[0,∞)→[0,∞), we say R is an h-controller if R is a monotone operator on P+ and that R(θf)≤h(θ)Rf for all f∈P+ and θ∈[0,∞).
For subsets D,I⊂P∗ and an operator R on P+, we say an operator A is controlled by R from D to I if A:D→I and that ∣Af∣≤R∣f∣ for all f∈D;
we say a family of operators O is uniformly controlled by R from D to I if
each operator A∈O is controlled by R from D to I.
For subsets D,I⊂P∗ and a function h:[0,∞)→[0,∞), we say an operator A (resp. a family of operators O) is h-controllable (resp. uniformly h-controllable) from D to I if there exists an h-controller R such that A (resp. O) is controlled (resp. uniformly controlled) by R from D to I.
For two operators A:DA⊂P∗→P∗ and B:DB⊂P∗→P∗, define (A×B)f(x):=Af(x)×Bf(x) for all f∈DA∩DB and x∈Rd.
For any a∈R and any operator A:DA→B(Rd,C∖(−∞,0]), define A×af(x):=(Af(x))a for all f∈DA and x∈Rd.
The following lemma is easy to verify.
Lemma 2.4**.**
For each i∈{0,1}, let Oi be a family of operators which is uniformly controlled by an hi-controller Ri from Di⊂P∗ to Ii⊂P∗.
Then the followings hold:
(1)
If I0⊂D1, then {A1A0:Ai∈Oi,i=0,1} is uniformly controlled by the (h1∘h0)-controller R1R0 from D0 to I1.
2. (2)
{A1×A0:Ai∈Oi,i=0,1}* is uniformly controlled by the (h1×h0)-controller R1×R0 from D0∩D1 to P∗.*
3. (3)
{A1+A0:Ai∈Oi,i=0,1}* is uniformly controlled by the (h1∨h0)-controller R1+R0 from D0∩D1 to P∗.*
4. (4)
If I0⊂B(Rd,C∖(∞,0]) and a>0, then {A×a:A∈O0} is uniformly controlled by the (h0a)-controller R0×a from D0 to P∗.
5. (5)
Suppose that O0={Aθ:θ∈Θ} where Θ is an index set.
Further suppose that (Θ,J) is a measurable space and that (θ,x)↦Aθf(x) is J⊗B(Rd)-measurable for each f∈D.
Then the following space of operators
[TABLE]
is uniformly controlled by R0 from D0 to P∗.
2.3. Controllers for the super-OU processes
Let X be our super-OU process with branching mechanism ψ satisfying
Assumptions 1 and 2.
In this subsection, we will define several operators and study some of their properties that will be used in this paper.
Define ψ0(z)=ψ(z)+αz for z∈R+.
According to Lemma 2.1, ψ,ψ1 and ψ0 can all be uniquely extended as complex-valued continuous functions on C+ which are also holomorphic on C+0.
For all f∈B(Rd,C+) and x∈Rd, define Ψf(x)=ψ∘f(x), Ψ0f(x)=ψ0∘f(x) and Ψ1f(x)=ψ1∘f(x).
For all t∈[0,∞),x∈Rd and f∈P, let Utf(x):=LogPδx[eiθXt(f)]∣θ=1 be the value of the characteristic exponent of the infinitely divisible random variable Xt(f) (See the paragraph after Lemma A.3).
It follows from (A.35) that −Utf(x) takes values in C+. Furthermore, we know from Proposition A.6 that
[TABLE]
For all t≥0 and f∈P, we define
[TABLE]
Then we have that
[TABLE]
For all κ∈Z+ and f∈P, define
[TABLE]
Then according to [31, Fact 1.2], Q is an operator from P to P.
Lemma 2.5**.**
Under Assumptions 1 and 2, the following statements are true:
(1)
(−Ut)0≤t≤1* is uniformly θ-controllable from P to P∗∩B(Rd,C+).*
2. (2)
(Ptα)0≤t≤1* is uniformly θ-controllable on P∗.*
3. (3)
Ψ0* is (θ2∨θ1+β)-controllable from P∗∩B(Rd,C+) to P∗.*
4. (4)
(Ut−iPtα)0≤t≤1* is uniformly (θ2∨θ1+β)-controllable from P to P∗.*
5. (5)
(Zt′−Zt)0≤t≤1* is uniformly (θ2+β∨θ1+2β)-controllable from P to P∗.*
6. (6)
For all δ>0 small enough, we have that (Zt′′)0≤t≤1 is uniformly (θ2∨θ1+β+δ)-controllable from P to P∗.
7. (7)
For all δ>0 small enough, we have that (Zt′′′)0≤t≤1 is uniformly (θ2+β∨θ1+β+δ)-controllable from P to P∗.
Proof.
(1). According to (A.35), −Ut is an operator from P to B(Rd,C+).
It follows from (A.36) that for all g∈P, 0≤t≤1 and x∈Rd, we have ∣Utg(x)∣≤sup0≤u≤1Puα∣g∣(x).
We claim that f↦sup0≤u≤1Puαf is a map from P+ to P+. In fact, if f∈P+, there exists constant c>0 such that
[TABLE]
It is clear that f↦sup0≤u≤1Puαf is a θ-controller.
(2). Similar to the proof of (1).
(3). By Lemma 2.1, there exist C,δ>0 satisfying β+δ<1 such that for all f∈P∗∩B(Rd,C+), it holds that ∣Ψ0f∣≤η∣f∣1+β+∣Ψ1f∣≤η∣f∣1+β+C∣f∣2+C∣f∣1+β+δ.
Note that the operator
[TABLE]
is a (θ2∨θ1+β)-controller.
(4). From (1)–(3) above and Lemma 2.4.(1), we know that the operators
[TABLE]
are uniformly (θ2∨θ1+β)-controllable.
Combining this with (2.4) and
Lemma 2.4.(5), we get the desired result.
Now using (1), (2) and (4) above, and Lemma 2.4, we get that the operators
[TABLE]
are uniformly (θ2+β∨θ1+2β)-controllable.
Combining with Lemma 2.4, and
[TABLE]
we get the desired result.
(6). By Lemma 2.1, for all δ>0 small enough, there exists C>0 such that
[TABLE]
Note that, for all δ,C>0,
[TABLE]
is a (θ2∨θ1+β+δ)-controller.
Therefore, for all δ>0 small enough, we have that Ψ1 is a (θ2∨θ1+β+δ)-controllable operator from P∗∩B(Rd,C+) to P∗.
Combining this with (1)–(2) above,
and Lemma 2.4, we get that, for all δ>0 small enough, the operators
[TABLE]
are uniformly (θ2∨θ1+β+δ)-controllable from P to P∗.
(7). Since Zt′′′=(Zt′−Zt)+Zt′′, the desired result follows from (5)–(6) above and Lemma 2.4.(3).
∎
2.4. Stable distributions
Recall that the operators (Tt)t≥0 are defined by (1.14), and the functionals (mt)0≤t<∞ and m are given by (1.15) and (1.16) respectively.
Lemma 2.6**.**
(Tt)t≥0, (mt)0≤t<∞ and m are well defined.
Proof.
Step 1. We will show that for each f∈P, there exists h∈P such that ∣Ttf∣≤e−δth for each t≥0, where
[TABLE]
From this upper bound, it can be verified that (Tt)t≥0 and (mt)0≤t<∞ are well defined.
In fact, we can write f=f0+f1 with f0∈Cs⊕Cc and f1∈Cl.
According to [31, Lemma 2.7], there exists h0∈P such that for each t≥0,
[TABLE]
On the other hand
[TABLE]
So the desired result in this step follows with h:=h0+h1.
Step 2. We will show that if f∈Cs⊕Cl, then m[f] is well defined.
In fact, let δ be given by (2.9), then in this case δ>0.
Now, according to Step 1 there exists h∈P such that ∣Ttf∣≤e−δth for each t≥0.
This exponential decay implies the desired result in this step.
Step 3. We will show that if f∈P∖(Cs⊕Cl), then m[f] is also well defined.
In fact, f can be decomposed as f=fc+fsl where f∈Cc∖{0} and fsl∈Cs⊕Cl.
Note that Ttfc=fc for each t≥0.
Also note that in Step 2, we already have shown that there exist δ>0 and h∈P+ such that for each t≥0, we have ∣Ttfsl∣≤e−δth.
Therefore, using Lemma A.3 we have
[TABLE]
where g∈P+.
Therefore
[TABLE]
Proposition 2.7**.**
For each f∈P∖{0}, there exists a non-degenerate (1+β)-stable random variable ζf such that E[eiθζf]=em[θf] for all θ∈R.
The proof of the above proposition relies on the following lemma:
Lemma 2.8**.**
Let q be a measure on Rd∖{0} with
∫Rd∖{0}∣x∣1+βq(dx)∈(0,∞).
Then
[TABLE]
is the characteristic function of an Rd-valued (1+β)-stable random variable.
Proof.
It follows from disintegration that there exist a measure λ on S:={ξ∈Rd:∣ξ∣=1} and a kernel k(ξ,dt) from S to R+ such that
[TABLE]
We define another measure λ0 on S by
[TABLE]
where Γ is the Gamma function.
Then λ0 is a non-zero finite measure, since
[TABLE]
Define a measure ν on Rd∖{0} by
[TABLE]
Then, according to [41, Remark 14.4], ν is the Lévy measure of a (1+β)-stable distribution on Rd, say μ, whose characteristic function is
Suppose that f∈Cs⊕Cl.
Note that m[θf] can be written as
[TABLE]
Therefore, according to Lemma 2.8, in order to show that ζf is a (1+β)-stable random variable we only need to show that
[TABLE]
According to the Step 1 in the proof of Lemma 2.6, we know that there exist δ>0 and h∈P such that ∣Tsf∣≤e−δsh for each s≥0.
The claim (2.21) then follows.
If f∈P∖(Cs⊕Cl), then f can be written by f=fc+(f−fc) where fc∈Cc∖{0} and f−fc∈Cs⊕Cl.
In this case, according to (2.12), m[θf] has an integral representation:
[TABLE]
Finally, according to Lemma 2.8 and the fact that
∫Rd∣fc(x)∣1+βφ(x)dx∈(0,∞),
We have that ζf is a non-degenerate (1+β)-stable random variable.
∎
2.5. A refined estimate for the OU semigroup
It turns out that our proof of the CLT relies on the following refined estimate for the OU semigroup.
Lemma 2.9**.**
Suppose that g∈P, then there exists h∈P+ such that for all f∈Pg:={θTng:n∈Z+,θ∈[−1,1]} and t≥0, we have ∣Pt(Z1f−⟨Z1f,φ⟩)∣≤e−bth.
Proof.
Fix g∈P.
We write g=g0+g1 with g0∈Cs⊕Cc and g1∈Cl, and qf:=Z1f−⟨Z1f,φ⟩∈P∗ for each f∈P.
We need to prove that there exists h∈P+ such that for each f∈Pg, ∣Ptqf∣≤e−bth.
Step 1. We claim that we only need to prove the result for all
f∈Pg:={Tn+1g:n∈Z+}.
In fact, both Reqg and Imqg are functions in P of order ≥1.
The result is valid for f=T0g=g according to [31, Fact 1.2].
Also, note that if the result is valid for some f∈P, it is also valid for any θf with θ∈[−1,1].
Step 2. We show that {Tsg:s>0}⊂C∞(Rd)∩P.
In fact, for each s>0,
[TABLE]
Notice that the second term is in C∞(Rd)∩P since it is a finite sum of polynomials, and the first term is also in C∞(Rd)∩P according to [31, Fact 1.1].
Step 3. We show that there exists h3∈P+ such that for all j∈{1,…,d} and f∈Pg, it holds that ∣∂jf∣≤h3.
In fact, it is known that (see [32] for example)
[TABLE]
For f∈C∞(Rd)∩P it can be verified from above that
[TABLE]
Thanks to Step 2, T1g0∈C∞(Rd)∩P.
According to [31, Fact 1.3] and the fact that αβ~≤κg0b, we have for each j∈{1,…,d},
[TABLE]
Therefore, there exists h3′∈P+ such that for all n∈Z+ and j∈{1,…,d},
[TABLE]
On the other hand, there exists h3′′∈P+ such that for all n∈Z+ and j∈{1,…,d},
[TABLE]
Then the desired result in this step follows.
Step 4. We show that there exists h4∈P+ such that for all j∈{1,…,d},u∈[0,1] and f∈Pg, it holds that ∣∂jP1−uα(−iPuαf)1+β∣≤h4.
In fact, thanks to Step 2 and (2.24), for all j∈{1,…,d},u∈[0,1] and f∈Pg, we have
[TABLE]
Recall from Step 1 in the proof of Lemma 2.6 there exists h4′∈P+ such that for each f∈{Tsg:s≥0} it holds that ∣f∣≤h4′.
Therefore, using Step 3, we have for all j∈{1,…,d},u∈[0,1] and f∈Pg,
[TABLE]
where Q0 is defined by (2.8).
This implies the desired result in this step.
Step 5.
We show that there exists h5∈P+ such that for each f∈Pg, we have ∣∇(Z1f)∣≤h5.
In fact, according to Step 4, for all j∈{1,…,d}, f∈Pg and compact A⊂Rd, we have
[TABLE]
Using this and [12, Theorem A.5.2], for all j∈{1,…,d}, f∈Pg and x∈Rd, it holds that
[TABLE]
Now, the desired result for this step is valid.
Step 6.
Let h5 be the function in Step 5.
There are c0,n0>0 such that for all x∈Rd, h5(x)≤c0(1+∣x∣)n0.
Note that for all x,y∈Rd, 1+∣x∣+∣y∣≤(1+∣x∣)(1+∣y∣); and that for all θ∈[0,1], ∣1−θ−1∣≤θ.
Write Dx,y={ax+by:a,b∈[0,1]} fo x,y∈Rd.
Using (2.23) and Step 5, there exists h6∈P+ such that for all t≥0, f∈Pg and x∈Rd,
[TABLE]
2.6. Small value probability
In this subsection, we digress briefly from our super-OU process and consider a (supercritical) continuous-state branching process (CSBP){(Yt)t≥0;Px} with branching mechanism ψ given by (1.2).
Such a process {(Yt)t≥0;Px} is defined as an R+-valued Hunt process satisfying
[TABLE]
where for each λ≥0, t↦vt(λ) is the unique positive solution to the equation
[TABLE]
It can be verified that for each μ∈M(Rd) with x=∥μ∥, we have {(∥Xt∥)t≥0;Pμ}=law{(Yt)t≥0;Px}.
Our goal in this subsection is to determine how fast the probability Px(0<e−αtYt≤kt) converges to [math] when t↦kt is a strictly positive function on [0,∞) such that kt→0 and kteαt→∞ as t→∞.
Suppose that Grey’s condition is satisfied i.e., there exists z′>0 such that ψ(z)>0 for all z>z′, and that ∫z′∞ψ(z)−1dz<∞.
Also suppose that the LlogL condition is satisfied i.e.,
∫1∞ylogyπ(dr)<∞.
We write Wt=e−αtYt for each t≥0.
Proposition 2.10**.**
Suppose that t↦kt is a strictly positive function on [0,∞) such that kt→0 and kteαt→∞ as t→∞.
Then, for each x≥0, there exist C,δ>0 such that
[TABLE]
Proof.
Step 1.
We recall some known facts about the CSBP (Yt).
For each λ≥0, we denote by t↦vt(λ) the unique positive solution of (2.40).
Letting λ→∞ in (2.40), we have by monotonicity that vˉt:=limλ→∞vt(λ) exists in (0,∞] for all t≥0, and that
[TABLE]
It is known, see [28, Theorems 3.5–3.8] for example, that under Grey’s condition vˉ:=limt→∞vˉt∈[0,∞) exists and is the largest root of ψ on [0,∞).
Letting t→∞ in (2.41), we have by monotonicity that
[TABLE]
Note the derivative of ψ, i.e.,
[TABLE]
is non-decreasing.
This says that ψ is a convex function.
Also notice that ψ′(0+)=−α<0 and that there exists z>0 such that ψ(z)>0.
Therefore we have (i) vˉ>0; (ii) ψ(z)<0 on z∈(0,vˉ); and (iii) ψ(z)>0 on z∈(vˉ,∞).
It is also known, see [28, Proposition 3.3] for example, that (i) if λ∈(0,vˉ), then 0<λ≤vt(λ)<vˉ; (ii) if λ∈(vˉ,∞), then vˉ<vt(λ)≤λ<∞; and (iii) for each λ∈(0,∞)∖{vˉ} and t≥0, we always have
∫vt(λ)λψ(z)−1dz=t.
Taking λ→∞ and using the monotone convergence theorem, we have that
[TABLE]
Step 2. We will show that, for each x≥0 there exists a constant c1>0 such that
[TABLE]
In fact, for all x≥0 and t≥0, we have
[TABLE]
as desired in this step.
Step 3. We will show that there exist c2,δ1,t0>0 such that
[TABLE]
In fact, since ψ is a convex function, we must have τ:=ψ′(vˉ)>0 and that ψ(z)≥(z−vˉ)τ for each z≥vˉ.
According to Grey’s condition, we can find z0>vˉ such that t0:=∫z0∞ψ(z)−1dz<∞.
For each t>t0, according to (2.42), we have
[TABLE]
Rearranging, we get vˉt−vˉ≤(z0−vˉ)e−τ(t−t0), for all t≥t0.
This implies the desired result in this step.
Step 4.
We will show that there exist c3,δ2,t1>0 such that
[TABLE]
Define ρt:=1+(logkt)/(tα) for all t≥0.
By the fact that kt−1e−αt=e−αρtt for all t≥0 and the condition that kteαtt→∞∞, we have ρttt→∞∞.
Since the LlogL condition is satisfied, we have (see [29] for example), Wta.s.t→∞W∞, where the martingale limit W∞ is a non-degenerate positive random variable.
This implies that
[TABLE]
The LlogL condition also guarantees that (see again [29] for example) {W∞=0}={∃t≥0,Xt=0} a.s. in P1. This and the non-degeneracy of W∞ imply that
[TABLE]
Fix an arbitrary ϵ∈(0,τ).
According to the fact that τ=ψ′(vˉ)>0, there exists z0∈(0,vˉ) such that for all z∈(z0,vˉ), we have −ψ(z)≥(vˉ−z)(τ−ϵ).
Fix this z0.
For t large enough, we have 0<kt−1e−αt<vt(kt−1e−αt)<vˉ.
Then we have for t>0 large enough,
[TABLE]
where we used the fact that
[TABLE]
Now we have, for t large enough,
[TABLE]
Rearranging, we get, for t large enough,
[TABLE]
Therefore, there exist c3>0 and t1>0 such that for all t≥t1,
[TABLE]
This implies the desired result in this step.
Finally, by Steps 2-4, we have for each x≥0, there exist c4,δ3,t2>0 such that
[TABLE]
Note that the left hand side is always bounded from above by 1, so we can take t2=0 in the above statement.
∎
2.7. Moments for super-OU processes
In this subsection, we want to find some upper bound for the (1+γ)-th moment of Xt(g),
where γ∈(0,β) and g∈P.
Lemma 2.11**.**
There is a (θ2∨θ1+β)-controller R such that for all 0≤t≤1, g∈P, λ>0 and μ∈Mc(Rd), we have
[TABLE]
Proof.
It is elementary calculus (see the proof of [12, Theorem 3.3.6] for example) that
for u>0 and x=0,
[TABLE]
Denote by R the (θ2∨θ1+β)-controller in Lemma 2.5.(4).
Then, using Lemma A.1 we get
[TABLE]
Lemma 2.12**.**
For all h∈P+ and μ∈Mc(Rd), there exists C>0 such that for all κ∈Z+, λ>0 and 0≤r≤s≤t<∞ with s−r≤1, we have
[TABLE]
Proof.
Denote by R the (θ2∨θ1+β)-controller in Lemma 2.11.
Fix h∈P+, μ∈Mc(Rd)κ∈Z+ and 0≤r≤s≤t<∞ with s−r≤1.
Suppose that g∈P satisfies Qκg≤h.
Using the Markov property of X, we get
[TABLE]
where C:=\Big{(}\frac{2^{2+\beta}}{2+\beta}+\frac{2^{3}}{3}\Big{)}\mu(Q_{0}Rh)>0.
∎
For each random variable {Y;P} and p∈[1,∞), we write ∥Y∥P;p:=P[∣Y∣p]1/p.
Recall that we write u~=1+uu for each u=−1.
Lemma 2.13**.**
For all h∈P, μ∈Mc(Rd) and γ∈(0,β), there exists C>0 such that for all κ∈Z+ and 0≤r≤s≤t<∞ with s−r≤1, we have
[TABLE]
Proof.
Fix h∈P and μ∈Mc(Rd). Let C0 be the constant in the Lemma 2.12.
For all κ∈Z+, 0≤r≤s≤t with s−r≤1, g∈P with Qκg≤h, and c>0, we have
[TABLE]
Taking c=e(t−s)(α−κb), we get
[TABLE]
Note that
[TABLE]
So the desired result is true.
∎
Lemma 2.14**.**
For all h∈P, μ∈Mc(Rd), γ∈(0,β) and κ∈Z+, there exists a constant C>0 such that for all t≥0, we have
Fix γ∈(0,β) and μ∈Mc(Rd).
Let C be the constant in Lemma 2.13.
Using the triangle inequality, for all κ∈Z+, g∈P with Qκg≤h and t≥0, we have
[TABLE]
By calculating the sum on the right, we get the desired result.
∎
3. Proofs of main results
In this section, we will prove the main results of this paper.
For simplicity, we will write Pμ=Pμ(⋅∣Dc) in this section.
3.1. Law of large numbers
In this subsection, we prove Theorem 1.3.
For this purpose, we first prove the almost sure and L1+γ(Pμ) convergence of a family of martingales for γ∈(0,β). Recall that L is the infinitesimal generator of the OU-process. For f∈P∩C2(Rd) and a∈R, we define
[TABLE]
Let (Ft)t≥0 be the natural filtration of X. The following lemma says that {Mtf,a:t≥0} is a martingale with respect to (Ft)t≥0.
Lemma 3.1**.**
For all f∈P∩C2(Rd), a∈R and μ∈Mc(Rd), the process (Mtf,a)t≥0 is a Pμ-martingale with respect to (Ft)t≥0.
Proof.
Putfˉ:=(L+ab)f.
It follows easily from Ito’s formula that
Using this and (3.3), we get the desired result.
∎
Recall that, for p∈Z+d, ϕp is an eigenfunction of L corresponding to the eigenvalue −∣p∣b and Htp=e−(α−∣p∣b)tXt(ϕp) for each t≥0.
Lemma 3.2**.**
For all μ∈Mc(Rd) and p∈Z+d, (Htp)t≥0 is a Pμ-martingale with respect to (Ft)t≥0.
Moreover if αβ~>∣p∣b, the martingale is bounded in L1+γ(Pμ) for each γ∈(0,β).
Thus the limit H∞p:=limt→∞Htp exists Pμ-a.s. and in L1+γ(Pμ) for each γ∈(0,β).
Proof.
Fix a μ∈Mc(Rd) and a p∈Z+d.
It follows from Lemma 3.1 that (Htp)t≥0 is a Pμ-martingale.
Further suppose that αβ~>∣p∣b.
Then there exists a γ0∈(0,β) which is close enough to β so that αγ~>∣p∣b for each γ∈[γ0,β).
Using Lemma 2.14 and the fact κϕp=∣p∣, we get that, for each γ∈[γ0,β), there exists a constant C>0 such that
[TABLE]
For each γ∈(0,γ0) there exists a constant C′>0 such that
[TABLE]
Therefore, for each γ∈(0,β), the martingale (Htp)t≥0 is bounded in L1+γ(Pμ).
∎
Lemma 3.3**.**
Suppose that μ∈Mc(Rd) and that p∈Z+d satisfies αβ~>∣p∣b.
Then for each γ∈(0,β) satisfying αγ~>∣p∣b, there exists a constant C>0 such that,
[TABLE]
Proof.
Thanks to Lemma 3.2, we only need to prove the inequality when 0≤s<t<∞.
Suppose p∈Z+d, μ∈Mc(Rd) and γ∈(0,β) with αγ~>∣p∣b are fixed.
Using Lemma 2.13 with g=ϕp and k=∣p∣, we know that there exists a constant C1>0 such that for all 0≤r≤s with s−r≤1,
Pμ-a.s. and in L1+γ(Pμ) for each γ∈(0,β).
Therefore, it suffices to show that
[TABLE]
converges to [math] in L1+γ(Pμ) for all γ∈(0,β), and converges almost surely provided f is twice differentiable and all its second order partial derivatives are in P.
Step 1. Let g∈P.
Let κ>0 be such that κ<κg and κb<αβ~.
We will show that for each γ∈(0,β) there exist C1,δ1>0 such that
[TABLE]
In order to do this, we choose a γ0∈(0,β) close enough to β such that κb<αγ~ for each γ∈[γ0,β).
According to Lemma 2.14, we have for each γ∈(0,β),
(1)
if γ∈[γ0,β) and αγ~>κgb, then there exists C2>0 such that
[TABLE]
2. (2)
if γ∈[γ0,β) and αγ~=κgb, then there exists C3>0 such that
[TABLE]
3. (3)
if γ∈[γ0,β) and αγ~<κgb, then there exists C4>0 such that
[TABLE]
4. (4)
if γ∈(0,γ0), then
thanks to (1)–(3) above and the fact that
[TABLE]
there exist C5,δ2>0 such that
[TABLE]
Thus, the desired conclusion in this step is valid.
In particular, by taking g=f and κ=κf, we get that Jt converges to [math] in L1+γ(Pμ) for any γ∈(0,β).
Step 2.
We further assume that f∈C2(Rd) and D2f∈P.
We will show that Jt converges to [math] almost surely.
For a≥0, t≥0, and g∈P∩C2(Rd) satisfying D2g∈P, we define
[TABLE]
Now choose a0∈(κf,κf+1) close enough to κf so that a0b<αβ~.
According to (3.1),
[TABLE]
So we only need to show that
[TABLE]
Notice that κ(L+a0b)f≥κf≥κf+1>a0.
By Step 1, for any fixed γ∈(0,β), there exist C6,δ3>0 such that for each t≥0,
[TABLE]
Now, by the triangle inequality, for each t≥0,
[TABLE]
Since Ytf,a0 is increasing in t, it converges to some finite random variable Y∞f,a0 almost surely and in L1+γ(Pμ).
Consequently, we have
[TABLE]
On the other hand, the martingale Mtf,a0 satisfies
[TABLE]
This implies that the martingale converges almost surely.
Consequently,
[TABLE]
3.2. Central limit theorems for unit time intervals
In this subsection, we will establish the following CLT.
Theorem 3.4**.**
If μ∈Mc(Rd) and f∈P∖{0},
then under Pμ(⋅∣Dc), we have
[TABLE]
where ζ0f is a (1+β)-stable random variable with characteristic function θ↦e⟨Z1(θf),φ⟩.
In fact, we prove a stronger result:
Proposition 3.5**.**
For all μ∈Mc(Rd) and g∈P∖{0}, there exist C,δ>0 such that
for all t≥1 and f∈Pg:={θTng:n∈Z+,θ∈[−1,1]}, we have
[TABLE]
Proof.
Fix μ∈Mc(Rd) and g∈P∖{0}.
Step 1. Write At(ϵ):={∥Xt∥≥e(α−ϵ)t} for t≥0 and ϵ>0.
We will show that for all f∈P∖{0}, ϵ>0 and t≥0, it holds that
[TABLE]
where
[TABLE]
In fact, it follows from (2.7), the definitions of U1, Z1′′′ and Z1, that for all t≥0,
[TABLE]
From Lemma 2.8, we get that θ↦⟨Z1(θf),φ⟩ is the characteristic function of some (1+β)-stable random variable, and then Re⟨Z1f,φ⟩≤0.
Using this, (3.25), (A.35) and the fact ∣e−x−e−y∣≤∣x−y∣ for all x,y∈C+, we get for each t≥0 and ϵ>0,
[TABLE]
Step 2. We will show that for ϵ>0 small enough, there exist C2,δ2>0 such that for all t≥1 and
f∈Pg, we have J1f(t,ϵ)≤C2e−δ2t.
In fact, let δ0>0 be the constant in Lemma 2.5.(7) and let R be the corresponding (θ2+β∨θ1+β+δ0)-controller.
Acording to Step 1 in the proof of Lemma 2.6, there exists h2∈P+ such that for each f∈Pg it holds that ∣f∣≤h2.
Then, we have for all t≥0, ϵ>0 and f∈Pg,
[TABLE]
Thus for all t≥0, ϵ>0 and f∈Pg,
[TABLE]
where Q0 is defined by (2.8).
By taking ϵ>0 small enough, we get the desired result in this step.
Step 3.
We will show that for ϵ>0 small enough there exist C3,δ3>0 such that for all t≥0 and f∈Pg, we have J2f(t,ϵ)≤C3e−δ3t.
In fact, for all t≥0, and f∈Pg,
[TABLE]
and therefore,
[TABLE]
where qf=Z1f−⟨Z1f,φ⟩∈P∗.
It follows from Lemma 2.9 that there exists h3∈P such that for each f∈Pg, we have Q1(Reqf)≤h3 and Q1(Imqf)≤h3, where Q1 is given by (2.8) with κ=1.
In the rest of this step, we fix a γ∈(0,β) small enough such that αγ<b<(1+γ)b.
According to Lemma 2.14.(3) (with κ=1), there exists C3>0 such that for all t≥0 and f∈Pg,
[TABLE]
Therefore, for all t≥0,ϵ>0 and f∈Pg, we have
[TABLE]
By taking ϵ>0 small enough, we get the required result in this step.
Step 4.
We will show that, for each ϵ∈(0,α), there exist C4,δ4>0 such that for all t≥1, J3(t,ϵ)≤C4e−δ4t.
In fact, we have for all t≥0,ϵ>0,
[TABLE]
On the other hand, by Proposition 2.10, for each ϵ∈(0,α), there exists C4,δ4>0 such that for all t≥0,
[TABLE]
Combining these results, we get the desired result in this step.
Step 5. Combining the results in Steps 1–4, we immediately get the desired result.
∎
The following corollary will be used later in the proof of Theorem 1.4.
Corollary 3.6**.**
If g∈P∖{0} and μ∈Mc(Rd), then there exist C,δ>0 such that for
all l≤n in Z+ and (fj)j=ln⊂Pg,
[TABLE]
Proof.
For l≤n in Z+, k∈{l,…,n} and (fj)j=ln⊂Pg, define
[TABLE]
Then for all l≤n in Z+, k∈{l,…,n} and (fj)j=ln⊂Pg, we have
[TABLE]
By Lemma 3.5, there exist C0,δ0>0 such that for all l≤n in Z+, k∈{l,…,n}, and (fj)j=ln⊂Pg, we have
[TABLE]
Therefore, there exist C,δ>0 such that for all l≤n in Z+ and each (fj)j=ln⊂Pg, we have
Fix μ∈Mc(Rd), f∈Cs and t0>1 large enough so that ⌈t−lnt⌉≤⌊t⌋−1 for all t≥t0.
For each t≥t0, in this proof we write θt=∥Xt∥β~−1,
[TABLE]
and I0f(t):=∑k=0⌊t−lnt⌋Υt−k−1Tkf~, where f~:=eα(β~−1)f.
Step 1. We show that I0f(t)dt→∞ζf.
In fact, for each k∈Z+, we have Tkf~∈Pf~:={θTnf~:n∈Z+,θ∈[−1,1]}.
Therefore from Corollary 3.6 we get that there exist C1,δ1>0 such that
[TABLE]
On the other hand, using (2.20) and the fact that φ(x)dx is the invariant probability of the semigroup (Pt)t≥0, we have
[TABLE]
Therefore, we have Pμ[eiI0f(t)]t→∞em[f]. Since I0f(t) is linear in f, we can replace f with θf, θ∈R, and then the desired result in this step follows.
Step 2. We show that I1f(t)−I0f(t)dt→∞0.
In fact, by [12, Lemma 3.4.3] we have that for each t≥t0,
[TABLE]
where Yt,k:=exp(iΥt−k−1Tkf~−iθtIt−k−1t−kXt(f))−1.
We claim that there exist C2,δ2>0 such that Pμ[∣Yt,k∣]≤C2e−δ2(t−k−1) for all k∈Z+ and t≥k+1.
Then there exists C2′>0 such that for each t≥t0, ∣Pμ[ei(I1f(t)−I0f(t))]−1∣≤C2′t−δ1 which, combined with the fact that I1f(t)−I0f(t) is linear in f, completes this step.
We will show the claim above in the following substeps 2.1 and 2.2.
First we choose γ∈(0,β) close enough to β so that there exist η,η′>0 with αγ~>η>η−3η′>αβ~−αγ~>0; and define for k∈Z+ and t≥k+1,
[TABLE]
where Ht:=e−αt∥Xt∥.
Substep 2.1. We show that there exist C2.1,δ2.1>0 such that for all k∈Z+ and t≥k+1, \mathbb{\widetilde{P}}_{\mu}\big{[}|Y_{t,k}|;\mathcal{D}^{c}_{t,k}\big{]}\leq C_{2.1}e^{-\delta_{2.1}(t-k)}.
In fact, it follows from Proposition 2.10, Lemma 3.3 with ∣p∣=0 and Chebyshev’s inequality that there exist C2.1′,δ2.1′>0 such that for all k≥0 and t≥k+1,
[TABLE]
This implies the desired result in this substep, since ∣Yt,k∣≤2 a.s..
Substep 2.2. We will show that there exist C2.2,δ2.2>0 such that for all k∈Z+ and t≥k+1, it holds that Pμ[∣Yt,k∣;Dt,k]≤C2.2e−δ2.2(t−k).
In fact, noticing that for f∈Cs and k∈Z+, we have Tkf=eα(β~−1)kPkαf; and therefore for all k∈Z+ and t≥k+1,
[TABLE]
Since ∣eix−eiy∣≤∣x−y∣ for all x,y∈R, we have for all k∈Z+ and t≥k+1,
[TABLE]
where
[TABLE]
Note that, since η′<η, we have almost surely on Dt,k,
[TABLE]
Therefore, for all k∈Z+ and t≥k+1, almost surely on Dt,k,
[TABLE]
and ∣Ht1−β~Ht−k−11−β~∣≥21+β1e−2η′(t−k−1).
Thus, there exists C2.2′>0 such that for all k≥0,t≥k+1, almost surely
[TABLE]
Now, by Lemma 2.13, there exists C2.2′′>0 such that for all k≥0 and t≥k+1,
[TABLE]
as desired in this step.
In the last inequality, we used the fact that f∈Cs and therefore αβ~<κfb.
Step 3.
We show that I2f(t)dt→∞0.
First fix a γ∈(0,β) in this step.
From the fact that κfb−αγ~>α(β~−γ~), we can choose ϵ>0 small enough so that q:=κfb−αγ~>α(β~−γ~)+2ϵ(1−β~).
Now writing Et:={∥Xt∥>e(α−ϵ)t}, according to Proposition 2.10, there exist C3,δ3>0 such that
[TABLE]
Therefore,
[TABLE]
According to Lemma 2.13, there exist C3′,C3′′,C3′′′>0 such that for each t≥t0>1,
[TABLE]
From this and (3.67), we get that Pμ[eiI2f(t)]t→∞1.
Note that I2f(t) is linear in f so we can replace f with θf for θ∈R and get the desired result in this step.
Step 4. We will show that I3f(t)Pμ-a.s.t→∞0.
In fact, we have
[TABLE]
Step 5. Combining Steps 1–4, we complete the proof of Theorem 1.4.(1).
∎
Fix μ∈Mc(Rd), f∈Cc and t0>1 large enough so that ⌈t−lnt⌉≤⌊t⌋−1 for each t≥t0.
For each t≥t0, in this proof we write θt=∥tXt∥β~−1, define Iif(t) using (3.46) for i=1,2,3, and set I0f(t):=tβ~−1∑k=0⌊t−lnt⌋Υt−k−1Tkf~, where f~=eα(β~−1)f.
Step 1. We show that I0f(t)dt→∞ζf.
In fact, for each t≥t0(>1) we have tβ~−1<1; and therefore, for each k∈Z+, we have tβ~−1Tk+1f∈Pf:={θTnf:n∈Z+,θ∈[−1,1]}.
Therefore from Proposition 3.6 and that β~−1=−1+β1 we get that there exist C1,δ1>0 such that
[TABLE]
Since f∈Cc∖{0}, we have Tkf~=f~ for each k∈Z+.
Similar to the argument in (3.48) we have
[TABLE]
Therefore Pμ[eiI0f(t)]t→∞em[f].
The desired result in this step follows.
Step 2. We show that I1f(t)−I0f(t)dt→∞0.
In fact, similar to Step 2 in the proof of Theorem 1.4.(1), we have (3.51) is valid with Yt,k:=exp(itβ~−1Υt−k−1Tkf~−iθtIt−k−1t−kXt(f))−1.
Similarly, we claim that there exist C2,δ2>0 such that Pμ[∣Yt,k∣]≤C2e−δ2(t−k−1) for all k∈N and t≥k+1, and then the desired result in this step follows.
We will show the claim above in the following substeps 2.1 and 2.2.
First we choose γ∈(0,β) close enough to β so that there exist η,η′>0 with αγ~>η>η−3η′>αβ~−αγ~>0; and define, for k∈N and t≥k+1, Dt,k:={∣Ht−Ht−k−1∣≤e−η(t−k−1),Ht−k−1>2e−η′(t−k−1)}.
Substep 2.1.
Similar to Substep 2.1 in the proof of Theorem 1.4.(1), there exist C2.1,δ2.1>0 such that for all k∈N and t≥k+1, Pμ[∣Yt,k∣;Dt,kc]≤C2.1e−δ2.1(t−k).
We omit the details.
Substep 2.2. We will show that there exist C2.2,δ2.2>0 such that for all k∈N and t≥k+1, Pμ[∣Yt,k∣;Dt,k]≤C2.2e−δ2.2(t−k).
In fact, noticing that for f∈Cc and k∈Z+, we have Tkf=eα(β~−1)kPkα; and therefore for all k∈Z+ and t≥k+1,
[TABLE]
The rest is similar to Substep 2.2 in the proof of Theorem 1.4.(2).
We omit the details.
Step 3.
We show that I2f(t)dt→∞0.
In fact, writing Et:={∥Xt∥>t−1/2eαt}, according to Proposition 2.10, there exist C3,δ3>0 such that
[TABLE]
Therefore,
[TABLE]
Choose a γ∈(0,β) close enough to β so that α(β~−γ~)≤21(1−β~).
According to Lemma 2.13, there exist C3′,C3′′,C3′′′>0 such that for each t≥t0(>1),
[TABLE]
From this and (3.76), we get the desired result in this step.
Step 4. Similar to Step 4 in the proof of Theorem 1.4.(1), we can verify that I3(t)Pμ-a.s.t→∞0.
We omit the details.
Step 5. Combining Steps 1–4, we complete the proof of Theorem 1.4.(2).
∎
Fix μ∈Mc(Rd) and f∈Cl.
Define N:={p∈Z+d:αβ~>∣p∣b}.
In this proof we write for each t≥0,
[TABLE]
and I0f(t):=∑k=0⌊t2⌋Υt+k−Tkf~ where f~:=∑p∈Ne−(α−∣p∣b)⟨f,ϕp⟩φϕp.
Step 1. We show that I0f(t)dt→∞ζ−f.
In fact, since Tkf~∈Pf~ for each k∈Z+, from Corollary 3.6 we have Pμ[eiI0f(t)]t→∞exp{∑k=0∞⟨Z1Tk(−f~),φ⟩}.
Using (2.20) and the fact that φ(x)dx is the invariant probability of the semigroup (Pt)t≥0 we have
[TABLE]
The result in this step follows.
Step 2. We show that I1f(t)−I0f(t)dt→∞0.
In fact, by [12, Lemma 3.4.3] we have, for each t≥0, that ∣Pμ[ei(I1f(t)−I0f(t))−1]∣≤∑k=0⌊t2⌋Pμ[∣Yt,k∣] where Yt,k:=ei(Υt,k−Υt+k−Tkf)−1.
We claim that there exist C2,δ2>0 such that Pμ[∣Yt,k∣]≤C2e−δ2t for all t≥0 and k∈Z+.
Then ∣Pμ[ei(I1f(t)−I0f(t))−1]∣≤(t2+1)C2e−δ2t which completes this step.
We will show the claim above in the following substeps 2.1 and 2.2.
First we choose γ∈(0,β) close enough to β so that αγ~>∣p∣b for each p∈N;
and even closer so that there exist η,η′>0 satisfying αγ~>η>η−3η′>α(β~−γ~)>0. We also define Dt,k:={∣Ht−Ht+k∣≤e−ηt,Ht>2e−η′t}.
Substep 2.1. Similar to Substep 2.1 in the proof of Theorem 1.4.(1), we have that there exist C2.1,δ2.1>0 such that for all k∈Z+ and t≥0, Pμ[∣Yt,k∣;Dt,kc]≤C2.1e−δ2.1t.
We omit the details.
Substep 2.2. We show that there exist C2.2,δ2.2>0 such that for all k∈Z+ and t≥0, we have Pμ[∣Yt,k∣;Dt,k]≤C2.2e−δ2,2t.
In fact, it can be verified that for all k∈Z+ and t≥0,
[TABLE]
Therefore for all k∈Z+ and t≥0,
[TABLE]
where
[TABLE]
Similar to Substep 2.2 in the proof of Theorem 1.4.(1), we can verify that for all k∈Z+ and t≥0, almost surely Kt,k≤C2.2′′e−(η−3η′)t.
From this and Lemma 3.3 we know that there exists C2.2′′′ such that for all k∈Z+ and t≥0,
[TABLE]
as desired in this substep.
Step 3. We show that I2f(t)dt→∞0.
In order to do this, choose an ϵ∈(0,α) and a γ∈(0,β) close enough to β so that for each p∈N, it holds that αγ~>∣p∣b.
Define Et:={∥Xt∥>e(α−ϵ)t}.
According to Proposition 2.10, there exist C3,δ3>0 such that for each t≥0, ∣Pμ[eiI2f(t)−1;Etc]∣≤2Pμ(Etc)≤C3e−δ3t.
On the other hand, according to Lemma 3.3, we know that there exist C3′,C3′′>0 and δ3′>0 such that
[TABLE]
To sum up we have that Pμ[eiI2f(t)]t→∞1, which completes this step.
Step 4. Combining Steps 1–3, we complete the proof of Theorem 1.4.(3).
∎
Appendix A
A.1. Analytic facts
In this subsection, we collect some useful analytic facts.
Lemma A.1**.**
For z∈C+, we have
[TABLE]
Proof.
Notice that ∣e−z∣=e−Rez≤1.
Therefore, |e^{-z}-1|=\Big{|}\int_{0}^{1}e^{-\theta z}zd\theta\Big{|}\leq|z|.
Also, notice that ∣e−z−1∣≤∣e−z∣+1≤2.
Thus (A.1) is true when n=0.
Now, suppose that (A.1) is true when n=m for some m∈Z+.
Then
Suppose that π is a measure on (0,∞) with ∫(0,∞)(y∧y2)π(dy)<∞.
Then the functions
[TABLE]
are well defined, continuous on C+ and holomorphic on C+0.
Moreover,
[TABLE]
Proof.
It follows from Lemma A.1 that h and h′ are well defined on C+.
According to [42, Theorems 3.2. & Proposition 3.6], h′ is continuous on C+ and holomorphic on C+0.
It follows from Lemma A.1 that, for each z0∈C+, there exists C>0 such that for z∈C+ close enough to z0 and any y>0,
[TABLE]
Using this and the dominated convergence theorem, we have
[TABLE]
which says that h is continuous on C+ and holomorphic on C+0.
∎
For each z∈C∖(−∞,0], we define logz:=log∣z∣+iargz where argz∈(−π,π) is uniquely determined by z=∣z∣eiargz. For all z∈C∖(−∞,0] and γ∈C, we define zγ:=eγlogz.
Then it is known, see [43, Theorem 6.1] for example, that z↦logz is holomorphic in C∖(−∞,0].
Therefore, for each γ∈C, z↦zγ is holomorphic in C∖(−∞,0]. (We use the convention that 0γ:=1γ=0.)
Using the definition above we can easily show that (z1z0)γ=z1γz0γ provided arg(z1z0)=arg(z1)+arg(z0).
It is known, see, for instance, [43, Theorem 6.1.3] and the remark following it, that the Gamma function Γ has an unique analytic extension in C∖{0,−1,−2,…} and that
[TABLE]
Using this recursively, one gets that
[TABLE]
Fix a β∈(0,1).
Using the uniqueness of holomorphic extension and Lemma A.2, we get that
[TABLE]
and similarly that
[TABLE]
Lemma A.2 also says that the derivative of z1+β is (1+β)zβ on C+0.
Lemma A.3**.**
For all z0,z1∈C+, we have
[TABLE]
Proof.
Since z1+β is continuous on C+, we only need to prove the lemma assuming z0,z1∈C+0.
Notice that
[TABLE]
Define a path γ:[0,1]→C+0 such that
[TABLE]
Then, we have
[TABLE]
Suppose that φ(θ) is a continuous function from R into C such that φ(0)=1 and φ(θ)=0 for all θ∈R.
Then according to [41, Lemma 7.6], there is a unique continuous function f(θ) from R into C such that f(0)=0 and ef(θ)=φ(θ).
Such a function f is called the distinguished logarithm of the function φ and is denoted as Logφ(θ).
In particular, when φ is the characteristic function of an infinitely divisible random variable Y, Logφ(θ) is called the Lévy exponent of Y.
This distinguished logarithm should not be confused with the log function defined on C∖(−∞,0].
See the paragraph immediately after [41, Lemma 7.6].
A.2. Feynman-Kac formula with complex valued functions
In this subsection we give a version of the Feynman-Kac formula with complex valued functions.
Suppose that {(ξt)t∈[r,∞);(Πr,x)r∈[0,∞),x∈E} is a (possibly non-homogeneous) Hunt process in a locally compact separable metric space E.
We write
[TABLE]
Lemma A.4**.**
Let t≥0. Suppose that ρ1,ρ2∈Bb([0,t]×E,C) and f∈Bb(E,C).
Then
[TABLE]
is the unique locally bounded solution to the equation
[TABLE]
Proof.
The proof is similar to that of [13, Lemma A.1.5]. We include it here for the sake of completeness.
We first verify that (A.18) is a solution.
Notice that
[TABLE]
Also notice that
[TABLE]
Therefore, from the Markov property of ξ and Fubini’s theorem we get that
[TABLE]
For uniqueness, suppose g is another solution. Put h(r)=supx∈E∣g(r,x)−g(r,x)∣.
Then
[TABLE]
Applying Gronwall’s inequality, we get that h(r)=0 for r∈[0,t].
∎
A.3. Superprocesses
In this subsection, we will give the definition of a general superprocess.
Let E be locally compact separable metric space. Denote by M(E) the collection of all the finite measures on E equipped with the topology of weak convergence.
For each function F(x,z) on E×R+ and each R+-valued function f on E,
we use the convention:
F(x,f):=F(x,f(x)),x∈E.
A process X={(Xt)t≥0;(Pμ)μ∈M(E)} is said to be a (ξ,ψ)-superprocess if
•
the spatial motion ξ={(ξt)t≥0;(Πx)x∈E} is an E-valued Hunt process with its lifetime denoted by ζ;
•
the branching mechanism ψ:E×[0,∞)→R is given by
[TABLE]
where ρ1∈Bb(E), ρ2∈Bb(E,R+) and π(x,dy) is a kernel from E to (0,∞) such that supx∈E∫(0,∞)(y∧y2)π(x,dy)<∞;
•
X={(Xt)t≥0;(Pμ)μ∈M(E)} is an M(E)-valued Hunt process with transition probability determined by
[TABLE]
where for each f∈Bb(E), the function (t,x)↦Vtf(x) on [0,∞)×E is the unique locally bounded non-negative solution to the equation
[TABLE]
We refer our readers to [28] for more discussions about the definition and the existence of superprocesses.
To avoid triviality, we assume that ψ(x,z) is not identically equal to −ρ1(x)z.
Notice that the branching mechanism ψ can be extended into a map from E×C+ to C using (A.24).
Define
[TABLE]
Then according to Lemma A.2, for each x∈E, z↦ψ(x,z) is a holomorphic function on C+0 with derivative z↦ψ′(x,z).
Define ψ0(x,z):=ψ(x,z)+ρ1(x)z and ψ0′(x,z):=ψ′(x,z)+ρ1(x).
Denote by W the space of M(E)-valued càdlàg paths with its canonical path denoted by (Wt)t≥0.
We say X is non-persistent if Pδx(∥Xt∥=0)>0 for all x∈E and t>0.
Suppose that (Xt)t≥0 is non-persistent, then according to [28, Section 8.4], there is a unique family of measures (Nx)x∈E on W such that
(i) Nx(∀t>0,∥Wt∥=0)=0;
(ii) Nx(∥W0∥=0)=0;
and (iii) if N is a Poisson random measure defined on some probability space with intensity Nμ(⋅):=∫ENx(⋅)μ(dx), then the superprocess {X;Pμ} can be realized by X0:=μ and Xt(⋅):=N[Wt(⋅)] for each t>0.
We refer to (Nx)x∈E as the Kuznetsov measures of X.
A.4. Semigroups for superprocesses
Let X be a non-persistent superprocess with its Kuznetsov measure denoted by (Nx)x∈E.
We define the mean semigroup
[TABLE]
It is known from [28, Proposition 2.27] and [27, Theorem 2.7] that for all t>0, μ∈M(E) and f∈Bb(E,R+),
[TABLE]
Define
[TABLE]
Using monotonicity and linearity, we get from (A.29) that
[TABLE]
This says that the random variable ⟨Xt,f⟩ is well defined under probability Pδx provided f∈L1(ξ).
By the branching property of the superprocess, Xt(f) is an infinitely divisible random variable.
Therefore, we can write
[TABLE]
as its characteristic exponent.
According to Campbell’s formula, see [27, Theorem 2.7] for example, we have
[TABLE]
Noticing that θ↦Nx[eiθWt(f)−1] is a continuous function on R and that Nx[eiθWt(f)−1]=0 if θ=0, according to [41, Lemma 7.6], we have
[TABLE]
Lemma A.5**.**
There exists a constant C≥0 such that
for all f∈L1(ξ),x∈E and t≥0, we have
[TABLE]
Proof.
Noticing that
eReUtf(x)=∣eUtf(x)∣=∣Pδx[eiXt(f)]∣≤1,
we have
[TABLE]
Therefore, we can speak of ψ(x,−Utf) since z↦ψ(x,z) is well defined on C+.
According to Lemma A.1, we have that
[TABLE]
Notice that, for any compact K⊂R,
[TABLE]
Therefore, according to [12, Theorem A.5.2] and (A.33), Ut(θf)(x) is differentiable in θ∈R with
[TABLE]
Moreover, from the above, it is clear that
[TABLE]
It follows from the dominated convergence theorem that (∂/∂θ)Ut(θf)(x) is continuous in θ.
In other words, θ↦−Ut(θf)(x) is a C1 map from R to C+.
Thus,
[TABLE]
Notice that
[TABLE]
where C1,C2 are constants independent of f,x and t.
Now, combining the display above with (A.39) and (A.38) we get the desired result.
∎
This lemma also says that if f∈L2(ξ), then
\Pi_{x}\Big{[}\int_{0}^{t}\psi(\xi_{s},-U_{t-s}f)ds\Big{]}\in\mathbb{C},x\in E,t\geq 0,
is well defined.
In fact, using Jensen’s inequality and the Markov property, we have
[TABLE]
A.5. A complex-valued non-linear integral equation
Let X be a non-persistent superprocess.
In this subsection, we will prove the following:
Proposition A.6**.**
If f∈L2(ξ), then for all t≥0 and x∈E,
[TABLE]
[TABLE]
To prove this, we will need the generalized spine decomposition theorem from [34].
Let f∈Bb(E,R+), T>0 and x∈E.
Suppose that Pδx[XT(f)]=Nx[WT(f)]=PTρ1f(x)∈(0,∞), then we can define the following probability transforms:
[TABLE]
Following the definition in [34], we say that {ξ,n;Qx(f,T)} is a spine representation of Nx⟨WT,f⟩ if
•
the spine process {(ξt)0≤t≤T;Qx(f,T)} is a copy of {(ξt)0≤t≤T;Πx(f,T)}, where
[TABLE]
•
given {(ξt)0≤t≤T;Qx(f,T)}, the immigration measure
{n(ξ,ds,dw);Qx(f,T)[⋅∣(ξt)0≤t≤T]}
is a Poisson random measure on [0,T]×W with intensity
[TABLE]
•
{(Yt)0≤t≤T;Qx(f,T)} is an M(E)-valued process defined by
[TABLE]
According to the spine decomposition theorem in [34], we have that
Assume that f∈Bb(E).
Fix t>0,r∈[0,t),x∈E and a strictly positive g∈Bb(E).
Denote by {ξ,n;Qx(g,t)} the spine representation of NxWt(g).
Conditioned on {ξ;Qx(g,t)}, denote by m(ξ,ds,dw) the conditional intensity of n in (A.53).
Denote by Πr,x the probability of Hunt process {ξ;Π} initiated at time r and position x.
From Lemma A.1, we have Qx(g,t)-almost surely
[TABLE]
Using this, Fubini’s theorem, (A.33) and (A.35) we have Qx(g,t)-almost surely,
[TABLE]
Therefore, according to (A.56), Campbell’s formula and above, we have that
[TABLE]
Let ϵ>0.
Define f+=(f∨0)+ϵ and f−=(−f)∨0+ϵ, then f± are strictly positive and f=f+−f−.
According to (A.55), we have that
Since {(ξr+t)t≥0;Πr,x}=d{(ξt)t≥0;Πx}, we have
[TABLE]
From (A.45), we know that for each θ∈R, (t,x)↦∣ψ′(x,−Utf(x))∣ is locally bounded (i.e. bounded on [0,T]×E for each T≥0).
Therefore, we can apply Lemma A.4 and get that
[TABLE]
and
[TABLE]
Integrating the two displays above with respect to θ on [0,1], using
Fubini’s theorem, (A.38), (A.39) and (A.45), we get
[TABLE]
and
[TABLE]
Taking r=0, we get that (A.49) and (A.50) are true if f∈Bb(E).
The rest of the proof is to evaluate (A.49) and (A.50) for all f∈L2(ξ). We only do this for (A.49) since the argument for (A.50) is similar.
Let n∈N.
Writing fn:=(f+∧n)−(f−∧n), then fnn→∞f pointwise.
From what we have proved, we have
[TABLE]
Note that
(i) Πx[fn(ξt)]n→∞Πx[f(ξt)];
(ii) by (A.33), the dominated convergence theorem and the fact that
[TABLE]
we have Utfn(x)n→∞Utf(x), and (iii) by the dominated convergence theorem, (A.46) and the fact (see (A.34)) that
[TABLE]
we get that Πx[∫0tψ(ξs,−Ut−sfn)ds]n→∞Πx[∫0tψ(ξs,−Ut−sf)ds].
Using these, letting n→∞ in (A.77), we get the desired result.
∎
Acknowledgment
We thank Zenghu Li and Rui Zhang for helpful conversations.
We also thank the referee for very helpful comments.
Bibliography44
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 (2015), no. 42, 35 pp.
2[2] S. Asmussen, Convergence rates for branching processes , Ann. Probab. 4 (1976), no. 1, 139–146.
3[3] S. Asmussen and H. Hering, Branching processes , Progress in Probability and Statistics, 3. Birkhäuser Boston, Inc., Boston, MA, 1983.
4[4] K. B. Athreya, Limit theorems for multitype continuous time Markov branching processes. I. The case of an eigenvector linear functional , Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 12 (1969), 320–332.
5[5] K. B. Athreya, Limit theorems for multitype continuous time Markov branching processes. II. The case of an arbitrary linear functional , Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 13 (1969), 204–214.
6[6] K. B. Athreya, Some refinements in the theory of supercritical multitype Markov branching processes , Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 20 (1971), 47–57.
7[7] J. Bertoin, Lévy processes . Cambridge Tracts in Mathematics, 121. Cambridge University Press, 1996.
8[8] J. Bertoin, B. Roynette and M. Yor, Some connections between (sub)critical branching mechanisms and Bernstein functions . ar Xiv:0412322.