Next Article in Journal
Pricing of Credit Risk Derivatives with Stochastic Interest Rate
Next Article in Special Issue
A Least Squares Estimator for Gradual Change-Point in Time Series with m-Asymptotically Almost Negatively Associated Errors
Previous Article in Journal
Existence and General Energy Decay of Solutions to a Coupled System of Quasi-Linear Viscoelastic Variable Coefficient Wave Equations with Nonlinear Source Terms
Previous Article in Special Issue
Sampling Plan for the Kavya–Manoharan Generalized Inverted Kumaraswamy Distribution with Statistical Inference and Applications
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Moderate Deviation Principle for Linear Processes Generated by Dependent Sequences under Sub-Linear Expectation

1
School of Mathematics, Jilin University, Changchun 130012, China
2
School of Mathematics and Statistics, Beihua University, Jilin 132000, China
3
School of Mathematics and Statistics, Liaoning University, Shenyang 110031, China
*
Author to whom correspondence should be addressed.
Axioms 2023, 12(8), 781; https://doi.org/10.3390/axioms12080781
Submission received: 17 July 2023 / Revised: 4 August 2023 / Accepted: 10 August 2023 / Published: 11 August 2023
(This article belongs to the Special Issue Probability, Statistics and Estimation)

Abstract

:
We are interested in the linear processes generated by dependent sequences under sub-linear expectation. Using the Beveridge–Nelson decomposition of linear processes and the inequalities, the moderate deviation principle for linear processes produced by an m-dependent sequence is established. We also prove the upper bound of the moderate deviation principle for linear processes produced by negatively dependent sequences via different methods from m-dependent sequences. These conclusions promote and improve the corresponding results from the traditional probability space to the sub-linear expectation space.

1. Introduction

An important method for analyzing the limiting behavior of a family of probability measures is the large (moderate) deviation principle (abbreviated as LDP (MDP)) which plays a significant role in probability theory. It can describe the tail probability with an exponential rate of convergence. It is widely used in various areas, such as statistical mechanics, partial differential equations, dynamical systems, statistics, stochastic processes and their related fields and so on. It has been widely studied by numerous scholars. For example, refs. [1,2] established the basic and groundbreaking work for the LDP (MDP) on a traditional probability space. We also refer to refs. [3,4,5,6,7] and the references therein for more information on the large deviation principle on a traditional probability space.
One of the research hotspots in risk measurement, assets pricing, cooperative game and decision theory is model uncertainty, see refs. [8,9,10,11], etc. Recently, by relaxing the linear property of the traditional linear expectation to subadditivity and positive homogeneity, ref. [12] introduced a systematic framework of the sub-linear expectation of random variables in a general function space. Obviously, the natural extension of the classical linear expectation is sub-linear expectation. Subsequently, many limit theorems were established in the sub-linear expectation space. At the same time, some results on the LDP (MDP) were established on a traditional probability space, we refer to ref. [13], which obtained the LDP for stochastic differential equations driven by G-Brownian motion; ref. [14], which established relative entropy and the LDP under sub-linear expectations; ref. [15], which proved the LDP for negatively dependent random sequences in the sense of upper probability; ref. [16], which studied the self-normalized MDP and laws of the iterated logarithm under G-expectation; ref. [17], which proposed the LDP for random variables under sub-linear expectations on  R d ; ref. [18], which discussed the MDP for independent and nonidentical distributed random variables under sub-linear expectation; ref. [19], which presented the MDP for the sequence of m-dependent strictly stationary random variables in the sense of sub-linear expectation; and ref. [20], which found the LDP for linear processes produced by independent stationary sequences under upper probability. We also refer to refs. [21,22,23,24,25,26,27,28] for the other limit properties under the sub-linear expectation. Most work on the LDP (MDP) assumes that the random variables under discussion are independent despite the different definitions of independence. Furthermore, there is no work on the MDP for linear processes under the sub-linear expectation. Therefore, we will discuss the MDP for linear processes generated by a dependent sequence.
The paper is organized as follows. In Section 1, the significance of the research is introduced. Some basic settings and definitions under sub-linear expectations are given in Section 2. Some lemmas required to demonstrate the main results are presented in Section 3. In Section 4, the MDP for linear processes generated by an m-dependent sequence is stated and proven. In Section 5, the upper bound of the MDP for linear processes generated by a negatively dependent sequence is established and proven.
Throughout the paper, C denotes a positive constant, which may take different values wherever it appears in different expressions.  I A  denotes the indicator function of the set A ( Ω , F , P )  stands for a traditional probability space, and  ( Ω , H , E )  stands for a sub-linear expectation space.

2. Basic Settings and Definitions

