Next Article in Journal
Polar Vortex Multi-Day Intensity Prediction Relying on New Deep Learning Model: A Combined Convolution Neural Network with Long Short-Term Memory Based on Gaussian Smoothing Method
Previous Article in Journal
S-Box Design Based on 2D Multiple Collapse Chaotic Map and Their Application in Image Encryption
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Law of the Iterated Logarithm for Linear Processes Generated by a Sequence of Stationary Independent Random Variables under the Sub-Linear Expectation

School of Mathematics, Jilin University, 2699 Qianjin Street, Changchun 130012, China
*
Author to whom correspondence should be addressed.
Entropy 2021, 23(10), 1313; https://doi.org/10.3390/e23101313
Submission received: 11 September 2021 / Revised: 3 October 2021 / Accepted: 4 October 2021 / Published: 7 October 2021

Abstract

:
In this paper, we obtain the law of iterated logarithm for linear processes in sub-linear expectation space. It is established for strictly stationary independent random variable sequences with finite second-order moments in the sense of non-additive capacity.

1. Introduction

As fundamental limit theorems of probability theory, the classical law of the iterated logarithm (LIL for short) plays an important role in the development of probability theory and its applications. The original statement of LIL obtained by Khinchine [1] is for a class of Bernoulli random variables. After that, a lot of literature has performed in-depth and detailed research on LIL, we can refer to Hartman and Wintner [2], Acosta [3], Shao and Su [4], and so on. Motivated by modeling uncertainty in practice, Peng [5] introduced the reasonable framework of the sub-linear expectation of random variables in a general function space. As an alternative to the traditional probability/expectation, capacity/sub-linear expectation has been studied in many fields, such as statistics, mathematical economics, measures of risk, and super-hedging in finance. In recent years, after studying the limit theorem of sub-linear expectation (e.g., see Feng [6], Deng and Wang [7], Tan and Zong [8], and Zhang [9,10], etc.), more and more research results of LIL under this framework have been obtained, the Hartman–Winter LIL were established by Chen and Hu [11] for bounded random variables, the functional central limit and Chung’s LIL were recently obtained by Zhang [12], and the LIL for independent and negatively dependent identically distributed random variables were proven by Zhang [13].
As is well known, the linear processes are especially important in time series analysis and they arise from a wide variety of contexts (cf. Hannan [14]). Applications to economics, engineering, and physical sciences are extremely broad and a vast amount of literature is devoted to the study of linear processes under a variety of circumstances. The limit theory of linear processes has been studied in detail in many papers. Philips and Solo [15] prove the strong law of numbers and the law of iterated logarithm for linear processes, Zhang [16] gives the limit law of the iterated logarithm for linear processes. Recently, Liu and Zhang [17] obtained the central limit theorem and invariance principle for linear processes generated by independent and identically distributed (IID for short) random variables under sub-linear expectation.
A natural question is: can LIL of linear processes be realized under Peng’s framework? The main purpose of this paper is to establish the law of iterated logarithm for linear processes generated by IID random variables in sub-linear expectation space. In the classical case, the LIL of partial sum is established by decomposing the linear process. We will find that this way is also valid for proving LIL for linear process in the sub-linear expectation space, though there are some differences. Intuitively, sub-linear expectation and related non-additive probabilities (Capacities) generated by them plays a decisive role in our proof. In the sequel, c denotes a positive constant, which may take different values whenever it appears in different expressions.
To state the result, we shall first recall the framework of sub-linear expectations. We use the framework and notation of Peng [5,18,19]. Let ( Ω , F ) be a given measurable space. Let H be a linear space of real functions defined on ( Ω , F ) , such that if X 1 , X 2 , . . . , X n H then φ ( X 1 , X 2 , . . . , X n ) H for each φ C l , L i p ( R n ) 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 φ . H contains all I A where A F . We also denote φ C b , L i p ( R n ) as the linear space of bounded Lipschitz continuous functions φ satisfying
| φ ( x ) φ ( y ) | c | x y | , x , y R n ,
for some c > 0 .
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. 
Sub-additivity: 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. Give a sub-linear expectation E ^ , let us denote the conjugate expectation E ^ of E ^ by E ^ [ X ] : = E ^ [ X ] , X H .
Remark 1.
(i) The sub-linear expectation E ^ [ · ] satisfies translation invariance: E ^ [ X + c ] = E ^ [ X ] + c , c R . (ii) From the definition, it is easy to show that E ^ [ X ] E ^ [ X ] and E ^ [ X Y ] E ^ [ X ] E ^ [ Y ] , X , Y H with E ^ [ Y ] being finite.
Definition 2.
(i) (Identical distribution) Let X 1 and X 2 be two n-dimensional random vectors defined, respectively, in sub-linear expectation spaces ( Ω 1 , H 1 , E ^ 1 ) and ( Ω 2 , H 2 , E ^ 2 ) . They are called identically distributed, denoted by X 1 = d X 2 , if
E ^ 1 [ φ ( X 1 ) ] = E ^ 2 [ φ ( X 2 ) ] , φ C l , L i p ( R n ) ,
whenever the sub-expectations are finite. A sequence of random variables { X n , n 1 } is said to be identically distributed if X i = d X 1 for each i 1 .
(ii) (Independence) In a sub-linear expectation space ( Ω , H , E ^ ) , a random vector Y = ( Y 1 , . . . , Y n ) ( Y i H ) is said to be independent to another random vector X = ( X 1 , . . . , X m ) ( X i H ) under E ^ if for each test function φ C l , L i p ( R m × R n ) we have
E ^ [ φ ( X , Y ) ] = E ^ [ E ^ [ φ ( x , Y ) ] | x = X ] ,
whenever φ ¯ ( x ) : = E ^ [ | φ ( x , Y ) | ] < for all x and E ^ [ | φ ¯ ( x ) | ] < .
(iii) (IID random variables) A sequence of random variables { X n , n 1 } is said to be independent and identically distributed (IID), if X i = d X 1 and X i + 1 is independent to ( X 1 , . . . , X i ) for each i 1 .
It is obvious that, if { X n , n 1 } is a sequence of independent random variables and f 1 ( x ) , f 2 ( x ) , . . . C l , L i p ( R ) , then { f n ( X n ) , n 1 } is also a sequence of independent random variables.
Next, we introduce the capacities corresponding to the sub-linear expectations.
Definition 3
([11]). A set function V: F [ 0 , 1 ] is called a capacity, if
1. 
V ( ) = 0 , V ( Ω ) = 1 ;
2. 
V ( A ) V ( B ) , A B , A , B F .
It is called to be sub-additive if V ( A B ) V ( A ) + V ( B ) for all A , B F with A B F .
A sub-linear expectation E ^ could generate a pair ( V , V ) of capacity denoted by
V ( A ) : = inf { E ^ [ ξ ] : I A ξ , ξ H } , V ( A ) = 1 V ( A c ) , A F ,
where A c is the complement set of A. Then
V ( A ) : = E ^ [ I A ] , V ( A ) : = E ^ [ I A ] , if I A H ,
E ^ [ f ] V ( A ) E ^ [ g ] , E ^ [ f ] V ( A ) E ^ [ g ] , if f I A g , f , g H .
In addition, a pair ( C V , C V ) of the Choquet integrals/expecations denoted by
C V [ X ] = 0 V ( X t ) d t + 0 [ V ( X t ) 1 ] d t ,
with V being replaced by V and V , respectively.
If lim c E ^ [ ( | X | c ) + ] = 0 or E ^ is countably sub-additive, then E ^ [ | X | ] C V ( | X | ) (See Lemma 4.5 (iii) of Zhang [13]).
Definition 4
([20]). (a) A sub-linear expectation E ^ : H [ , + ] is called to be countably sub-additive if it satisfies E ^ [ X ] n = 1 E ^ [ X n ] , whenever X Σ n = 1 X n , X , X n H and X 0 , X n 0 , n = 1 , 2 , . . . ;
(b) A function V: F [ 0 , 1 ] is called to be countably sub-additive if V n = 1 A n n = 1 V ( A n ) , A n F ;
(c) A capacity V: F [ 0 , 1 ] is called a continuous capacity if it satisfies:
c1. Continuity from below: V ( A n ) V ( A ) , if A n A , where A n , A F ;
c2. Continuity from above: V ( A n ) V ( A ) , if A n A , where A n , A F .
It is obvious that the continuity from above and sub-additivity imply the continuity from below, and the continuity from the below and sub-additivity imply the countable sub- additivity. Therefore, we call a sub-additive capacity to be continuous if it is continuous from above. Set H = { A : I A H } , then V is a countably sub-additive capacity in H if E ^ is countably sub-additive in H , and ( V , V ) is a pair of continuous capacities in H if E ^ is continuous in H .

