This paper establishes functional Erdős-Rényi laws for Lévy processes, providing limit theorems for sets of functions related to their increments under large deviations principles.
Contribution
It introduces new conditions linking large deviations principles to functional Erdős-Rényi laws for Lévy processes, expanding understanding of their sample path behavior.
Findings
01
Derived conditions for convergence from large deviations principles.
02
Established limit theorems under exponential moment assumptions.
03
Connected large deviations to functional laws for Lévy processes.
Abstract
In this paper we establish functional Erd\H{o}s-Renyi laws for L\'evy processes, i.e. limit theorems for sets of functions on [0,1] associated to their increments. First, we determine precise conditions under which, in a general framework, such a convergence is derived from a large deviations principle for probability measures induced by the sample paths of such a process. Then, by checking that these conditions are fulfilled, we obtain, under two usual assumptions on exponential moments, such limit theorems from well-known large deviations principles.
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 financial applications · Complex Systems and Time Series Analysis · Advanced Thermodynamics and Statistical Mechanics
Full text
Functional Erdős-Rényi laws for the increments of Lévy processes
D. Rabenoro
(Received: date / Accepted: date)
Abstract
We establish functional forms of the Erdős-Rényi law of large numbers for the increments of Lévy processes. The proofs treat in parallel the cases of two different natural assumptions of finiteness of exponential moments and are based on functional large deviations principles.
Keywords
Large deviations - Lévy processes - Erdős-Rényi laws.
1 Introduction
Let (Xi)i≥1 be an i.i.d. sequence of centered R
-valued random variables. For any t≥1, set S(t):=i=1∑⌊t⌋Xi where ⌊t⌋ is the integer part of t. By the Erdős-Rényi law of large numbers (see [12]), if E[exp(θX1)]<∞ for all θ∈R, then for An:=⌊clogn⌋ with c>0 and n∈N∗, there exists a constant αc such that
[TABLE]
It follows from (\refERclassic) that for aT:=clogT with c>0 and T>1,
[TABLE]
Let {S(t):t≥0} be the partial sum process. For
x≥0, consider the whole path of S(⋅) between x and x+aT, that is introduce the standardized increment function γx,aT of S(⋅) defined for s∈[0,1] by
[TABLE]
A functional Erdős-Rényi law [FERL] is a strong limit theorem, as T→∞, for sets of functions of that form. If E[exp(θX1)]<∞ for θ in a neighborhood of [math], a FERL is obtained in [6], for the sets (GT)T>1 defined by
[TABLE]
This result extends FERL’s proved in [3] and [20], under a more general assumption, and implies (\refERclassic). Such a FERL is derived in [14], when X1 has a semiexponential distribution. More recently, in [10] and [16], FERL’s have been obtained for some processes which are variants of {S(t):t≥0}.
In the present paper, we establish FERL’s for sets of standardized increment functions of Lévy processes. Given a Lévy process {Z(t):t≥0}, setting An:=⌊clogn⌋ with c>0 and n∈N∗, these functions are defined by
[TABLE]
We obtain FERL’s for the sets (Ln)n>1 defined by
[TABLE]
under each of assumptions (C) and (A) below, on the moment-generating function [mgf] Φ of Z(1), where Φ(θ)=E[exp(θZ(1))]∈(0,∞], for θ∈R.
(C)Φ(θ)<∞ for all θ∈R.
(A)Φ(θ)<∞ for θ in a neighborhood of [math].
Our proofs are based on large deviations principles [LDP] in functional spaces. Under (C), in [24], such LDP’s are proved in the Skorohod space D(0,1). If only (A) holds, under additional conditions on the Lévy process, its sample paths have a.s. finite variations. In this case, such LDP’s have been obtained in [17], in the space BV0(0,1) of functions f∈D(0,1) of bounded variations on [0,1] with f(0)=0, endowed with the weak topology. We emphasize on the similarity of structure of the proofs under each assumption (C) and (A), which extends that of the functional spaces D(0,1) and BV0(0,1), itself pointed out at the end of Sect. 3. Thus, the main steps of these proofs are treated in parallel.
Instead of viewing our FERL’s as generalizations of (\refERclassic), one could consider them directly in the framework of functional limit theorems [FLT]’s. In that setting, for any increments (αn)n>1, we introduce the increment functions νx,αn defined by
[TABLE]
Assume that lognαn→δ∈(0,∞] as n→∞. We say that the increments αn are large (resp. intermediate) if δ=∞ (resp. δ<∞). Given a real sequence (βn)n>1, we seek FLT’s for sets of rescaled increment functions (Mn)n>1 of the form
[TABLE]
For large increments, we obtain FLT’s for (Mn)n>1, with a specific choice of (βn)n>1, by applying an invariance principle [IP] which is derived from results of [9]. This approach is detailed in the Appendix (See Proposition 6). However, it is not possible to follow this method for intermediate increments (See Remark 2 in the Appendix). For such increments, our approach by LDP’s appears as an alternative to the IP one and our FERL’s are FLT’s for (Mn)n>1, with βn=αn=⌊clogn⌋, for any c>0.
The remainder of the present paper is organized as follows. In Sect. 2 and Sect. 3, we present general results on Lévy processes and functional spaces which will be needed in our proofs. Our main results are stated in Sect. 4, with proofs detailed in Sect. 5. Some technical results are deferred to the Appendix.
2 Lévy Processes
In this paper, a stochastic process is a family {Z(t):t≥0} of R-valued random variables defined on a common probability space (Ω,F,P). For all t≥0, the image of ω∈Ω by the random variable Z(t) is denoted by Z(t,ω). For all ω∈Ω, the sample path t∈[0,∞)↦Z(t,ω) is denoted by Z(⋅,ω).
2.1 Construction of Lévy Processes
Definition 1**.**
For any interval I, D(I) is the set of functions on I which are
right-continuous with left-hand limits. On D([0,1]), denoted by D(0,1), the Skohorod topology S is induced by the distance
[TABLE]
where Λ is the class of strictly increasing, continuous mappings of
[0,1] onto itself.
Definition 2**.**
A Lévy process {Z(t):t≥0} is a stochastic process such that:
(i)* Z(0)=0 a.s. (ii) The process has stationary and independent increments and is stochastically continuous.
(iii) For all ω in some set of probability 1, the sample path Z(⋅,ω) lies in D([0,∞)).*
Definition 3**.**
For any interval I, let RI be the set of all functions from I to R. Let CI be the class of cylinder sets, that is sets of the form
[TABLE]
for n≥1, (ti)1≤i≤n∈In and (Bi)1≤i≤n∈(BR)n, where BR is the Borel σ-algebra of R.
Let Ω=R[0,∞). Let F be the
σ-algebra on Ω generated by C[0,∞).
Theorem 1**.**
For any Lévy process {Z(t):t≥0}, the distribution PZ(1) of Z(1) is an infinitely divisible distribution [IDD]. Conversely, given an IDD μ on R, there exists a unique probability measure P on (Ω,F) and a Lévy process {Z(t):t≥0} on (Ω,F,P) such that PZ(1)=μ and for all ω∈Ω, the path Z(⋅,ω) lies in D([0,∞)).
Proof.
For all t≥0, let X(t) be the measurable map from (Ω,F) to (R,BR) defined by X(t,ω)=ω(t). Then, by Section 11 of [21], there exists a unique probability measure P on (Ω,F) such that {X(t):t≥0} is a Lévy process with PX(1)=μ. Now, it follows from Chapter 14 of [4] that one can define on (Ω,F,P) a process {Z(t):t≥0} such that (\refpathsD) holds and for all t≥0, P(Z(t)=X(t))=1. Therefore, {Z(t):t≥0} is also a Lévy process with PZ(1)=μ.
∎
Throughout the sequel, we will assume that all stochastic processes are defined on (Ω,F,P) and that for all
Lévy process{Z(t):t≥0},
[TABLE]
2.2 Generating triplet
By the Lévy-Khintchine formula, there is a one-to-one correspondence between IDD’s and triplets (A,ν,γ) where A≥0, ν is a measure on R such that ν({0})=0 and ∫R(x2∧1)ν(dx)<∞, and γ∈R. Then, by Theorem 1, a Lévy process {Z(t):t≥0} is associated to a triplet (A,ν,γ), called its generating triplet. A is the variance of the Gaussian component of the process and ν is its Lévy measure.
Proposition 1**.**
Let {Z(t):t≥0} be a Lévy process with generating triplet (A,ν,γ), associated to an IDD μ. Assume that (A) holds. Then, for all t≥0,
[TABLE]
Proof.
Jensen’s inequality implies that for all θ>0,
[TABLE]
Therefore, under (A), E[∣Z(1)∣]<∞. We deduce from Theorem 25.3 in [21] that ∫∣x∣>1∣x∣ν(dx)<∞, which implies in turn that for all t≥0, E[∣Z(t)∣]<∞. Now, for any t≥0, the characteristic function of PZ(t) is (μ)t, where μ is the characteristic function of μ=PZ(1). Since E[∣Z(1)∣]<∞ and E[∣Z(t)∣]<∞,
[TABLE]
∎
Theorem 2**.**
Let {Z(t):t≥0} be a Lévy process with generating triplet (A,ν,γ). Assume that A=0 and ∫∣x∣≤1∣x∣ν(dx)<∞. Then, a.s., the sample path Z(⋅,ω) has finite variation on (0,t], for any t∈(0,∞).
By Lemma 1, it is enough to prove that for any Γ∈C[0,1]D,
[TABLE]
Set F:={ω∈Ω:Z(x+⋅\leavevmodeλ,ω)∈Γ}. It follows from the definition of C[0,1]D that we can write F=F1∩F2, with
[TABLE]
where n≥1, (ti)1≤i≤n∈[0,1]n and (Bi)1≤i≤n∈(BR)n. Then, (\refpathsD) implies that F1=Ω, while clearly, F2∈F. So, F∈F. We conclude the proof since, on the other hand,
[TABLE]
∎
Lemma 3**.**
Let x≥0. For any u>0,
[TABLE]
Proof.
By (\refpathsD), for all ω∈Ω, Z(x+⋅\leavevmode,ω)−Z(x) is right-continuous. So,
[TABLE]
where {τk:k∈N}:=[0,1]∩Q.
We deduce as in the proof of Lemma 2 that (\refmeasSup) holds, since
[TABLE]
∎
2.3.2 Invariance
Lemma 4**.**
Let x≥0 and λ>0. Then, for any B∈BS,
[TABLE]
Proof.
Proposition 10.7. in [21] implies that for all
B∈C[0,∞),
[TABLE]
So, (\refinvaLevy) holds for all
B∈C[0,1]D⊂C[0,∞) and so for all B∈σ(C[0,1]D)=BS.
∎∎
Lemma 5**.**
Let x≥0. For any u>0,
[TABLE]
Proof.
We deduce (\refInvaSup) from the proofs of Lemmas 3 and 4.
∎
Let BV0(0,1) be the set of functions f on [0,1] such that
(i)* f(0)=0.*
(ii)* f is of bounded variations on [0,1].*
(iii)* f is right-continuous on [0,1].*
Proposition 3**.**
Under the assumptions of Theorem 2, for all x≥0 and
λ>0,
[TABLE]
Proof.
Since BV0(0,1)⊂D(0,1), this follows from Theorem 2
and Proposition 2.
∎
In this section, we study the properties of the functional spaces in which the increment functions lie. Let E be a functional space and
d a distance defined on E. For f∈E and
ϵ>0, let BdE(f,ϵ) be the following open ball:
[TABLE]
Let C(0,1) be the set of continuous functions on [0,1], on which we define the uniform distance defined by
[TABLE]
We will often replace the distance d by a notation for the topology induced by d. Sometimes, we will omit the reference to the interval [0,1] for the functional space. For example, BdUD(0,1) will be denoted by BUD.
3.1 Uniform topology on D(0,1)
On D(0,1), we present the relationships between the Skorohod and the uniform topology U, induced by dU. We denote by U0 be the σ-algebra generated by the open balls of (D(0,1),U).
Lemma 6**.**
(i)* On D(0,1), U is stronger than S.*
(ii)* The restriction of S to C(0,1) coincides there with
U.*
(iii)* U0=BS.*
Proof.
In [2], see Section 12 for (i), (ii) and Section 15 for (iii).
∎
Lemma 7**.**
Let K be a compact subset of (C(0,1),U) and ϵ>0. Then, there exists ζ>0 such that for all g∈K,
[TABLE]
Therefore,
[TABLE]
Proof.
For any f∈C(0,1), let ωf be the modulus of continuity of f, defined for δ>0 by
[TABLE]
By the Arzelà-Ascoli theorem, for all ϵ>0, there exists
δϵ>0 such that
[TABLE]
Let g∈K and ϵ>0. Set ζ:=min{δϵ;2ϵ}. By (\refdefsko), for all h∈BSD(g,ζ), there exists νh∈Λ satisfying
[TABLE]
The first part of (\refnuH) combined to (\refmoduleC) imply that ∥g∘νh−g∥≤wg(∥νh−I∥)<2ϵ, which combined to the second part of (\refnuH) implies that
[TABLE]
Therefore, h∈BUD(g,ϵ).
∎
3.2 The space BV0(0,1)
Definition 5**.**
Let Mf(0,1) be the space of totally bounded signed measures on [0,1].
Theorem 3**.**
For any μ∈Mf(0,1), let Fμ be its distribution function, defined by
[TABLE]
Then, Fμ∈BV0(0,1) and the map D:μ↦Fμ is a bijection between Mf(0,1) and BV0(0,1). Moreover, the inverse function D−1 is defined by D−1(F)=dF.
Let C(0,1)∗ be the topological dual space of (C(0,1),U), that is the space of continuous linear functionals from (C(0,1),U) to R. The weak-∗ topology is the coarsest topology on C(0,1)∗ such that for all ϕ∈C(0,1), the map Tϕ from C(0,1)∗ to R defined by Tϕ(Λ)=⟨Λ,ϕ⟩ remains continuous.
For any F∈BV0(0,1), let ΛF be the element of C(0,1)∗ such that for all ϕ∈C(0,1), ⟨ΛF,ϕ⟩ is the following Riemann-Stieltjes integral:
[TABLE]
Theorem 4**.**
The map Ξ:F↦ΛF is a bijection from BV0(0,1) to C(0,1)∗.
Proof.
By the Riesz representation theorem, for any μ∈Mf(0,1), there exists a unique Λ(μ)∈C(0,1)∗ such that for all
ϕ∈C(0,1),
[TABLE]
In other words, the map R:μ↦Λ(μ) is a bijection between Mf(0,1) and C(0,1)∗. Then, Ξ is a bijection, since Ξ=R∘D−1.
∎
Definition 7**.**
Consider the bijection Ξ:BV0(0,1)⟶C(0,1)∗ and endow C(0,1)∗ with the weak-∗ topology. Then, the weak topology W on BV0(0,1) is the inverse image topology, so that Ξ defines a homeomorphism.
Corollary 1**.**
A net (fα) in BV0(0,1) convergent to
f in (BV0(0,1),W) if and only if
[TABLE]
3.2.2 The space (BV0,M(0,1),W)
Definition 8**.**
For f∈BV0(0,1), let ∣f∣v be its total variation. For M>0, let
[TABLE]
Recall that (BV0(0,1),W) is not metrizable (see Remark
1.2. in [7]). However, it follows from the Banach-Alaoglu theorem that for any M>0, the restriction of W to BV0,M(0,1) is metrizable. By the Corollary below, the following distance dH on BV0(0,1) provides such a metric.
[TABLE]
We will denote by H the topology induced by dH on any set on which dH is defined.
Lemma 8**.**
*A net (fα) in BV0(0,1) is weakly convergent to
f∈BV0(0,1) if and only if both following conditions hold.
1) There exists a positive constant M<∞ such that fα is ultimately in BV0,M(0,1).
It is enough to prove that for all g∈BV0(0,1), the map
θg from (BV0(0,1),W) to [0,∞) defined by θg(f)=dH(f,g) is continuous. Let (fα) be a net in BV0(0,1) weakly converging to f in BV0(0,1). Then, by Lemma 8,
[TABLE]
Therefore, the net (θg(fα)) converges to θg(f)∈R, and so θg is continuous.
∎
3.2.4 Comparison of W and S
Lemma 11**.**
(i)* Let M>0. Then, on BV0,M(0,1), S is stronger than H.*
(ii)* For any M>0, BV0,M(0,1) is a closed subset of (D(0,1),S).*
Proof.
Let (fn)n≥1 be a sequence of functions in D(0,1) and f∈D(0,1). Then,
[TABLE]
which can be found in [6]. This proves (i). For (ii), let (fn)n≥1 be any sequence of elements of BV0,M(0,1) which is S-convergent to f∈D(0,1). First, Lemma 9 implies that there exists a subsequence (fϕ(n))n≥1 which converges weakly to some f∈BV0,M(0,1). By Lemma 8, dH(fϕ(n),f)n→∞⟶0. On the other hand, it follows from (\refCVskoCVhog) that dH(fϕ(n),f)n→∞⟶0. So, f=f∈BV0,M(0,1), which proves (ii).
∎
Lemma 12**.**
Let BW be the Borel σ-algebra of
(BV0(0,1),W). Then,
[TABLE]
Proof.
It is enough to prove that for any closed subset Γ of
(BV0(0,1),W) and for all M∈N, ΓM:=Γ∩BV0,M(0,1)∈BS. Now, for all M∈N, ΓM is a closed subset of (BV0,M(0,1),W). Combining Corollary 2 and Lemma 11(i), we deduce that ΓM is a closed subset of (BV0,M(0,1),S) and so of (D(0,1),S), by Lemma 11(ii).
∎
Corollary 3**.**
Let H0 be the σ-algebra generated by the open balls of (BV0(0,1),H). Then,
Let E be a topological space, endowed with a topology T and its Borel σ-algebra, denoted by BT. A function I:E⟶[0,∞) is a rate function if I is lower semicontinuous. Moreover, we say that I is a good rate function if for all α<∞, the sublevel set Kα:={f∈E:I(f)≤α} is compact.
Definition 10**.**
A family of probability measures (Pλ)λ≥0 on
(E,BT) satisfies a large deviations principle [LDP] in (E,T), with rate function I when, for any closed (resp. open) subset F (resp. G) of T,
[TABLE]
and
[TABLE]
where for any non-empty subset A of E, I(A):=f∈AinfI(f). Then, (\refupperBd) and (\reflowerBd) are called respectively the upper bound and the lower bound of the LDP.
For λ>0, let Pλ be the distribution of Zλ(⋅), where for s∈[0,1],
[TABLE]
Then, we state hereunder the LDP results for the distributions
(Pλ)λ>0, on which our proofs rely. The rate functions depend on the Legendre transform Ψ of Φ defined by
[TABLE]
Theorem 5**.**
Assume that (C) holds. Then, the distributions (Pλ)λ>0 satisfy a LDP in (D(0,1),S), with good rate function I defined on D(0,1) by
When only (A) holds, we need to introduce the following notations. For f∈BV0(0,1), write f=f+−f−, where df=df+−df− is the Hahn-Jordan decomposition of df. For g∈BV0(0,1), write g=gA+gS, where dg=dgA+dgS is the Lebesgue decomposition of dg into an absolutely continuous and a singular component. Then, define the function J on BV0(0,1) by
[TABLE]
where θ0:=sup{θ:Φ(θ)<∞}>0 and θ1:=inf{θ:Φ(θ)<∞}<0.
Theorem 6**.**
Let {Z(t):t≥0} be a Lévy process with generating triplet (A,ν,γ). Assume that A=0 and ∫∣x∣≤1∣x∣ν(dx)<∞, so that for all λ>0, the sample paths Zλ(⋅,ω) lie a.s. in BV0(0,1). Then, under (A), the distributions (Pλ)λ>0 satisfy a LDP in (BV0(0,1),W), with good rate function J.
We summarize in the following array the features which are common to the functional spaces (D(0,1),S) and (BV0(0,1),W). They are described in points (1)-(6) below, which follow from the preceding results. Throughout the sequel, we will denote by E one or the other of these spaces of functions on [0,1].
[TABLE]
(1) For all x≥0 and λ>0, ηx,λ∈E a.s.
(2)T is a topology on E such that
(E,T) is a topological vector space.
(3)d is a distance on E, derived from a norm.
(4)E is a convex subset of E such that the restriction of T to E is induced by d.
(5)I is a convex good rate function on E.
(6) The distributions (Pλ)λ>0 defined by
(\refPlambda) satisfy a LDP in (E,T) with rate function I.
For any subset A⊂E and ϵ>0, set
[TABLE]
In the sequel, for all α>0, Kα denotes either a sublevel set associated to I or J. Thus, we set generically
[TABLE]
Lemma 13**.**
For all α>0, Kα⊂E.
Proof.
If E=D(0,1), this follows from the definition of I. If E=BV0(0,1), this is (3.9) in [6].
∎
Lemma 14**.**
For all α>0, Kα is a compact subset of (E,d).
Proof.
Let V be an open subset of (E,d). Then, V∩E is an open subset of (E,d)=(E,TE), by (4). So, V∩E=U∩E, where U is an open subset of (E,T). We deduce readily that a compact subset of (E,T) contained in E is a compact subset of (E,d). Now, (5) and Lemma 13 imply that for all α>0, Kα is a compact subset of (E,T) contained in E, which concludes the proof.
∎
Lemma 15**.**
For all α>0 and ϵ>0,
[TABLE]
Proof.
By Lemma 14, Kα is separable in (E,d). Then, Lemma 1 in Section 6 of [2] implies that (Kα)ϵ,d∈D0, where D0 is the σ-algebra generated by the open balls of (E,d). If (E,d)=(D(0,1),dU), then D0=BS, by Lemma 6(iii). If (E,d)=(BV0(0,1),dH), then D0=BS, by Corollary 3. This proves (\refmeasKeps) in both cases.
∎
4 Functional Erdős-Rényi laws
Let c>0. For n>1, set
[TABLE]
and for G⊂[0,∞), set
[TABLE]
If G=[0,∞), we will write indifferently
LnG or Ln. Throughout the sequel, G will be a subset of [0,∞). For any sequence (En)n>1 of subsets of Ω, set
[TABLE]
where ultimately (resp. infinitely often) has been abbreviated as ult. (resp. i.o.).
4.1 Measurability issues
Lemma 16**.**
Assume that G is at most countable. Then, for all α>0 and ϵ>0,
Now, MϵG is an at most countable intersection of such sets. Therefore, MϵG∈F.
∎
Lemma 17**.**
Assume that G is at most countable. Then, for all g∈Kα and ϵ>0,
[TABLE]
Proof.
Set InG:=[0,n−An]∩G. For all g∈Kα, ϵ>0 and n>1,
[TABLE]
We deduce from Lemma 2 that it is enough to prove that
BdE(g,ϵ)∈BS. Then, Lemma 6(iii) implies that BUD(g,ϵ)∈U0=BS and it follows from Corollary 3 that BHBV(g,ϵ)∈BS.
∎
4.2 Preliminary results
We make the choice not to consider the completion of the probability space (Ω,F,P), in order to avoid confusions. We will say that an event M⊂Ω (not necessarily in F) happens almost surely (a.s.) if M⊃M′ with M′∈F and P(M′)=1.
Definition 11**.**
We say that the FERL holds for (LnG)n>1 in (E,d) with limit set Kα if, for all ϵ>0, a.s.
[TABLE]
and
[TABLE]
Hereabove, (\refLnGsubsetK) and (\refKsubsetLnG) will be called respectively the upper and lower bound for LnG. The reason is that their proofs rely respectively on the upper and the lower bound in functional LDP’s.
Proposition 4**.**
For μ∈R, let {Zμ(t):t≥0} be the Lévy process defined by
[TABLE]
For G⊂[0,∞) and n>1, set (LnG)μ:={ηx,Anμ:x∈[0,n−An]∩G}, where
[TABLE]
If the FERL holds for (LnG)n>1 with limit set Kα:={f∈E:I(f)≤α}, then it holds for ((LnG)μ)n>1 with limit set (Kα)μ:={f∈E:Iμ(f)≤α}.
Proof.
See Appendix.
∎
Corollary 4**.**
Assume that (A) holds. Then, in order to establish the FERL, one can assume that {Z(t):t≥0} is centered, which means that for all t≥0, E[Z(t)]=0.
Proof.
Under (A), by Proposition 1, for all t≥0, E[Z(t)]=tE[Z(1)]. For t≥0, set
Z(t):=Z(t)−tE[Z(1)]. If the FERL holds for the centered Lévy process {Z(t):t≥0}, then Proposition 4, applied with μ=E[Z(1)], implies that it holds for {Z(t):t≥0}.
∎
Proposition 5**.**
Assume that the FERL holds for (LnG)n≥1 in (E,d), with limit set Kα. Then, for any continuous map Θ:(E,d)⟶R,
[TABLE]
Proof.
See Appendix.
∎
4.3 Main results
Theorem 7**.**
Assume that (C) holds. Then, for any c>0, the FERL holds for
(Ln)n>1 in (D(0,1),dU), with limit set
[TABLE]
Proof.
Since (C) implies (A), by Corollary 4, one can assume that {Z(t):t≥0} is centered. Then, Lemma 24 (resp. 26) provides the upper (resp. lower) bound.
∎
Theorem 8**.**
Let {Z(t):t≥0} be a Lévy process with generating triplet (A,ν,γ) such that A=0 and ∫∣x∣≤1∣x∣ν(dx)<∞. Assume that (A) holds. Then, for any c>0, the FERL holds for (LnN)n>1 in (BV0(0,1),dH), with limit set
[TABLE]
Proof.
Lemma 21 provides the upper bound. By Corollary 4, one can assume that {Z(t):t≥0} is centered. So, Lemma 27 gives the lower bound.
∎
Corollary 5**.**
Let c>0. Under (C), for any continuous map
Θ:(D(0,1),U)→R,
[TABLE]
In particular, since Θ:f↦f(1) is such a map,
[TABLE]
Under the assumptions of Theorem 8, for a continuous map Θ:(BV0(0,1),dH)→R,
[TABLE]
Proof.
This follows from Proposition 5, and Theorems
7 and 8.
∎
4.4 Examples
4.4.1 Continuous paths
Let {Z(t):t≥0} be a Lévy process with continuous paths, that is a brownian motion with drift. So, Theorem 7 yields the FERL for {Z(t):t≥0}, since it satisfies
(C).
4.4.2 Compound Poisson process
Let {Yi:i≥1} be a sequence of i.i.d. random variables. Let {N(t):t≥0} be a homogeneous, right-continuous Poisson process of parameter λ, which is assumed to be independent of {Yi:i≥1}. For any t≥0, set
[TABLE]
The compound Poisson process {SN(t):t≥0} is a Lévy process with generating triplet such that ∫∣x∣≤1∣x∣ν(dx)≤ν(R)=λ<∞ and A=0. The mgf Φ is such that for θ∈R, Φ(θ)=exp[λ(ΦY1(θ)−1)], where ΦY1 is the mgf of Y1. Therefore, if ΦY1(θ)<∞ for all θ in R (resp. in a neighborhood of [math]) then (C) (resp. (A)) holds.
4.5 Discussion and open problems
4.5.1 Upper bound for Ln under (A)
We obtain the FERL for LnN under (A) in Theorem 8, which contains the lower bound for Ln. Since the tail of Z(1) is heavier than under (C), the fluctuations of the increments are more often wide, so that it is more difficult to derive the upper bound for the whole Ln. By Corollary 6 in Sect. 5, it would be enough to prove that for all ϵ>0,
[TABLE]
where for all n>1, ΔnH(ϵ):=x∈[0,n−An]⋃{dH(ηx,An,η⌊x⌋,An)≥ϵ}. As illustrated by Remark 1 in Sect. 5, the proof of (\refdeltaNjCVdisc) is still an open question. However, Theorem 9 below, proved in [13], is a manifestation of the FERL for Ln under (A).
Theorem 9**.**
Assume that (A) holds. For any c large enough, set aT:=clog(T). Then, there exists a constant βc such that
[TABLE]
4.5.2 Rate of convergence
For the result of [12], an almost sure central limit theorem has been obtained in [8], yielding a rate of convergence of order knlog(kn) in (\refERclassic). For functional versions, it is natural to study the rate of convergence, which is called rate of clustering in the framework of FLT’s (see [11]). For our FERL’s, such a rate would be provided by a sequence (ϵn)n≥1 converging to [math] such that, with the notations of Definition 11,
[TABLE]
This is an open question, included for the FERL’s for partial sums recalled in the Introduction.
5 Proof of main results
Throughout the sequel, we will denote by N the class of negligible sets, that is
[TABLE]
Let n>1. Let D (resp. Dn) be the set of all maps from [0,∞) (resp. [0,n−An]) to D(0,1). Given a subset E of D, Dn∩E is viewed as the set of restrictions to [0,n−An] of the elements of E. For ω∈Ω, Ln(ω):={ηx,An(⋅,ω):0≤x≤n−An} is identified with the map of
Dn defined by x↦ηx,An(⋅,ω).
For any integer j>1, set nj:=max{n:An=j}, so that
[TABLE]
Lemma 18**.**
Let E⊂D. Assume that one of the following conditions holds.
(i)* {LnjG∈Dnj∩E\leavevmode ult. in j}∈Nc.*
(ii)* For all j>1, {LnjG∈Dnj∩E}∈F and j>1∑P(LnjG∈/Dnj∩E)<∞.*
Then, {LnG∈Dn∩E\leavevmode ult.}∈Nc.
Proof.
By the Borel-Cantelli lemma, (ii) implies (i). Now, assume that (i) holds. For j>1, by definition of nj, if nj<n≤nj+1, then An=Anj+1=j+1. Therefore, for all x∈[0,n−An]⊂[0,nj+1−Anj+1], we have that ηx,An=ηx,Anj+1. So, for such n, we have that Ln⊂Lnj+1. So, {LnG∈Dn∩E\leavevmode ult.}⊃{LnjG∈Dnj∩E\leavevmode ult. in j}.
∎
5.1 Upper bounds for LnN
5.1.1 A general result on rate functions
Lemma 19**.**
Let (E,d) be a metric space. Let I be a good rate function on (E,d), so that for all α>0,
Kα:={f∈E:I(f)≤α} is compact. Then, for all ϵ>0,
[TABLE]
Proof.
By definition of Kα, Iα,ϵ≥α. Suppose that Iα,ϵ=α. Then, there exists a sequence (xn) such that, for all n≥1,
xn∈/(Kα)ϵ;d and I(xn)↘α. So there exists N∈N such that for all n≥N, I(xn)≤α+1, so that xn∈Kα+1 which is a compact set. Hence there exists a subsequence (xnk)k≥1 which converges to ℓ∈Kα+1, as k→∞. Since I is lower semicontinuous, I(ℓ)≤k→∞limI(xnk)=α, so that ℓ∈Kα. However, recall that for all n≥1, xn∈/(Kα)ϵ;d which implies that for all k≥1, d(xnk,ℓ)≥ϵ. This leads to a contradiction.
∎
5.1.2 Upper bound for LnN under (C)
Lemma 20**.**
Assume that (C) holds. Then, for any ϵ>0,
[TABLE]
Proof.
Fix ϵ>0. First, by Lemma 16, {LnN⊂(K1/c)ϵ;U\leavevmode ult.}∈F. Since for all c>0, K1/c is a compact subset of (C(0,1),U), Lemma 7 implies that there exists ζ>0 such that
[TABLE]
Let FζS be the complement in D(0,1) of
(K1/c)ζ;S. Then, for all n large enough,
[TABLE]
The equality hereabove is justified by Lemma 4. Since (C) holds, we can apply Theorem 5. FζS being a closed subset of (D(0,1),S), for any θ>0, we have for all n large enough,
[TABLE]
Since I is a good rate function, we can apply Lemma 19 with
(E,d)=(D(0,1),dS). Therefore, we have that
I(FζS)=c1+δ with δ>0. So applying (\refm) with θ=4δ, we have for all n large enough,
[TABLE]
Applying this inequality with n=nj, so that An=j, we obtain that
[TABLE]
Set E:={f∈D:∀x∈N,f(x)∈(K1/c)ϵ;U}. We conclude by Lemma 18, since
[TABLE]
∎
5.1.3 Upper bound for LnN under (A)
Lemma 21**.**
Let {Z(t):t≥0} be a Lévy process with generating triplet (A,ν,γ) such that A=0 and ∫∣x∣≤1∣x∣ν(dx)<∞. Assume that (A) holds. Then, for any ϵ>0,
[TABLE]
Proof.
Fix ϵ>0. First, Lemma 16 implies that {LnN⊂(L1/c)ϵ;H\leavevmode ult.}∈F. Then, set Γϵ:=[(L1/c)ϵ;H]c. By Lemma 15, Γϵ∈BS. So, by Lemma 4, for any n>1,
[TABLE]
By Lemma 10, Γϵ is closed in of (BV0(0,1),W). By Theorem 6, for any θ>0, for all n large enough,
[TABLE]
By Lemma 19 with (E,d)=(BV0(0,1),dH),
J(Γϵ)=c1+δ for some δ>0.
We conclude as in the proof of Lemma 20.
∎
5.2 Upper bounds for Ln
5.2.1 A general result
Lemma 22**.**
For ϵ>0, and n>1, set
[TABLE]
Then, for all n>1,
[TABLE]
Proof.
Let ϵ>0. Since (Kα)ϵ/2;d⊂(Kα)ϵ;d, we have that for all n>1,
[TABLE]
So, by taking the intersection with {LnN⊂(Kα)ϵ/2;d} in both sides of (\refinclLogic),
[TABLE]
Indeed, if η⌊x⌋,An∈(Kα)ϵ/2;d, then there exists g∈Kα such that d(η⌊x⌋,An,g)<2ϵ. If simultaneously ηx,An∈/(Kα)ϵ;d, then d(ηx,An,g)≥ϵ. By the triangle inequality, d(ηx,An,η⌊x⌋,An)≥2ϵ. Therefore, (\refdeltaN) holds.
∎
Corollary 6**.**
We keep the assumptions of Lemma 22. For all u>0 and n>1, set
[TABLE]
Suppose that for all ϵ>0,
[TABLE]
Then, the upper bound for (LnN)n>1 in (E,d) implies it for (Ln)n>1.
Proof.
Let ϵ>0. Set E:={f∈D:∃x∈[0,∞),\leavevmoded(f(x),f(⌊x⌋))≥ϵ/2}. Then, for all j>1, Δnj(ϵ/2)={Lnj∈Dnj∩E}. So, by Lemma 18 and
(\refdeltaNjCV),
[TABLE]
By Lemma 22, for all n>1,
Λnd(ϵ)⊂Δnd(ϵ/2). Now, we deduce from the upper bound for (LnN)n>1 that there exists N∈N such that
[TABLE]
This, combined with (\refdeltaNio), implies that {Ln⊂(Kα)ϵ;d\leavevmode ult.}∈Nc.
∎
5.2.2 Upper bound for Ln under (C)
Lemma 23**.**
Let n>1. Then, for all u>0,
[TABLE]
Proof.
By the triangle inequality,
[TABLE]
Now, for any y∈[0,n] and a∈[0,1], two cases occur.
First case: If y+a≤⌊y⌋+1, then
[TABLE]
Second case: If y+a>⌊y⌋+1, then
0<(y+a)−(⌊y⌋+1)<(y+1)−y=1, so that
[TABLE]
So, (\refdeltaNsubsetSup) holds, since we obtain from both cases that
[TABLE]
∎
Lemma 24**.**
Assume that (C) holds and that Z is centered. Then, for all
ϵ>0,
[TABLE]
Proof.
For all n>1 and u>0, i=0⋃n+1{0≤τ≤1sup∣Z(i+τ)−Z(i)∣>9uAn}∈F, which follows from Lemma 3. Set
Since {Z(t):t≥0} is centered, it is a martingale. We deduce that the processes {exp[θZ(t)]:t≥0} and {exp[−θZ(t)]:t≥0} are nonnegative submartingales. Now, (C) implies that for all
θ>0, Φ(θ)+Φ(−θ) is finite. Then, by Doob’s inequality, for all θ>0 and j>1,
[TABLE]
Indeed, by definition, nj<exp(cj+1). By
(C), we can choose θ=θ(ϵ,c) such that
[TABLE]
We deduce from (\refpiNj) and (\refepsilonChoice) that j>1∑πnj(ϵ)<∞. Applying Lemma 23 and then the Borel-Cantelli lemma, we obtain that
[TABLE]
We conclude the proof by Corollary 6 and Lemma
20.
∎
Remark 1**.**
Notice that for all f,g∈D(0,1),
[TABLE]
Therefore, for all n>1, {ΔnH(ϵ)}⊂{ΔnU(ϵ)}, so that {ΔnjH(ϵ)\leavevmode i.o. in j} is included in {ΔnjU(ϵ)\leavevmode i.o. in j}. Then, by Corollary 6, one could try to use the arguments of the proof of Lemma 24 to derive the upper bound for Ln under (A). However, if only (A) holds, for ϵ>0 small enough, it is not possible to choose θ such that θ9ϵ>c1 and Φ(θ)<∞. So, (\refdHinfdU) does not provide this upper bound.
5.3 Lower bound
5.3.1 A general result on rate functions
Lemma 25**.**
Let (E,∥⋅∥) be a normed vector space. Denote by d the distance on E induced by ∥⋅∥. Let I:E⟶[0,∞) be a convex function with I(0E)=0. For all α>0, set Kα:={f∈E:I(f)≤α}. Then, for all g∈Kα and ρ>0,
[TABLE]
Proof.
Consider the map ϕ:[0,1]→R defined by ϕ(λ)=∥λg−g∥. Then, ϕ is continuous and ϕ(1)=0. So, for all ρ>0, there exists λ0<1 such that ϕ(λ0)<ρ, that is λ0g∈BdE(g,ρ). Since I is convex and I(0E)=0, we have that I(λ0g)≤λ0I(g). Then, since λ0<1 and g∈Kα, we have that λ0I(g)<I(g)≤α. Therefore, I(λ0g)<α, which proves (\refIBdE).
∎
For n>1, set Rn:=[(n−An)/An] and for G={rAn:r∈N},
[TABLE]
5.3.2 Lower bound under (C)
Lemma 26**.**
Assume that (C) holds and that {Z(t):t≥0} is centered. Then, for any c>0 and ϵ>0,
[TABLE]
Proof.
Let g∈K1/c and ϵ>0. By Lemma 17, for all n>1, {g∈/(Qn)ϵ/2;U}∈F. Now, by Lemma 7, there exists ζ>0 such that BUD(g,ϵ/2)⊃BSD(g,ζ). Therefore,
[TABLE]
where the last two lines follow from the mutual independence of (ηrAn,An)1≤r≤Rn and Lemma 4. By Theorem 5, for any θ>0, there exists Nθ∈N such that for all n≥Nθ,
[TABLE]
Indeed, by definition of dS, for all f,g∈D(0,1),
dS(f,g)≤dU(f,g). Therefore,
BUD(g,ζ)⊂BSD(g,ζ) and
I(BSD(g,ζ))≤I(BUD(g,ζ)). Now, we apply Lemma 25 with E=D(0,1), d=dU and I=I. Notice that
I(0D(0,1))=0, since Z is centered. Therefore,
[TABLE]
So, we can write I(BUD(g,ζ))=c1−δ with δ>0. Taking θ=4δ in (\refLDPlowC), we obtain that for all n≥Nθ,
[TABLE]
Consequently, n>1∑P(g∈/(Qn)ϵ/2;U)<∞ and by the Borel-Cantelli lemma,
[TABLE]
Now, by Lemma 14, K1/c is a compact subset of (D(0,1),dU). So, we can find d<∞ and functions (gq)q=1,...,d in K1/c such that K1/c⊂⋃q=1dBUD(gq,ϵ/2). By the triangle inequality, for all n>1,
[TABLE]
By (\refBClow) applied to each gq, P({gq:q=1,...,d}⊂(Qn)ϵ/2;U\leavevmode ult.)=1. Therefore,
[TABLE]
∎
5.3.3 Lower bound under (A)
Lemma 27**.**
Assume that (A) holds and that {Z(t):t≥0} is centered. Then, for any c>0 and ϵ>0,
[TABLE]
Proof.
Let g∈L1/c and ϵ>0. By Lemma 17, for all n>1, {g∈/(Qn)ϵ/2;H}∈F and as in the beginning of the proof of Lemma 26,
[TABLE]
By Corollary 3, BHBV(g,ϵ/2)∈BS. Then, it follows from Lemma 4 that
[TABLE]
By Lemma 10, BHBV(g,ϵ/2) is an open subset of (BV0(0,1),W). So, by Theorem
6,
[TABLE]
Now, we apply Lemma 25 with E=BV0(0,1),
d=dH and I=J. Notice that J(0BV0(0,1))=0, since Z is centered. Therefore,
[TABLE]
By Lemma 14, L1/c is compact in (BV0(0,1),dH) so we conclude as in the end of the proof of Lemma
26.
∎
6 Appendix
6.1 Strong invariance principle
Let AC(0,1) be the set of absolutely continuous functions on [0,1], endowed with the uniform distance dU. Let S be the Strassen-type set defined by
[TABLE]
Let aT be a function of T>1, with 0<aT≤T. Set
[TABLE]
For a Lévy process {Z(t):t≥0}, let HTZ be the following set of increment functions.
[TABLE]
Then, we deduce the following Proposition by combining the strong invariance principle of Theorem 10 below, from [9], and Theorem 11 hereunder, from [18].
Theorem 10**.**
Let {Z(t):t≥0} be a Lévy process such that (A) holds. Assume that for all t≥0, E[Z(t)]=0 and Var(Z(t))=t. Then, there exists a probability space on which one can define a standard Wiener process {W(t):t≥0} jointly with the process {Z(t):t≥0}, in such a way that, as
T→∞,
[TABLE]
Theorem 11**.**
Let {W(t):t≥0} be a standard Wiener process. Assume that aT and TaT−1 are non-decreasing and that log(logT)log(TaT−1)\leavevmodeT→∞⟶∞. Then, for all ϵ>0, a.s.
[TABLE]
Lemma 28**.**
Assume that log(logT)log(TaT−1)\leavevmodeT→∞⟶∞. Then,
[TABLE]
Proof.
The assumption implies that aTbT∼aT[2aTlog(TaT−1)]1/2=:uT as T→∞.
Clearly, uT=2[aTlogT−aTlogaT]1/2∼2[aTlogT]1/2 as T→∞. Therefore,
[TABLE]
∎
Proposition 6**.**
Let {Z(t):t≥0} be a Lévy process satisfying the assumptions of Theorem 10. Assume that aT fulfills the conditions of Theorem
11 and that
[TABLE]
Then, for all ϵ>0, a.s.
[TABLE]
Proof.
It follows from the triangle inequality that for any f∈S, for all T>1 and x∈[0,T−aT],
[TABLE]
According to (\refbToverLogT), if (\refaTlogT) holds, then
bT−1logT=o(1) as T→∞. We conclude the proof by applying (\refDHVmason), which implies that, as T→∞,
[TABLE]
∎
Remark 2**.**
Assumption (\refaTlogT) means that we consider ”large increments” aT. We cannot invoke the argument of the preceding proof to derive a FLT for increment functions of the form νx,aTZ with aT of order logT. Indeed, in that case, (\refbToverLogT) implies that bT is also of order logT. On the other hand, it is well known that rates as in (\refDHVmason) cannot be reduced to o(logT).
Let Id be the identity function on E. For x≥0 and s∈[0,1], we have that ηx,Anμ(s)=ηx,An(s)+μs. Therefore,
[TABLE]
We write with a superscript μ all elements concerning {Zμ(t):t≥0}. Therefore, for all θ∈R, Φμ(θ)=exp(μθ)Φ(θ). Consequently, for all a∈R, Ψμ(a)=Ψ(a−μ). So, for all f∈AC(0,1), ∫01Ψμ(dsdf)ds=∫01Ψ(dsdf−μ)ds=∫01Ψ(dsd(f−μId))ds and for all f∈E, Iμ(f)=I(f−μId), so that for all α>0,
[TABLE]
Let TμId:f∈E↦f+μId∈E. Since d is derived from a norm, TμId is an isometry of (E,d). So, for all g∈E and ϵ>0, TμId(BdE(g,ϵ))=BdE(g+μId,ϵ). Consequently, for G=LnG or G=Kα,
[TABLE]
We conclude since (\refLnMu), (\refKalphaMu), (\refGepsilonMu) imply that (\refLnGsubsetK) and (\refKsubsetLnG) hold for
(LnG)μ.
∎
In this proof, Kα is abbreviated as K.
Set SK:=sup{Θ(f):f∈K} and for all n≥1, set S(n):=sup{Θ(f):f∈LnG}.
First step: For all ω∈Ω, there exists a subsequence (S(ϕ(n)))n≥1 of (S(n))n≥1 such that S(ϕ(n))n→∞⟶\leavevmodelimS(n). So, for all n≥1, there exists fϕ(n)∈Lϕ(n)G such that
[TABLE]
Set R1:=k≥1⋂{LnG⊂K1/k;d ult.}. For all ω∈R1 and k≥1, there exists Nk∈N and λk∈K such that d(fϕ(Nk),λk)<k1. Since K is compact, there exists a subsequence (λΨ(k))k≥1 of (λk)k≥1 which converges to some
λ∈K. Then, for all k≥1,
[TABLE]
So, for all ω∈R1, fϕ(NΨ(k))\leavevmodek→∞⟶\leavevmodeλ and lim\leavevmodeS(n)=k→∞limΘ(fϕ(NΨ(k)))=Θ(λ)≤SK. Now, the upper bound implies that for all k≥1, there exists M(1/k)∈Nc such that
[TABLE]
Since k≥1⋂M(1/k)∈Nc, we deduce that {limS(n)≤SK}∈Nc.
Second step:Θ is continuous, and K is compact. So, there exists λ∈K such that
[TABLE]
Since Θ is continuous, for all k≥1, there exists ϵk>0 such that for g∈E,
[TABLE]
Set R2:=k≥1⋂{K⊂(LnG)ϵk;d ult.}. For all ω∈R2 and k≥1, there exists an integer N(ω,k) such that for all n≥N(ω,k), there exists fn(ω,k)∈LnG satisfying
[TABLE]
This implies that Θ(fn(ω,k))>Θ(λ)−k1.
Therefore, for all ω∈R2, k≥1, and n≥N(ω,k), S(n)>SK−k1. So, for all ω∈R2, limS(n)≥SK. Now, the lower bound implies that for all k≥1, there exists M(ϵk)∈Nc such that
[TABLE]
Since k≥1⋂M(ϵk)∈Nc, we deduce that {limS(n)≥SK}∈Nc.
∎
Acknowledgements
The author wishes to thank Prof. Paul Deheuvels, who suggested this problem to him, and Prof. Zhan Shi for helpful discussions.
Bibliography24
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] Bertoin, J. (1998). Lévy Processes . Cambridge University Press.
2[2] Billingsley, P. (1999). Convergence of probability measures. Second edition . Wiley Series in Probability and Statistics : Probability and Statistics.
3[3] Borovkov, K.A. (1990). A functional form of the Erdös-Rényi law of large numbers . Theory Probab. Appl. 35, no. 4, 762-766.
4[4] Breiman, L. (1992). Probability . Classics in Applied Mathematics, 07.
5[5] Cramer, H. (1937). Sur un nouveau théorème limite de la théorie des probabilités . Colloquium on Theory of Probability. Herman, Paris.
6[6] Deheuvels, P. (1991). Functional Erdös-Rényi laws . Studia Scientiarum Mathematicarum Hungarica 26, 261-295.
7[7] Deheuvels, P. (2007). Topics on empicial processes . EMS, Zürich, 93-190
8[8] Deheuvels, P., Devroye, L. and Lynch, J. (1986). Exact convergence rate in the limit theorems of Erdös-Rényi and Shepp . Ann. Prob. 1986, Vol. 14, No. 1, 209-223.