In this section, we will recall some notations and definitions on sub-linear expectation spaces. We use the framework and notations of ref. [29]. Let  Ω  be a given set,  B ( Ω )  be the  σ -algebra of subsets of the set  Ω , and  H  be a linear space of real measurable functions defined on  ( Ω , B ( Ω ) ) H  contains all  I A , where  A B ( Ω ) . If  X H , then  | X | H . The space  H  can be considered as a space of random variables.
Definition 1.
A function  E : H [ , + ]  is said to be a sub-linear expectation if it satisfies for  X , Y H ,
1. Monotonicity:  X Y  implies  E [ X ] E [ Y ] .
2. Constant preserving:  E [ c ] = c , c R .
3. Subadditivity:  E [ X + Y ] E [ X ] + E [ Y ] .
4. Positive homogeneity:  E [ λ X ] = λ E [ X ] , λ 0 .
The triple  ( Ω , H , E )  is called a sub-linear expectation space. Given a sub-linear expectation  E , let us denote the conjugate expectation  E  of  E  by  E [ X ] : = E [ X ] , X H .
Now, we give the definitions of independence, m-dependence and negative dependence on a sub-linear expectation space  ( Ω , H , E ) , which can be found in refs. [15,30].
Definition 2.
Let  X 1 , X 2 , , X n + 1  be random variables in a sub-linear expectation space  ( Ω , H , E ) X n + 1  is described to be independent from  ( X 1 , X 2 , , X n )  under  E  if
E i = 1 n + 1 φ i ( X i ) = E i = 1 n φ i ( X i ) E φ n + 1 ( X n + 1 ) ,
for every nonnegative measurable function  φ i  on  R  with  E [ φ i ( X i ) ] < 1 i n + 1 . A sequence of random variables  { X n , n 1 }  is described to be independent if  X n + 1  is independent of  ( X 1 , X 2 , , X n )  for all  n N .
A natural extension of independence is the following.
Definition 3.
If  ( X n + m + 1 , , X n + j )  is independent from  ( X 1 , , X n )  for fixed integer m and every n and every  j m + 1 , then  { X n , n 1 }  is called a sequence of m-dependent random variables. Especially,  { X n , n 1 }  is called an independent sequence for  m = 0 .
Definition 4.
X n + 1  is described to be negatively dependent (abbreviated as ND) from  ( X 1 , X 2 , , X n )  under  E  if
E i = 1 n + 1 φ i ( X i ) E i = 1 n φ i ( X i ) E φ n + 1 ( X n + 1 ) ,
for every nonnegative measurable function  φ i  on  R  with  E [ φ i ( X i ) ] < 1 i n + 1 . A sequence of random variables  { X n , n 1 }  is described to be ND if  X n + 1  is ND of  ( X 1 , X 2 , , X n )  for all  n N .
Ref. [20] gave the following definition of strictly stationary in a sub-linear expectation space.
Definition 5.
A sequence of random variables  { X n , n 1 }  is said to be strictly stationary on the  ( Ω , H , E )  if
E [ ϕ n ( ξ 1 , ξ 2 , , ξ n ) ] = E [ ϕ n ( ξ 1 + k , ξ 2 + k , , ξ n + k ) ] , n 1 , k 1 ,
for any function  ϕ n C l , L i p ( R n ) : R n R , where  φ C l , L i p ( R n )  denotes the linear space of local Lipschitz continuous functions φ satisfying
| φ ( x ) φ ( y ) | c ( 1 + | x | m + | y | m ) | x y | , x , y R n ,
for some  c > 0 , m N  depending on φ.
Next, we look back upon the definitions of the upper expectation and corresponding capacity. We also refer to Chapter 6 in [29] for more details. Let  B ( Ω )  be a  σ -algebra on  Ω . Let  M  and  B ( Ω )  be the set of all probability measures and a  σ -algebra on  Ω , respectively. Every non-empty subset  P M  defines an upper probability/expectation and a lower probability/expectation
V ( A ) = sup P P P ( A ) = E [ I A ] , V ( A ) = inf P P P ( A ) = E [ I A ] , A B ( Ω ) ,
E [ X ] = sup P P E P [ X ] , E [ X ] = inf P P E P [ X ] , X H .
It is easy to check that  V ( · )  is a Choquet capacity (ref. [8]), which meets the following definition,  V ( · )  is the conjugate capacity of  V ( · ) E [ · ]  is a sub-linear expectation which is given in Definition 1 and  E [ · ]  is the conjugate expectation  E [ · ] .
Definition 6.
V ( · )  is a Choquet capacity, i.e.,
(1).  0 V ( A ) 1 , A B ( Ω ) .
(2).  V ( A ) V ( B ) A B B ( Ω ) .
(3).  V n = 1 A n n = 1 V ( A n ) , for any  A n B ( Ω ) , n 1 .
(4).  lim n V ( A n ) = V ( A )  if  A n A = n = 1 A n A n B ( Ω ) , n 1 .
Next, we provide the definition of regularity of  E  (ref. [29]), which will be used in the following.
Definition 7.
The sub-linear expectation  E  is regular for any sequence  { X n , n 1 } H  such that
X n 0 lim n E [ X n ] = 0 .
Next, we will give the definitions of a good rate function (ref. [2]) and the LDP (ref. [14]) in a sub-linear expectation space.
Definition 8.
A function I:  R [ 0 , )  is called a good rate function if for all  l 0 , the set  { x : I ( x ) l }  is a compact subset of  R .
Definition 9.
Let Ω be a topological space and  { a ( n ) , n 1 }  be a sequence of positive functions satisfying  a ( n )  as  n . A family of measurable maps  { V ( V n · ) , n 1 }  satisfies the LDP with speed  a ( n )  and rate function  I ( x )  if for any open set  G B ( R ) ,
lim inf n 1 a ( n ) log V V n G inf x G I ( x ) ,
and for any closed subset  F B ( R ) ,
lim sup n 1 a ( n ) log V V n F inf x F I ( x ) .
Equations (1) and (2) are described as the lower bound of large deviations (LLD) and the upper bound of large deviations (ULD), respectively.
If Equations (1) and (2) are satisfied with  a ( n ) = b n 2 n  and  V n = S n b n , we say that  V n  satisfies the LDP with speed  n b n 2  and rate function  I ( · ) , we also say that  V n  satisfies the MDP, where  { b n , n 1 }  is a sequence of positive real numbers satisfying
lim n b n n = , lim n b n n = 0 .

3. Preliminary Lemmas