2. Main Results

In this section, we shall study the LIL of linear processes under association assumption in the sub-linear expectation space. For any I ( k , + ) , { X j , j I } is a sequence of independent random variables satisfying Definition 2; For a finite index set I ( , k ) , { X j , j I } is also a sequence of independent random variables satisfying Definition 2.
First, we give the definition of strictly stationary sequence under the sub-linear expectation.
Definition 5.
{ ε n , n N } is said to be a sequence of strictly stationary random variables on the ( Ω , H , E ^ ) , if for any a function ϕ n C l , L i p ( R n ) : R n R , then
E ^ [ ϕ n ( ε 1 , ε 2 , . . . , ε n ) ] = E ^ [ ϕ n ( ε 1 + k , ε 2 + k , . . . , ε n + k ) ] , n 1 , k N .
Next we give the main results: the law of the iterated logarithm for linear processes in the sub-linear expectation space.
Theorem 1.
Suppose that { ε j , j Z } is a sequence of strictly stationary independent random variables on the ( Ω , H , E ^ ) with E ^ [ ε 1 ] = E ^ [ ε 1 ] = 0 and σ ¯ 2 = E ^ [ ε 1 2 ] , σ ̲ 2 = E ^ [ ε 1 2 ] . Further, assume that E ^ is countably sub-additive and
( A 1 )
E ^ ε 1 2 ( log | ε 1 | ) 1 + δ < , f o r s o m e δ > 0 ;
( A 2 )
lim c E ^ [ ( ε 1 2 c ) + ] = 0 ;
( A 3 )
C V ε 1 2 log log | ε 1 | < .
Define the linear process by X t = j = α j ε t j , t 1 and the partial sum T n = t = 1 n X t , where { α j , j Z } is a sequence of real numbers satisfying A = | j = α j | 0 ,   j = | α j | < . Then we have
V lim sup n | T n | a n A σ ¯ = 1 ,
where a n = 2 n log log n , log n = ln ( n e ) , log log n = ln ln ( n e e ) , n 1 .
Remark 2.
If α 0 = 1 , α j = 0 , j 0 , Theorem 1 can be regarded as Lemma 3.
Remark 3.
In particular, according to Proposition 4.1 in Zhang [10], for the random variable sequence of IID, if V is continuous, then E ^ is linear. Then, the LIL of this paper is the known result of classical probability space.