Some useful lemmas which are needed to prove the main results are given in the following.
Lemma 1
([31]). Let  f ( x ) 0  be a nondecreasing function defined on  R ; then, for any x,
V ( X x ) E [ f ( X ) ] f ( x ) .
Lemma 2
([20]). Let  { η i , 1 i n }  be a sequence of random variables on  ( Ω , H , E )  and  γ i [ 0 , 1 ] 1 i n , such that  i = 1 n γ i = 1 . Then,
log E exp i = 1 n γ i η i i = 1 n γ i log E exp η i .
Lemma 3
([20]). Assume that a sequence of random variables  { η i , i Z }  is strictly stationary on  ( Ω , H , E )  and  { β i , i Z }  is a sequence of real numbers satisfying  i Z | β i | < . Then,
log E exp k Z | β k | | η k | log E exp | η 1 | k Z | β k | .
Lemma 4
([19]). Suppose that  { X n , n 1 }  is a sequence of strictly stationary m-dependent random variable in the sense of sub-linear expectation satisfying
E [ X 1 ] = E [ X 1 ] = 0 , lim n 1 n E [ i = 1 n X i ] 2 = σ 2 < ,
and
E [ e δ | X 1 | ] < ,
for some  δ > 0 . Then,  { V ( S n b n · ) , n 1 }  satisfies the MDP with rate function  I 1 ( x ) :
(1) For every closed set  F B ( R )  such that
lim sup n n b n 2 log V S n b n F inf x F I 1 ( x ) ;
(2) For every open set  G B ( R )  such that
lim inf n n b n 2 log V S n b n G inf x G I 1 ( x ) ,
where  I 1 ( x ) : = sup y R x y y 2 σ 2 2 = x 2 2 σ 2 S n = k = 1 n X k  and  { b n , n 1 }  is defined as in (3).
Lemma 5
([2]). Let N be a fixed integer. Then, for every  a ϵ i 0 ,
lim sup ϵ 0 ϵ log i = 1 N a ϵ i = max 1 i N lim sup ϵ 0 ϵ log a ϵ i .
The following lemma ensures that  E  is not linear; Cramér’s method can also be used for the ULD. Let  C ¯ ( · )  be a family of upper probabilities, obviously it is also a Choquet capacity (ref. [13], Lemma A.2 in Appendix).
Lemma 6
([13]). Let  ( S , ρ )  be a Polish space. Let  ( V ε , ε > 0 ) : Ω ( S , ρ )  be a family of measurable mappings and let  { λ ( ε ) , ε > 0 }  be a positive function with  λ ( ε ) 0  as  ε 0 . Assume  S = R d . For any  y R d , if there exists  δ > 0  such that
Λ ( δ y ) : = lim sup ε 0 λ ( ε ) log E exp V ε , δ y λ ( ε ) R ,
then  ( C ¯ ( V ε · ) , ε > 0 )  satisfies the ULD with speed  λ ( ε )  and good rate function  Λ *  defined by
Λ * ( x ) = sup y R d x , y Λ ( y ) , x R d .
Lemma 7
([15]). Let X and Y be two random variables defined on  ( Ω , H , E )  with capacity  V . If for every  ε > 0 ,
lim sup n n b n 2 log V ( X Y > ε ) = ,
and, for every closed set  F B ( R ) ,
lim sup n n b n 2 log V X F inf x F J ( x ) ,
where  J ( x )  is a good rate function, then
lim sup n n b n 2 log V Y F inf x F J ( x ) .

4. The MDP for Linear Processes Generated by an m-Dependent Sequence

In this section, we will give the following MDP for linear processes generated by an m-dependent sequence.
Theorem 1.
Consider the following linear processes,
Y k = j = a j X k j , k 1 ,
where  { X k , k Z }  is a sequence of strictly stationary m-dependent random variables defined on  ( Ω , H , E )  satisfying Equations (4) and (5),  { a j , j Z }  is a sequence of real numbers satisfying  j = + | a j | <  and  a = j = + a j 0 . Then,  V ( 1 b n T n · ) , n 1  satisfies the MDP with rate function  I ( x )  and speed  n / b n 2 , that is, for any closed set  F B ( R ) ,
lim sup n n b n 2 log V 1 b n T n F inf x F I ( x ) ,
for any open set  G B ( R ) ,
lim inf n n b n 2 log V 1 b n T n G inf x G I ( x ) ,
where
I ( x ) = sup y R x y σ 2 a 2 y 2 2 = x 2 2 σ 2 a 2 , x R ,
and  { b n , n 1 }  is defined as in Equation (3) and  T n = k = 1 n Y k , n 1 .
Proof. 
For  m , k 1 , denote
d m = j = m m a j , Y k , m = j = m m a j X k j , a ˜ m = 0 , a ˜ j = i = j + 1 m a i , j = 0 , 1 , 2 , · · · , m 1 , a ˜ ˜ m = 0 , a ˜ ˜ j = i = m j 1 a i , j = m + 1 , m + 2 , · · · , 0 , X k ˜ = j = 0 m a ˜ j X k j , X ˜ ˜ k = j = m 0 a ˜ ˜ j X k j .
By the above notation, it is obvious that
Y k , m = j = m m a j X k j = 1 m a j X k + j = 1 m a j X k j j = m 1 a j X k + j = m 1 a j X k j = j = m m a j X k a ˜ 0 X k + j = 1 m ( a ˜ j 1 a ˜ j ) X k j a ˜ ˜ 0 X k + j = m 1 ( a ˜ ˜ j + 1 a ˜ ˜ j ) X k j (7) = d m X k + X ˜ k 1 X ˜ k + X ˜ ˜ k + 1 X ˜ ˜ k .
Then, by Equation (7), we have the following Beveridge–Nelson decomposition of linear processes
T n = k = 1 n Y k = k = 1 n Y k , m + k = 1 n | j | > m a j X k j (8) = d m k = 1 n X k + ( X ˜ 0 X ˜ n ) + ( X ˜ ˜ n + 1 X ˜ ˜ 1 ) + k = 1 n | j | > m a j X k j .
Theorem 1 will be proved by the following two steps.
Step 1 The upper bound of the MDP.
In this step, we want to show
lim sup n n b n 2 log V 1 b n T n F inf x F I ( x ) ,
for any closed set  F B ( R ) .
By Equation (8) and Lemma 2, for every  y R , m 1 , ϵ > 0 ,  we obtain
Λ ˜ ( y ) : = lim sup n n b n 2 log E exp y b n n T n lim sup n n b n 2 log E exp { y d m b n n k = 1 n X k + | y | b n n | X ˜ 0 | + | y | b n n | X ˜ n | + | y | b n n | X ˜ ˜ n + 1 | + | y | b n n | X ˜ ˜ 1 | + | y | b n n | k = 1 n | j | > m a j X k j | } lim sup n 1 1 + ϵ n b n 2 log E exp ( 1 + ϵ ) y d m b n n k = 1 n X k + lim sup n ϵ 5 ( 1 + ϵ ) n b n 2 log E exp 5 ( 1 + ϵ ) ϵ | y | b n n | X ˜ 0 | + lim sup n ϵ 5 ( 1 + ϵ ) n b n 2 log E exp 5 ( 1 + ϵ ) ϵ | y | b n n | X ˜ n | + lim sup n ϵ 5 ( 1 + ϵ ) n b n 2 log E exp 5 ( 1 + ϵ ) ϵ | y | b n n | X ˜ ˜ n + 1 | + lim sup n ϵ 5 ( 1 + ϵ ) n b n 2 log E exp 5 ( 1 + ϵ ) ϵ | y | b n n | X ˜ ˜ 1 | + lim sup n ϵ 5 ( 1 + ϵ ) n b n 2 log E exp 5 ( 1 + ϵ ) ϵ | y | b n n | k = 1 n | j | > m a j X k j | (10) : = E 1 + E 2 + E 3 + E 4 + E 5 + E 6 .
By Lemma 3.2 from [19], we can obtain
lim sup n n b n 2 log E exp y b n n k = 1 n X k = σ 2 y 2 2 .
Then, following Equation (11), one can get
E 1 = 1 1 + ϵ σ 2 2 [ ( 1 + ϵ ) y d m ] 2 = ( 1 + ϵ ) σ 2 y 2 d m 2 2 .
Next, we will consider the second term  E 2 . It follows from the definition of  X ˜ 0 , Lemma 3 and Equation (3) with Equation (5) that
E 2 lim sup n ϵ 5 ( 1 + ϵ ) n b n 2 log E exp 5 ( 1 + ϵ ) ϵ | y | b n n j = 0 m 1 i = j + 1 m | a i | | X j | lim sup n ϵ 5 ( 1 + ϵ ) n b n 2 log E exp 5 ( 1 + ϵ ) ϵ | y | b n n | X 1 | j = 0 m 1 i = j + 1 m | a i | lim sup n ϵ 5 ( 1 + ϵ ) n b n 2 log E exp 5 ( 1 + ϵ ) ϵ | y | m i = + | a i | b n n | X 1 | = 0 .
Therefore, by the same arguments as in  E 2 , we have
E i 0 , 2 i 5 .
Next, we will estimate the last term  E 6 . Combining Lemmas 3 and 5, the stationarity of  { X k } e | x | e x + e x , x R  and Equation (11), one can obtain
E 6 lim sup n ϵ 5 ( 1 + ϵ ) n b n 2 log E exp 5 ( 1 + ϵ ) ϵ | y | b n n c m | k = 1 n X k j | lim sup n ϵ 5 ( 1 + ϵ ) n b n 2 log E exp 5 ( 1 + ϵ ) ϵ | y | b n n | k = 1 n X k | c m lim sup n ϵ 5 ( 1 + ϵ ) n b n 2 log [ E exp y 5 ( 1 + ϵ ) ϵ b n n k = 1 n X k c m + E exp y 5 ( 1 + ϵ ) ϵ b n n k = 1 n X k c m ] = lim sup n ϵ 5 ( 1 + ϵ ) n b n 2 log E exp y 5 ( 1 + ϵ ) ϵ b n n k = 1 n X k c m lim sup n ϵ 5 ( 1 + ϵ ) n b n 2 log E exp y 5 ( 1 + ϵ ) ϵ b n n k = 1 n X k c m = ϵ 5 ( 1 + ϵ ) σ 2 2 y 5 ( 1 + ϵ ) ϵ c m 2 ϵ 5 ( 1 + ϵ ) σ 2 2 y 5 ( 1 + ϵ ) ϵ c m 2 (14) = 5 ( 1 + ϵ ) ϵ σ 2 2 c m 2 .
j = + | a j | <  implies
lim m d m = a , lim m c m = | j | > m | a j | = 0 .
Moreover, it follows from Equations (10), (12) and (13) with Equation (15) that
Λ ˜ ( y ) lim ϵ 0 lim m [ E 1 + E 2 + E 3 + E 4 + E 5 + E 6 ] lim ϵ 0 lim m ( 1 + ϵ ) σ 2 y 2 d m 2 2 + 5 ( 1 + ϵ ) ϵ σ 2 2 c m 2 (16) = lim ϵ 0 ( 1 + ϵ ) σ 2 y 2 a 2 2 = σ 2 y 2 a 2 2 < .
Then, by Equation (16), one can calculate that
Λ ˜ * ( x ) = sup y R x y Λ ˜ ( y ) sup y R x y σ 2 y 2 a 2 2 = x 2 2 σ 2 a 2 = I ( x ) .
Therefore, the proof of Equation (9) is complete by combining Equation (17) with Lemma 6.
Step 2 The lower bound of the MDP.
In order to prove the lower bound of the MDP, it suffices to show that
lim inf n n b n 2 log V 1 B n T n B ( x , δ ) x 2 2 σ 2 a 2 = I ( x ) ,
where  B ( x , δ ) = { y ; | x y | < δ } G δ > 0  and  G B ( R )  is an open set.
In fact, Equation (18) implies
lim inf n n b n 2 log V 1 b n T n G lim inf n n b n 2 log V 1 b n T n B ( x , δ ) x 2 2 σ 2 a 2 = I ( x ) .
Thus, by the arbitrariness of x, one can get
lim inf n n b n 2 log V 1 b n T n G inf x G x 2 2 σ 2 a 2 = inf x G I ( x ) .
By Lemma 4, we know that  { 1 b n k = 1 n X k , n 1 }  satisfies the MDP with rate function  I 1 ( x ) = x 2 2 σ 2 ; hence,
lim inf n n b n 2 log V d m 1 b n k = 1 n X k B x , δ 6 inf d m y B x , δ 6 y 2 2 σ 2 = inf d m y a B x , δ 6 y 2 2 σ 2 a 2 = inf y B a x d m , | a | δ 6 | d m | y 2 2 σ 2 a 2 .
Following Equation (15), we can obtain  x B ( a x / d m , | a | δ / ( 6 | d m | ) )  for sufficiently large m. Therefore,
lim inf n n b n 2 log V d m 1 b n k = 1 n X k B x , δ 6 x 2 2 σ 2 a 2 = I ( x ) .
We can show, by triangle inequality and Equation (8), that
lim inf n n b n 2 log V d m 1 b n k = 1 n X k B x , δ 6 = lim inf n n b n 2 log V T n b n ( X ˜ 0 X ˜ n ) b n ( X ˜ ˜ n + 1 X ˜ ˜ 1 ) b n k = 1 n | j | > m α j X k j b n B x , δ 6 lim inf n n b n 2 log { V T n b n B x , δ + V | X ˜ 0 | b n δ 6 + V | X ˜ n | b n δ 6
+ V | X ˜ ˜ n + 1 | b n δ 6 + V | X ˜ ˜ 1 | b n δ 6 + V | k = 1 n | j | > m α j X k j | b n δ 6 } lim inf n n b n 2 log V T n b n B x , δ lim sup n n b n 2 log V | X ˜ 0 | b n δ 6 lim sup n n b n 2 log V | X ˜ n | b n δ 6 lim sup n n b n 2 log V | X ˜ ˜ n + 1 | b n δ 6 lim sup n n b n 2 log V | X ˜ ˜ 1 | b n δ 6 lim sup n n b n 2 log V 1 b n | k = 1 n | j | > m a j X k j | δ 6 (20) = : F 1 F 2 F 3 F 4 F 5 F 6 .
Thus, by Equation (20), in order to show Equation (18), it suffices to calculate
F i x 2 2 σ 2 a 2 1 , 2 i 6 .
Taking  y 0 6 ( x 2 2 σ 2 a 2 + 1 ) / δ , by Lemma 1 and the same discussion as in  E 2 , it is easily seen that
F 2 = lim sup n n b n 2 log V 1 b n | X ˜ 0 | δ 6 = lim sup n n b n 2 log V y 0 b n n | X ˜ 0 | y 0 δ b n 2 6 n lim sup n n b n 2 log exp { y 0 δ b n 2 6 n } E exp { y 0 b n n | X ˜ 0 | } y 0 δ 6 + lim sup n n b n 2 log E e y 0 b n n | X ˜ 0 | = y 0 δ 6 x 2 2 σ 2 a 2 1 .
Therefore, by the same arguments as in  F 2 , we have
F i x 2 2 σ 2 a 2 1 , 2 i 5 .
Finally, we want to show that  F 6 x 2 2 σ 2 a 2 1 . Taking  y 0 6 ( x 2 2 σ 2 a 2 + 2 ) / δ  and following Lemma 1 and the same argument as in Equation (14), then
J 6 = lim sup n n b n 2 log V 1 b n | k = 1 n | j | > m a j X k j | δ 6 = lim sup n n b n 2 log V y 0 b n n | k = 1 n | j | > m a j X k j | y 0 δ b n 2 6 n
lim sup n n b n 2 log exp { y 0 δ b n 2 6 n } E exp { y 0 b n n | k = 1 n | j | > m a j X k j | } y 0 δ 6 + lim sup n n b n 2 log E exp { y 0 b n n | k = 1 n | j | > m a j X k j | } (23) x 2 2 σ 2 a 2 2 + σ 2 2 | j | > m | a j | 2 .
Noting that  | j | > m | a j | 0 , m , then, by Equation (23), for sufficiently large m, one can get
F 6 x 2 2 σ 2 a 2 1 .
Thus, the above arguments yield Equation (21). Therefore, the proof is complete. □
Remark 1.
If taking  a 0 = 1 , a j = 0 , j 0  in Theorem 1, then  { Y k , k 1 }  is a special linear process. Thus, we need to emphasize that
V 1 b n k = 1 n X k · , n 1 ,
satisfies the MDP for an m-dependent sequence, that is Theorem 3.1 from [19]. Thus, our theorem extends the known result.