3. Proofs

In order to prove the main results, we need the following Lemmas. The first one was the convergence part of the Borel–Cantelli Lemma.
Lemma 1
([20]). Let { A n , n 1 } be a sequence of events in F . Suppose that V is a countably sub-additive capacity. If n = 1 V ( A n ) < then
V ( A n i . o . ) = 0 , w h e r e { A n i . o . } = n = 1 i = n A i .
The second Lemma on the exponential inequality is Lemma 2.1 of Zhang [9].
Lemma 2
([9]). Let { Z n , k : k = 1 , . . . , k n } be an array of independent random variables, such that E ^ [ Z n , k ] 0 and E ^ [ Z n , k 2 ] < , k = 1 , . . . , k n . Then for all x , y > 0
V max m k n k = 1 m Z n , k x V max k k n Z n , k y + exp x y x y B n x y + 1 ln 1 + x y B n ,
where B n = k = 1 k n E ^ [ Z n , k 2 ] .
The following Lemma is a law of iterated logarithm under sub-linear expectation.
Lemma 3.
Let { ε n , n 1 } be a sequence of IID random variables in ( Ω , H , E ^ ) with E ^ ^ [ ε 1 ] = E ^ [ ε 1 ] = 0 . Write E ^ [ ε 1 2 ] = σ ¯ 2 , E [ ε 1 2 ] = σ ̲ 2 , S n = k = 1 n ε k . Suppose that the conditions ( A 2 ) and ( A 3 ) in Theorem 1 hold. If V is countably sub-additive, then we have
V lim sup n | S n | a n σ ¯ = 1 .
Proof. 
Obviously, (4) can be directly derived from Theorem 3.11 and (4.29) in Zhang [13]. □
Lemma 4.
Let { ε n , n Z } be a sequence of IID random variables on the ( Ω , H , E ^ ) with E ^ [ ε 1 ] = E ^ [ ε 1 ] = 0 and σ ¯ 2 = E ^ [ ε 1 2 ] , σ ̲ 2 = E ^ [ ε 1 2 ] . Further assume that E ^ is countably sub-additive and the condition ( A 1 ) in Theorem 1 hold. Then we have
E ^ sup n ( 2 n log log n ) 1 / 2 | k = 1 n ε k | < .
Proof. 
Note that E ^ is countably sub-additive, if C V [ | ε | ] < , then E ^ [ | ε | ] C V [ | ε | ] < . Hence, to prove (5), it suffices to prove
C V sup n ( 2 n log log n ) 1 / 2 | k = 1 n ε k | < .
By the definition of C V , we have
C V sup n ( 2 n log log n ) 1 / 2 | k = 1 n ε k | = 0 V sup n | k = 1 n ε k | ( 2 n log log n ) 1 / 2 > x d x = 0 D V sup n | k = 1 n ε k | ( 2 n log log n ) 1 / 2 > x d x + D V sup n | k = 1 n ε k | ( 2 n log log n ) 1 / 2 > x d x = D + l = 0 D V max 2 l n < 2 l + 1 | k = 1 n ε k | ( 2 n log log n ) 1 / 2 > x d x = D + l = 0 D V max 2 l n < 2 l + 1 | k = 1 n ε k | > x ( 2 · 2 l log log 2 l ) 1 / 2 d x ,
where D > 1 , value to be determined.
Let b k = ( k / log log k ) 1 / 2 , k 1 . We define
ε ˜ k = ( x b k ) ( ε k x b k ) .
Noting that
k = 1 n ε k k = 1 n ε ˜ k + k = 1 n ( ε k ε ˜ k ) k = 1 n ( ε ˜ k E ^ [ ε ˜ k ] ) + k = 1 n E ^ [ ε ˜ k ] + k = 1 n ( ε k ε ˜ k ) .
According to the Lemma condition E ^ [ ε 1 ] = E ^ [ ε 1 ] = 0 , we know that
k = 1 n E ^ [ ε ˜ k ] k = 1 n ( E ^ [ ε k ] E ^ [ ε ˜ k ] ) k = 1 n E ^ | ε k ε ˜ k | k = 1 n E ^ [ | ε k | I { | ε k | > x b k } ] k = 1 n E ^ [ ε k 2 ] x b k c k = 1 n 1 x b k c · 1 x ( n log log n ) 1 / 2 .
Then, by (9), and for x > D large enough, we have
max 2 l 1 n < 2 l k = 1 n E ^ [ ε ˜ k ] c · 1 x ( 2 l + 1 log log 2 l + 1 ) 1 / 2 x 4 ( 2 · 2 l log log 2 l ) 1 / 2 .
Hence, by (8), we obtain
l = 0 D V max 2 l n < 2 l + 1 k = 1 n ε k > x ( 2 · 2 l log log 2 l ) 1 / 2 d x l = 0 D V max 2 l n < 2 l + 1 k = 1 n ( ε ˜ k E ^ [ ε ˜ k ] ) > x 4 ( 2 · 2 l + 1 log log 2 l ) 1 / 2 d x + l = 0 D V max 2 l n < 2 l + 1 k = 1 n ( ε k ε ˜ k ) > x 2 ( 2 · 2 l + 1 log log 2 l ) 1 / 2 d x : = I 1 + I 2 .
First, to estimate I 2 , by (11), we get
I 2 c l = 0 D E ^ max 2 l n < 2 l + 1 k = 1 n ( ε k ε ˜ k ) x ( 2 l log log 2 l ) 1 / 2 d x c l = 0 D k = 1 2 l + 1 E ^ | ε k | I { | ε k | > x b k } x ( 2 l log log 2 l ) 1 / 2 d x .
It is important to note that the identical distribution under E ^ is defined through continuous functions in C l , L i p and the indicator function of an event is not continuous. We need to modify the indicator function by functions in C l , L i p . So, let g ϵ be a function satisfying that its derivatives of each order are bounded, g ϵ ( x ) = 1 if x 1 , g ϵ ( x ) = 0 if x 1 ϵ , and 0 g ϵ ( x ) 1 for all x, where 0 < ϵ < 1 . Then
g ϵ ( · ) C l , L i p ( R ) , I { x 1 } g ϵ ( x ) I { x > 1 ϵ } .
For ϵ = 1 2 in (13), by (1) and (12), we have
I 2 c l = 0 D k = 1 2 l + 1 E ^ | ε k | g ( ε k x b k ) x ( 2 l log log 2 l ) 1 / 2 d x = c l = 0 D k = 1 2 l + 1 E ^ | ε 1 | g ( ε 1 x b k ) x ( 2 l log log 2 l ) 1 / 2 d x c l = 0 D k = 1 2 l + 1 E ^ | ε 1 | I { | ε 1 | > 1 2 x b k } x ( 2 l log log 2 l ) 1 / 2 d x
Using condition ( A 1 ) . For some δ > 0 , it is obvious that
k = 1 2 l + 1 E ^ | ε 1 | I { | ε 1 | > 1 2 x b k } k = 1 2 l + 1 E ^ ε 1 2 ( log | ε 1 | ) 1 + δ 1 | ε 1 | ( log | ε 1 | ) 1 + δ I { | ε 1 | > 1 2 x b k } E ^ ε 1 2 ( log | ε 1 | ) 1 + δ k = 1 2 l + 1 1 1 2 x b k · 1 ( log 1 2 x b k ) 1 + δ c k = 1 2 l + 1 log log k k · 1 ( log k ) 1 + δ · 1 x c 2 l + 1 log log 2 l ( log 2 l + 1 ) 1 + δ · 1 x .
Combining (12), (14) and (15), we get
I 2 c l = 0 D 1 x 2 l log log 2 l · 2 l log log 2 l ( log 2 l ) 1 + δ · 1 x d x l = 0 c D 1 x 2 d x · 1 ( log 2 l ) 1 + δ l = 0 c 1 ( l log 2 ) 1 + δ < .
Next, to estimate I 1 . Noting that
I 1 l = 0 D V max l n < 2 l + 1 k = 1 n ( ε ˜ k E ^ [ ε ˜ k ] ) > x 4 c 1 ( 2 l + 1 log log 2 l + 1 ) 1 / 2 d x .
By the properties of IID random variables, { ε ˜ k E ^ [ ε ˜ k ] } is also a sequence of IID random variables, E ^ [ ε ˜ k E ^ [ ε ˜ k ] ] = 0 , | ε ˜ k E ^ [ ε ˜ k ] | 2 x b k 2 x b 2 l + 1 for every k and E ^ [ ε ˜ k E ^ [ ε ˜ k ] ] 2 4 E ^ [ ε ˜ k 2 ] = 4 E ^ [ ε 1 2 x 2 b k 2 ] = 4 σ ¯ 2 < , B n 2 l + 1 · 4 σ ¯ 2 . Taking y = 2 x b 2 l + 1 in (3), then
x 4 c 1 ( 2 l + 1 log log 2 l + 1 ) 1 / 2 y = c 1 4 log log 2 l + 1 = A log log 2 l + 1 , ( w h e r e A : = c 1 4 ) ,
and
x 4 c 1 ( 2 l + 1 log log 2 l + 1 ) 1 / 2 · y B n = x 2 4 c 1 · 1 4 σ ¯ 2 = c 1 x 2 16 σ ¯ 2 = B x 2 , ( w h e r e B : = c 1 16 σ ¯ 2 ) .
For a sufficiently large x, there is a constant c 2 < 1 , such that log ( 1 + B x 2 ) c 2 log x 2 . Choose D large enough to make ( D c 2 1 ) A > 1 . And since D log log 2 l + 1 = O ( ( log 2 l + 1 ) D ) , using Lemma 2, we have
I 1 l = 0 D exp A log ( log 2 l + 1 ) 1 log ( 1 + B x 2 ) d x l = 0 ( log 2 l + 1 ) A D exp A c 2 log log 2 l + 1 log x d x c l = 0 ( log 2 l + 1 ) A D 1 x A c 2 log log 2 l + 1 d x c l = 0 ( log 2 l + 1 ) A 1 ( D log log 2 l + 1 ) A c 2 c l = 0 ( log 2 l + 1 ) A 1 ( log 2 l + 1 ) D A c 2 c l = 0 1 ( log 2 l + 1 ) ( D c 2 1 ) A < .
Combining (11), (16), and (18), we get
l = 0 D V max 2 l n < 2 l + 1 k = 1 n ε k > x ( 2 · 2 l log log 2 l ) 1 / 2 d x < .
For ( k = 1 n ε k ) , we have the same convergence as the above. Then, we obtain
l = 0 D V max 2 l n < 2 l + 1 | k = 1 n ε k | > x ( 2 · 2 l log log 2 l ) 1 / 2 d x < .
From (7) and (19), (6) holds. So Lemma is proved.  □
Proof of Theorem 1. 
For m , n , t N , define
Y m , n = 1 a n t = 1 n j = m m α j ε t j , α ˜ m = 0 , α ˜ j = i = j + 1 m α i , j = 0 , 1 , · · · , m 1 , α ˜ ˜ m = 0 , α ˜ ˜ j = i = m j 1 α i , j = m + 1 , m + 2 , · · · , 0 , ε t ˜ = j = 0 m α ˜ j ε t j , ε ˜ ˜ t = j = m 0 α ˜ ˜ j ε t j .
Obviously, we have
Y m , n = j = m m α j 1 a n t = 1 n ε t + 1 a n ( ε ˜ 0 ε ˜ n + ε ˜ ˜ n + 1 ε ˜ ˜ 1 ) ,
1 a n t = 1 n X t = Y m , n + 1 a n t = 1 n | j | > m α j ε t j .
First note that
ε ˜ 0 a n = ( 2 n log log n ) 1 / 2 j = 0 m i = j + 1 m α i ε j 0 a . s . V , n ,
and
ε ˜ ˜ 1 a n = ( 2 n log log n ) 1 / 2 j = m 0 i = m j 1 α i ε 1 j 0 a . s . V , n .
For any δ > 0 , the Lemma 4.5 in Zhang [13] shows that
n = 1 V ( | ε 1 | > δ a n ) < C V | ε 1 | 2 log log | ε 1 | < .
Hence by (1), ( A 3 ) and let g ϵ ( · ) be a smooth function satisfying (13), for any δ > 0
n = 1 V ( | ε n j | / a n > δ ) n = 1 E ^ g 1 2 | ε n j | a n δ = n = 1 E ^ g 1 2 | ε 1 | a n δ ( s i n c e ε n j = d ε 1 ) n = 1 V ( | ε 1 | > 1 2 δ a n ) c C V | ε 1 | 2 log log | ε 1 | < .
By the Lemma 1 (Borel–Cantelli Lemma), we have
V ( lim sup n | ε n j | a n > δ ) = 0 , δ > 0 .
So we get
V ( lim sup n | ε n j | a n δ ) = 1 , δ > 0 .
Thus
ε ˜ n a n = ( 2 n log log n ) 1 / 2 j = 0 m i = j + 1 m α i ε n j 0 a . s . V , n .
Using the proof similar to the above formula, we get
ε ˜ ˜ n + 1 a n = ( 2 n log log n ) 1 / 2 j = m 0 i = m j 1 α i ε n + 1 j 0 a . s . V , n .
So, we conclude that
1 a n ( ε ˜ 0 ε ˜ n + ε ˜ ˜ n + 1 ε ˜ ˜ 1 ) 0 a . s . V , n .
Combining with (20), (21), and (22), we have
lim sup n | T n | a n = lim sup n | Y m , n + | j | > m α j 1 a n t = 1 n ε t j | lim sup n | j = m m α j | 1 a n | t = 1 n ε t | + lim sup n | j | > m | α j | 1 a n | t = 1 n ε t j | lim sup n | j = m m α j | 1 a n | t = 1 n ε t | + | j | > m | α j | sup n 1 a n | t = 1 n ε t j | .
By the stationariness of { ε k } and the Lemma 4, we have
E ^ sup n ( 2 n log log n ) 1 / 2 | t = 1 n ε t j | = E ^ sup n ( 2 n log log n ) 1 / 2 | t = 1 n ε t | < ,
then
sup n ( 2 n log log n ) 1 / 2 t = 1 n ε t j < .
The countably sub-additive of E ^ shows that V is countably sub-additive. Then, according to the condition of Lemma 3, { ε i } satisfies (4). Next, using (4) and (24), let m in (23), we get
lim sup n | T n | a n | j = α j | σ ¯ a . s . V .
So, we obtain
V lim sup n | T n | a n A σ ¯ = 1 .
The proof of Theorem 1 now completes.  □

4. Conclusions

This paper mainly studies the LIL of linear processes under capacity induced by sub-linear expectation, which is based on Zhang [13]. According to the new concepts of distribution and independence under Peng’s framework, we define the strictly stationary sequence under sub-linear expectation, and further redefine the linear processes under sub-linear expectation. We first obtain Lemma 4 by truncating random variables, countably sub-additive of capacity and exponential inequality under sub-linear expectation. Secondly, the tail of the partial sum of linear processes tends to zero in the sense of capacity by using the decomposition of the partial sum of linear processes, Lemma 4, the transformation of Choquet expectation and integral. Finally, the main results of this paper are obtained by using Lemma 3.
The results obtained in this paper enrich the limit theory of capacity (non additive probability) and are also a natural generalization of the LIL under classical additive probability. The key to the main results of this paper is an exponential inequality. If we can establish the corresponding exponential inequalities for negative dependent (ND) sequences, then we can obtain the LIL of linear processes generated by stationary ND sequences under sub-linear expectation. ND sequences are weaker than independent sequences. Therefore, it is an impending problem to study the theoretical properties of ND sequences in sub-linear expectation, which is the subject of future research.

Author Contributions

Conceptualization, W.L. and Y.Z.; methodology, W.L.; validation, W.L. and Y.Z.; investigation, W.L.; writing—original draft preparation, W.L.; writing—review and editing, W.L. and Y.Z.; project administration, Y.Z.; funding acquisition, Y.Z. All authors have read and agreed to the published version of the manuscript.

Funding

The paper was supported by National Natural Science Foundation of China (Grant No. 11771178); the Science and Technology Development Program of Jilin Province (Grant No. 20170101152JC) and Science and Technology Program of Jilin Educational Department during the “13th Five-Year” Plan Period (Grant No. JJKH20200951KJ) and Fundamental Research Funds for the Central Universities.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Khinchine, A. Über einen Satz der Wahrscheinlichkeitsrechnung. Fund. Math. 1924, 6, 9–20. [Google Scholar] [CrossRef] [Green Version]
  2. Hartman, P.; Wintner, A. On the law of the iterated logarithm. Am. J. Math. 1941, 63, 169–176. [Google Scholar] [CrossRef]
  3. Acosta, A.D. A new proof of the hartman-wintner law of the iterated logarithm. Ann. Probab. 1983, 11, 270–276. [Google Scholar] [CrossRef]
  4. Shao, Q.M.; Su, C. The law of the iterated logarithm for negatively associated random variables. Stoch. Process. Appl. 1999, 83, 139–148. [Google Scholar] [CrossRef] [Green Version]
  5. Peng, S.G. Survey on normal distributions, central limit theorem, Brownian motion and the related stochastic calculus under sublinear expectations. Sci. China Math. 2009, 52, 1391–1411. [Google Scholar] [CrossRef]
  6. Feng, X.W. Law of the logarithm for weighted sums of negatively dependent random variables under sublinear expectation. Statist. Probab. Lett. 2019, 149, 132–141. [Google Scholar] [CrossRef]
  7. Deng, X.; Wang, X.J. On complete convergence for extended independent random variables under sub-linear expectations. J. Korean Math. Soc. 2020, 57, 553–570. [Google Scholar] [CrossRef]
  8. Tan, Y.Z.; Zong, G.F. Large deviation principle for random variables under sublinear expectations on ℝd. J. Math. Anal. Appl. 2020, 488, 124110. [Google Scholar] [CrossRef]
  9. Zhang, L.X. Heyde’s theorem under the sub-linear expectations. Statist. Probab. Lett. 2021, 170, 108987. [Google Scholar] [CrossRef]
  10. Zhang, L.X. On the law of the iterated logarithm under the sub-linear expectations. arXiv 2021, arXiv:2103.01390. [Google Scholar]
  11. Chen, Z.J.; Hu, F. A law of the iterated logarithm under sublinear expectations. Int. J. Financ. Eng. 2014, 1, 1450015. [Google Scholar] [CrossRef] [Green Version]
  12. Zhang, L.X. Donsker’s invariance principle under the sub-linear expectation with an application to chung’s law of the iterated logarithm. Commun. Math. Stat. 2015, 3, 187–214. [Google Scholar] [CrossRef] [Green Version]
  13. Zhang, L.X. Exponential inequalities under the sub-linear expectations with applications to laws of the iterated logarithm. Sci. China Math. 2016, 59, 2503–2526. [Google Scholar] [CrossRef] [Green Version]
  14. Hannan, E.J. Multivariate time series analysis. J. Multivar. Anal. 1973, 3, 395–407. [Google Scholar] [CrossRef] [Green Version]
  15. Phillips, P.C.B.; Solo, V. Asymptotic for linear processes. Ann. Statist. 1992, 20, 971–1001. [Google Scholar] [CrossRef]
  16. Zhang, Y. The limit law of the iterated logarithm for linear processes. Statist. Probab. Lett. 2017, 122, 147–151. [Google Scholar] [CrossRef]
  17. 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]
  18. Peng, S.G. G-Gxpectation, G-Brownian motion and related stochastic calculus of Ito’s type. Stoch. Anal. Appl. 2007, 2, 541–567. [Google Scholar]
  19. Peng, S.G. Nonlinear Expectations and Stochastic Calculus Under Uncertainty; Springer: Berlin/Heidelberg, Germany, 2019. [Google Scholar]
  20. 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]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

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. https://doi.org/10.3390/e23101313

AMA Style

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(10):1313. https://doi.org/10.3390/e23101313

Chicago/Turabian Style

Liu, Wei, and Yong Zhang. 2021. "The Law of the Iterated Logarithm for Linear Processes Generated by a Sequence of Stationary Independent Random Variables under the Sub-Linear Expectation" Entropy 23, no. 10: 1313. https://doi.org/10.3390/e23101313

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