5. The Upper Bound of the MDP for Linear Processes Generated by an ND Sequence

In this section, we will discuss the upper bound of the MDP for linear processes generated by an ND sequence. The method of proof is different from that used in the above section depending on the existence of a logarithmic moment generating function; however, the limit of the logarithmic moment generating function of an ND sequence may not exist. Therefore, we adopt another method to prove the upper bound of the MDP.
Theorem 2.
Assume that  { X k , k Z }  is a strictly stationary ND random variable sequence on  ( Ω , H , E )  satisfying
E [ X 1 ] = E [ X 1 ] = 0 , E [ | X 1 | 2 + η ] < ,
and
E [ e t | X 1 | ] < ,
for some  η > 0  and all  t R . Suppose that
lim sup n n b n 2 log i = 1 n V ( | X i | > b n ) = ,
and moreover, for all  t R  and  n 1 ,
E exp t i = 1 n X i I { | X i | < n b n } = E exp t i = 1 n X 1 I { | X 1 | < n b n } n .
Furthermore, let  { a j , j Z }  be sequence of real numbers satisfying  j = + | a j | <  and  a = j = + a j 0  and  { Y k , k 1 }  be a linear process defined by Equation (6) and partial sum  T n = k = 1 n Y k , n 1 . Then,  V ( 1 b n T n · ) , n 1  satisfies the upper bound of the MDP with speed  n / b n 2  and rate function  J ( x / a ) , that is, for any closed set  F B ( R ) ,
lim sup n n b n 2 log V 1 b n T n F inf x F J ( x / a ) ,
where  { b n , n 1 }  is defined as in Equation (3) and
J ( x ) = sup y R x y y 2 2 E [ X 1 2 ] = x 2 2 E [ X 1 2 ] .
Proof. 
We will adopt the same notation defined in the proof of Theorem 1. By Lemma 7, in order to prove Equation (29), we only need to show that for all  ε > 0
lim m lim sup n n b n 2 log V T n b n d m b n k = 1 n X k I { | X i | < n b n } > ε =
and
lim m lim sup n n b n 2 log V d m b n k = 1 n X k I { | X i | < n b n } F inf x F J ( x / a ) .
Next, we will prove Equation (30). By Equation (8), it suffices to show that
G 1 : = lim m lim sup n n b n 2 log V d m b n k = 1 n X k I { | X i | n b n } > ε / 6 = ,
G 2 : = lim m lim sup n n b n 2 log V 1 b n X ˜ 0 > ε / 6 = ,
G 3 : = lim m lim sup n n b n 2 log V 1 b n X ˜ n > ε / 6 = ,
G 4 : = lim m lim sup n n b n 2 log V 1 b n X ˜ ˜ 1 > ε / 6 = ,
G 5 : = lim m lim sup n n b n 2 log V 1 b n X ˜ ˜ n + 1 > ε / 6 = ,
G 6 : = lim m lim sup n n b n 2 log V 1 b n k = 1 n | j | > m a j X k j > ε / 6 = .
By Equation (26) and by the same argument as in page 409–410 of [15], one can get
G 1 = lim m lim sup n n b n 2 log V d m b n k = 1 n X k I { | X i | n b n } > ε / 6 = .
By the definition of  X ˜ 0 , Lemma 3 and Equation (5), for every  β > 1 , we have
G 2 = lim m lim sup n n b n 2 log V 1 b n j = 0 m 1 i = j + 1 m a i X j > ε / 6 lim m lim sup n n b n 2 log V β b n j = 0 m 1 i = j + 1 m | a i | | X j | > ε β / 6 lim m lim sup n n b n 2 log V β b n | X 1 | j = 0 m 1 i = j + 1 m | a i | > ε β / 6 lim m lim sup n n b n 2 log V β b n m i = + | a i | | X 1 | > ε β / 6 = lim m lim sup n n b n 2 log V β b n n m i = + | a i | | X 1 | > ε β b n 2 6 n lim m lim sup n n b n 2 log exp { ε β b n 2 6 n } E [ exp { β b n n m i = + | a i | | X 1 | } ] = ε β 6 + lim m lim sup n n b n 2 log E [ exp { β b n n m i = + | a i | | X 1 | } ] = ε β 6 .
By the arbitrariness of  β , let  β , then we can obtain  G 2 = . Since the arguments of  G 2 G 5  are essentially similar, we obtain the following:
G i = , 2 i 5 .
By Lemmas 1, 3 and 5, noting that  e | x | e x + e x , x R  and  e x = 1 + x + x 2 + o ( x 2 ) , x 0  and  log ( 1 + x ) x , x 0  and  c m = | j | > m | a j | 0 , m , the definitions of ND and stationary, then one can obtain
G 6 lim m lim sup n n b n 2 log V β b n c m n | k = 1 n X k j | > ε β b n 2 6 n lim m lim sup n n b n 2 log exp { ε β b n 2 6 n } E [ exp { β b n c m n | k = 1 n X k j | } ] ε β 6 + lim m lim sup n n b n 2 log E [ exp { β b n c m n k = 1 n X k | } ] ε β 6 + lim m lim sup n n b n 2 log E [ exp { β b n c m n k = 1 n X k } + exp { β b n c m n k = 1 n X k } ] ε β 6 + lim m lim sup n n b n 2 log E [ exp { β b n c m n k = 1 n X k } ] lim m lim sup n n b n 2 log E [ exp { β b n c m n k = 1 n X k } ] ε β 6 + lim m lim sup n n 2 b n 2 log E [ exp { β b n c m n X 1 } ] lim m lim sup n n 2 b n 2 log E [ exp { β b n c m n X 1 } ]
= ε β 6 + lim m lim sup n n 2 b n 2 log E [ 1 + β b n c m n X 1 + β 2 b n 2 c m 2 2 n 2 X 1 2 + o ( b n 2 c m 2 n 2 X 1 2 ) ] lim m lim sup n n 2 b n 2 log E [ 1 β b n c m n X 1 + β 2 b n 2 c m 2 2 n 2 X 1 2 + o ( b n 2 c m 2 n 2 X 1 2 ) ] ε β 6 + lim m lim sup n n 2 b n 2 log 1 + β 2 b n 2 c m 2 2 n 2 E [ X 1 2 ] + o ( b n 2 c m 2 n 2 ) ε β 6 + lim m β 2 2 c m 2 E [ X 1 2 ] + o ( c m 2 ) = ε β 6 .
Moreover, by the arbitrariness of  β , let  β . Then, we can obtain
G 6 = .
Then, Equation (30) follows by putting Equations (32)–(41) together.
Finally, we want to prove Equation (31). Using the same arguments as in page 410–411 of [15], one can get
lim n n b n 2 log E [ exp { t d m b n n k = 1 n X k I { | X i | < n b n } } ] = t 2 d m 2 2 E [ X 1 2 ] < .
Then, by Equation (41) and Lemma 6, one can get
lim sup n n b n 2 log V d m b n k = 1 n X k I { | X i | < n b n } F inf x F sup t R x t t 2 d m 2 2 E [ X 1 2 ] (42) = inf x F x 2 2 d m 2 E [ X 1 2 ] .
Noting  d m a  as  m , Equation (31) follows by letting  m  in Equation (42). The proof is complete. □
Remark 2.
If taking  a 0 = 1 , a j = 0 , j 0  in Theorem 2, then  { Y k , k 1 }  is a simple linear process. Then,
V 1 b n k = 1 n X k · , n 1 ,
satisfies the upper bound of the MDP, that is Theorem 4.1 in [15]. Thus, our theorem extends the known result.
Remark 3.
In this section, we obtain the upper bound of the MDP for linear processes generated by an ND sequence; the lower bound of MDP leaves the problem open. One of the methods to prove the lower bound is the central limit theorem. To our knowledge, the central limit theorem for ND random variables under sub-linear expectation is not yet detailed; we will consider this problem in future work.

6. Conclusions

In this paper, using the Beveridge–Nelson decomposition of linear processes and the inequalities under sub-linear expectation, the authors establish the MDP for linear processes produced by an m-dependent sequence and the upper bound of the MDP for linear processes produced by an ND sequence. The results extend the MDP from the traditional probability space to the sub-linear expectation space. Furthermore, they also extend the MDP to linear processes. In the future, we will try to establish the lower bound of the MDP for ND sequences and other dependent sequences under sub-linear expectations.

Author Contributions

Methodology, P.S., D.W., X.D., X.T. and Y.Z.; Formal analysis, P.S., D.W., X.D., X.T. and Y.Z.; Writing—review & editing, P.S., D.W., X.D., X.T. and Y.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by National Natural Science Foundation of China (No. 11771178, 12171198, 12271231, 12001229, 11901053); the Science and Technology Development Program of Jilin Province (Grant No. 20210101467JC); Department of Science and Technology of Jilin Province (Grant No. YDZJ202102ZYTS156); and Fundamental Research Funds for the Central Universities and Cultivation Plan for Excellent Young Scholar Candidates of Jilin University.

Data Availability Statement

No data were used to support this study.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Donsker, M.D.; Varadhan, S.R.S. Large deviations for stationary Gaussian processes. Commun. Math. Phys. 1985, 97, 187–210. [Google Scholar] [CrossRef]
  2. Dembo, A.; Zeitouni, O. Large Deviations Techniques and Applications; Springer: New York, NY, USA, 1992. [Google Scholar]
  3. Burton, R.M.; Dehling, H. Large deviations for some weakly dependent random processes. Stat. Probab. Lett. 1990, 9, 397–401. [Google Scholar] [CrossRef]
  4. Dong, Z.S.; Tan, X.L.; Yang, X.Y. Moderate deviation principles for moving average processes of real stationary sequences. Stat. Probab. Lett. 2006, 74, 139–150. [Google Scholar] [CrossRef]
  5. Sun, G.M.; Xie, J.S. Asymptotic normality and moderate deviation principle for high-dimensional likelihood ratio statistic on block compound symmetry covariance structure. Statistics 2020, 54, 114–134. [Google Scholar] [CrossRef]
  6. Chen, H.T.; Zhang, Y. Moderate deviations for the total population arising from a nearly unstable sub-critical Galton-Watson process with immigration. Commun. Stat. Theory Methods 2021, 50, 432–445. [Google Scholar] [CrossRef]
  7. Bai, Y.S.; Zhang, Y.; Liu, C.M. Moderate deviation principle for likelihood ratio test in multivariate linear regression model. J. Multivar. Anal. 2023, 194, 105139. [Google Scholar] [CrossRef]
  8. Denis, L.; Martini, C. A theoretical framework for the pricing of contingent claims in the presence of model uncertainty. Ann. Appl. Probab. 2006, 16, 827–852. [Google Scholar] [CrossRef] [Green Version]
  9. Gilboa, I. Expected utility with purely subjective non-additive probabilities. J. Math. Econ. 1987, 16, 65–88. [Google Scholar] [CrossRef] [Green Version]
  10. Marinacci, M. Limit laws for non-additive probabilities and their frequentist interpretation. J. Econ. Theory 1999, 84, 145–195. [Google Scholar] [CrossRef]
  11. Peng, S.G. Backward SDE and related G-Expectation. Backward Stoch. Differ. Equ. 1997, 141–159. [Google Scholar]
  12. Peng, S.G. G-Gxpectation, G-Brownian motion and related stochastic calculus of Ito’s type. Stoch. Anal. Appl. 2006, 2, 541–567. [Google Scholar]
  13. Gao, F.Q.; Jiang, H. Large deviations for stochastic differential equations driven by G-Brownian motion. Stoch. Process. Appl. 2010, 120, 2212–2240. [Google Scholar] [CrossRef] [Green Version]
  14. Gao, F.Q.; Xu, M.Z. Relative entropy and large deviations under sublinear expectations. Acta Math. Sci. Ser. B 2012, 32, 1826–1834. [Google Scholar]
  15. Chen, Z.J.; Feng, X.F. Large deviation for negatively dependent random variables under sublinear expectation. Commun. Stat. Theory Methods 2016, 45, 400–412. [Google Scholar] [CrossRef]
  16. Zhang, L.X. Self-normalized moderate deviation and laws of the iterated logarithm under G-expectation. Commun. Math. Stat. 2016, 4, 229–263. [Google Scholar] [CrossRef] [Green Version]
  17. Tan, Y.Z.; Zong, G.F. Large deviation principle for random variables under sublinear expectations on R d . J. Math. Anal. Appl. 2020, 488, 124110. [Google Scholar] [CrossRef]
  18. Zhou, Q.Q.; Logachov, A.V. Moderate deviations principle for independent random variables under sublinear expectations. Sib. Elektron. Mat. Izv. 2021, 18, 817–826. [Google Scholar] [CrossRef]
  19. Guo, S.; Zhang, Y. Moderate deviation principle for m-dependent random variables under the sublinear expectation. AIMS Math. 2022, 7, 5943–5956. [Google Scholar] [CrossRef]
  20. Liu, W.; Zhang, Y. Large deviation principle for linear processes generated by real stationary sequences under the sub-linear expectation. Commun. Stat. Theory Methods 2023, 52, 5727–5741. [Google Scholar] [CrossRef]
  21. Wu, Q.Y.; Jiang, Y.Y. Strong law of large numbers and Chover’s law of the iterated logarithm under sub-linear expectations. J. Math. Anal. Appl. 2018, 460, 252–270. [Google Scholar] [CrossRef]
  22. Fang, X.; Peng, S.G.; Shao, Q.M.; Song, Y.S. Limit theorems with rate of convergence under sublinear expectations. Bernoulli 2019, 25, 2564–2596. [Google Scholar] [CrossRef] [Green Version]
  23. Song, Y.S. Normal approximation by Stein’s method under sublinear expectations. Stoch. Process. Appl. 2020, 130, 2838–2850. [Google Scholar] [CrossRef] [Green Version]
  24. Liu, W.; Zhang, Y. Central limit theorem for linear processes generated by IID random variables under the sub-linear expectation. Appl. Math. J. Chin. Univ. Ser. B 2021, 36, 243–255. [Google Scholar] [CrossRef]
  25. Liu, W.; Zhang, Y. The law of the iterated logarithm for linear processes generated by a sequence of stationary independent random variables under the sub-linear expectation. Entropy 2021, 23, 1313. [Google Scholar] [CrossRef]
  26. Ding, X. A general form for precise asymptotics for complete convergence under sublinear expectation. AIMS Math. 2022, 7, 1664–1677. [Google Scholar] [CrossRef]
  27. Wu, Y.; Wang, X.J. General results on precise asymptotics under sub-linear expectations. J. Math. Anal. Appl. 2022, 511, 126090. [Google Scholar] [CrossRef]
  28. Guo, S.; Zhang, Y. Central limit theorem for linear processes generated by m-dependent random variables under the sublinear expectation. Commun. Stat. Theory Methods 2023, 52, 6407–6419. [Google Scholar] [CrossRef]
  29. Peng, S.G. Nonlinear Expectations and Stochastic Calculus under Uncertainty; Springer: Berlin/Heidelberg, Germany, 2019. [Google Scholar]
  30. Li, X.P. A central limit theorem for m-dependent random variables under sublinear expectations. Acta Math. Appl. Sin. Engl. Ser. 2015, 31, 435–444. [Google Scholar] [CrossRef]
  31. Chen, Z.J.; Wu, P.Y.; Li, B.M. A strong law of large numbers for non-additive probabilities. Int. J. Approx. Reason. 2013, 54, 365–377. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Sun, P.; Wang, D.; Ding, X.; Tan, X.; Zhang, Y. Moderate Deviation Principle for Linear Processes Generated by Dependent Sequences under Sub-Linear Expectation. Axioms 2023, 12, 781. https://doi.org/10.3390/axioms12080781

AMA Style

Sun P, Wang D, Ding X, Tan X, Zhang Y. Moderate Deviation Principle for Linear Processes Generated by Dependent Sequences under Sub-Linear Expectation. Axioms. 2023; 12(8):781. https://doi.org/10.3390/axioms12080781

Chicago/Turabian Style

Sun, Peiyu, Dehui Wang, Xue Ding, Xili Tan, and Yong Zhang. 2023. "Moderate Deviation Principle for Linear Processes Generated by Dependent Sequences under Sub-Linear Expectation" Axioms 12, no. 8: 781. https://doi.org/10.3390/axioms12080781

APA Style

Sun, P., Wang, D., Ding, X., Tan, X., & Zhang, Y. (2023). Moderate Deviation Principle for Linear Processes Generated by Dependent Sequences under Sub-Linear Expectation. Axioms, 12(8), 781. https://doi.org/10.3390/axioms12080781

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop