Functional central limit theorem for ARCH(∞) models with weakly dependent innovations †
Oesook Lee 1
1 Department of Statistics, Ewha Womans University
Received 22 January 2021, revised 25 February 2021, accepted 26 February 2021
Abstract
Since the seminal work of Engle (1982) and Bollerslev (1986), many ARCH-type models have been suggested and examined to explain a variety of stylized facts of finan- cial and economic time series. Various popular ARCH-type models can be expressed as ARCH(∞) models. In this paper, we study the stationarity and functional central limit theorem (FCLT) for ARCH(∞) models, because statistical inferences for ARCH(∞) se- quences require the study of asymptotics of various statistics concerned. Most previous results are obtained under independent and identically distributed (i.i.d.) innovation processes. But the i.i.d. assumption on innovations substantially restricts the flexibil- ity of the models. In addition, many authors have shown that the i.i.d. assumption can be weakened to mild conditions. We consider the ARCH(∞) model where the innovation processes are strictly stationary and λ-weakly dependent instead of inde- pendent and identically distributed. We provide sufficient conditions for the existence of a unique stationary and λ-weakly dependent Volterra series type solution to the given ARCH(∞) process. The FCLT for the stationary and λ-weakly dependent solution is also obtained by adding weak dependence coefficients condition on innovations and condition on ARCH(∞) parameters. The FCLT for GARCH(p, q) model with λ-weakly dependent innovations is considered as an example.
Keywords: Functional central limit theorem, λ-weakly dependent process, stationarity.
1. Introduction
After Engle (1982) and Bollerslev (1986), autoregressive conditional heteroscedastic (ARCH) model and its various modified ARCH-type models have been suggested and studied in order to explain a variety of stylized facts of financial and economic time series and related fields (see, for example, Francq and Zako¨ıan, 2010; Jeong and Lee, 2019; Kim and Lee, 2018 etc.).
† This research was supported by Basic Science Research Program through the NRF funded by the Ministry of Education, Science and Technology ( 2018R1D1A1B07044546).
1
Professor, Department of Statistics, Ewha Womans University, Ewhayeodaegil 52, Seoul 03760, Korea.
E-mail: [email protected]
General nonnegative ARCH(∞) sequence is one of those and various popular ARCH-type models can be represented in this framework. The ARCH(∞) process is given by
X t = ρ t ξ t , ρ t = a +
∞
X
j=1
b j X t−j , (1.1)
where a > 0, b j ≥ 0, j = 1, 2, · · · and ξ t is a sequence of nonnegative stationary random variables. Giraitis et al. (2000), Zaffaroni (2004), Douc et al. (2008), Doukhan et al. (2006) and Lee (2018) among many others examined the ARCH(∞) model under independent and identically distributed (i.i.d.) assumptions on ξ t . Strict stationarity, weak stationarity, existence of moments, and asymptotic behaviors of the process including the FCLT are investigated. The FCLT is of great importance in recent research on the process because statistical inferences for ARCH sequences require the study of the asymptotics of various statistics concerned. For example, the FCLT can be used to investigate such as the structural breaks of the data via e.g., CUSUM or MOSUM. The FCLT for ARCH-type processes has been studied by using various mixing properties, association, near epoch dependent (NED) properties, and (θ, η, λ)-weakly dependent properties(see Billingsley, 1968; Davidson, 2002;
Dedecker and Doukhan, 2003; Bardet et al., 2006; Doukhan and Wintenberger, 2007; Berkes et al., 2008; Hwang and Shin, 2016, and references therein).
Nze et al. (2002), Bardet et al. (2006), and Doukhan et al. (2007) showed the (θ, η, λ)-weak properties of infinite ARCH-type model with i.i.d. centered errors. When a given process is λ-weakly dependent, the FCLT for the process can be derived by adopting the following theorem.
Theorem (Doukhan and Wintenberger, 2007) Let (X t , t ∈ Z) be real valued stationary and λ-weakly dependent sequence of random variables satisfying E|X 0 | m < ∞ for a real number m > 2. If λ(r) = O(r −λ ) (as r → ∞) for λ > 4 + 2/(m − 2), then σ 2 < ∞ and
W n (t) = 1
√ n
[nt]
X
i=1
(X i − E(X i )) −→ σW t , t ∈ [0, 1], n ≥ 0
in the Skorohod space D([0, 1]), where W t is the standard Brownian motion.
Most of the aforementioned results about ARCH(∞) processes assumed i.i.d. standardized innovations, but the i.i.d. assumption on innovations restricts substantially the flexibility of ARCH-type models. Lee and Hansen (1994) observed rescaled parameter e t = u t /σ t , where σ t 2 = a + P ∞
j=1 b j u 2 t−j (a > 0, b j ≥ 0) is not need to be independent. Probabilistic and statistical properties of ARCH-type models under mild conditions on the innovations have been studied by for example, Drost and Nijman (1993), Berkes et al. (2003), Linton et al.
(2010), Li and Wu (2018), and Lee (2020) etc.
In this paper, we study the λ-weak dependence properties of ARCH(∞) process gener- ated by the equation (1.1) with strictly stationary and λ-weakly dependent innovations {ξ t }.
Conditions for the existence of a strictly and weakly stationary Volterra series type solution
to (1.1) are given. The (functional) central limit theorem for stationary and λ-weakly depen-
dent process X t with proper dependence coefficients is also obtained. The results obtained
help to better understand the behavior of the volatility.
2. Main results
Consider the following ARCH(∞) model given by
X t = ρ t ξ t , (2.1)
ρ t = a +
∞
X
j=1
b j X t−j , t ∈ Z, (2.2)
where {ξ t , t ∈ Z} is a sequence of nonnegative strictly stationary random variables defined on some probability space (Ω, F , P ) and a > 0, b j ≥ 0, j = 1, 2, · · · .
Define F t = σ(· · · , ξ t−2 , ξ t−1 , ξ t ) and kXk p = (E|X| p ) 1/p , 1 ≤ p < ∞.
We make the assumption:
(A1) E(ξ t p |F t−1 ) ≤ G p < ∞, p > 0.
We first establish sufficient conditions for the existence of the stationary solution to (2.1) and (2.2) in L p .
Let p > 0 and we define
ϕ = X
j≥1
b p∧1 j G 1/(p∨1) p . (2.3)
Theorem 2.1 (1) If the assumption (A1) and ϕ < 1 hold, then a stationary solution in L p to the equation (2.1)-(2.2) is given by
X t = aξ t + a
∞
X
k=1
∞
X
j
1,··· ,j
k=1
b j
1· · · b j
kξ t ξ t−j
1· · · ξ t−j
1−···−j
k. (2.4)
(2) Assume that with p ≥ 1, (A1) and ϕ = P
j≥1 b j G 1/p p < 1 hold. If Y t is a F t measurable stationary solution to the equation (2.1) and (2.2) with E|Y t | p < ∞, then X t = Y t a.s.
Proof: (1) For 0 < p < 1,
E|
∞
X
k=1
∞
X
j
1,··· ,j
k=1
b j
1· · · b j
kξ t ξ t−j
1· · · ξ t−j
1−···−j
k| p
≤
∞
X
k=1
∞
X
j
1,··· ,j
k=1
E|b j
1· · · b j
kξ t ξ t−j
1· · · ξ t−j
1−···−j
k| p
≤ G p
∞
X
k=1
ϕ k < ∞,
where ϕ = P ∞
j=1 b p j G p .
Now let 1 ≤ p < ∞. From (A1), kξ t ξ t−j
1· · · ξ t−j
1−···−j
kk p p ≤ G k+1 p . Use Minkowski’s inequality to have that
kX t k p ≤ akξ t k p + a
∞
X
k=1
∞
X
j
1,··· ,j
k=1
b j
1· · · b j
kkξ t ξ t−j
1· · · ξ t−j
1−···−j
kk p
≤ akξ t k p + a
∞
X
k=1
∞
X
j
1,··· ,j
k=1
b j
1· · · b j
kG (k+1)/p p
≤ aG 1/p p (1 +
∞
X
k=1
(
∞
X
j=1
b j G 1/p p ) k
= aG 1/p p (1 +
∞
X
k=1
ϕ k ) < ∞,
where ϕ = P ∞
j=1 b j G 1/p p .
It is obvious that X t in (2.4) is a solution of (2.1) and (2.2) and it is stationary, since ξ t
is stationary.
(2) We write recursively that
Y t = ξ t (a + a
m
X
k=1
X
j
1,··· ,j
k≥1
b j
1ξ t−j
1· · · b j
kξ t−j
1−···−j
k)
+ξ t ( X
j
1,··· ,j
m+1≥1
b j
1ξ t−j
1· · · b j
mξ t−j
1−···−j
mb j
m+1Y t−j
1−···−j
m).
Then
X t − Y t = ξ t (a X
k>m
X
j
1,··· ,j
k≥1
b j
1ξ t−j
1· · · b j
kξ t−j
1−···−j
k)
−ξ t ( X
j
1,··· ,j
m+1≥1
b j
1ξ t−j
1· · · b j
mξ t−j
1−···−j
mb j
m+1Y t−j
1−···−j
m),
and
kX t − Y t k p ≤ ϕ m+1
1 − ϕ aG 1/p p + kY 0 k p ϕ m+1 → 0
as m → ∞. Thus X t = Y t a.s.
Recall that X t in (2.4) can be rewritten as
X t = aξ t + a
∞
X
k=1
∞
X
j
k<j
k−1<···<j
1<t
b t−j
1· · · b j
k−1−j
kξ t ξ j
1· · · ξ j
k.
Remark 1. (Stationarity for i.i.d. case) Suppose that {ξ t , t ∈ Z} is a sequence of
independent and identically distributed random variables. Then X t in (2.4) is a solution to
(2.1) and (2.2). (1) If E(ξ 0 ) < ∞ and E(ξ 0 ) P b j < 1, then X t in (2.4) is strictly stationary
with E(X t ) < ∞. (2) If E(ξ 0 2 ) < ∞ and kξ 0 k 2 P b j < 1, then X t is also weakly stationary (Giraitis et al., 2000).
We recall the definition of λ-weakly dependent introduced by Doukhan and Louhichi (1999).
For a function h : R d → R, we set
Lip(h) = sup (x
1,··· ,x
d)6=(y
1,··· ,y
d) |h(x 1 , · · · , x d ) − h(y 1 , · · · , y d )|
P d
i=1 |x i − y i | .
Let L be the set of real valued functions h on R u for some positive integer u such that khk ∞ ≤ 1 and Lip(h) < ∞. A process (X t , t ∈ Z) with values in R is (, ψ) weakly dependent process if there exist a sequence ( r , r ∈ N ) such that r → 0 as r → ∞ and a function ψ : N 2 × (R + ) 2 → R + such that
|Cov(f (X i
1, · · · , X i
u), g(X j
1, · · · , X j
v))| ≤ ψ(u, v, Lip(f ), Lip(g)) r ,
for any r ≥ 0, any (u + v)-tuples such that i 1 ≤ · · · ≤ i u ≤ i u + r ≤ j 1 ≤ · · · ≤ j v , and any functions f, g ∈ L which are defined on R u and R v respectively. (X t , t ∈ Z) is said to be λ-weakly dependent if ψ(u, v, a, b) = ua + vb + uvab. In this case we write r = λ r or λ X
t(r).
With X t given by (2.4), define
U = (X i
1, X i
2, · · · , X i
u), V = (X j
1, X j
2, · · · , X j
v). (2.5) Choose s ≥ 1 arbitrarily and fix. Define
U ˆ (s) = ( ˆ X i (s)
1, ˆ X i (s)
2, · · · , ˆ X i (s)
u), ˆ V (s) = ( ˆ X j (s)
1, ˆ X j (s)
2, · · · , ˆ X j (s)
v), (2.6) where ˆ X t (s) is given by
X ˆ t (s) = aξ t + aξ t
∞
X
k=1
X
j
1+···+j
k<s
b j
1· · · b j
kξ t−j
1· · · ξ t−j
1−···−j
k. (2.7)
We set A(x) = P
j≥x b j and assume that f, g ∈ L.
Lemma 2.1 Suppose that with p > 1 (A1) and ϕ < 1 hold. Then |E(f (U ) − f ( ˆ U (s) ))| ≤ Lip(f )uθ s and |E(g(V ) − g( ˆ V (s) ))| ≤ Lip(g)vθ s where
θ s = aG 1/p p G 1/p p
s−1
X
k=1
kϕ k−1 A(s/k) + ϕ s /(1 − ϕ)
!
. (2.8)
Proof: Note that for any t ∈ Z, E|X t − ˆ X t (s) | = E|aξ t
∞
X
k=1
X
j
1+···+j
k≥s
b j
1· · · b j
kξ t−j
1· · · ξ t−j
1−···−j
k|
≤ aG 1/p p
s−1
X
k=1
k X
j
1≥s/k
b j
1X
j
2,···j
k≥1
b j
2· · · b j
kG k/p p
+aG 1/p p
∞
X
k=s
X
j
1,··· ,j
k≥1
b j
1· · · b j
kG k/p p
≤ aG 1/p p G 1/p p
s−1
X
k=1
kϕ k−1 A(s/k) + ϕ s /(1 − ϕ)
!
= θ s . Thus, |E(f (U ) − f ( ˆ U (s) ))| ≤ Lip(f ) P u
j=1 E|X i
j− ˆ X i (s)
j
| ≤ Lip(f )uθ s . Similarly, we have that
|E(g(V ) − g( ˆ V (s) ))| ≤ Lip(g)
v
X
i=1
E|X j
i− ˆ X j (s)
i
| ≤ Lip(g)vθ s .
Remark 2. (1) Note that θ s → 0 as s → ∞.
(2) It is known that if b, C > 0 and 0 ≤ ρ < 1, then for suitable choice of K, K 0 , we have that θ s ≤ K (log s) s
bb∨1for A(x) ≤ Cx −b and θ s ≤ K 0 (ρ ∨ ϕ)
√ s for A(x) ≤ Cρ x (Doukhan et al., 2006).
We make the additional assumption:
(A2) {ξ t } is λ-weakly dependent with ψ(u, v, a, b) = (ua + vb + uvab) and the weak depen- dence coefficients λ ξ (r).
Lemma 2.2 Consider the process ˆ X t (s) defined by the equation (2.7). Suppose that the assumptions (A1) and (A2) hold and there is (m, m 0 ) with E|ξ t | m
0< ∞, for m > 2 and m 0 ≥ (s + 1)m. Then ˆ X t (s) is λ-weakly dependent with weak dependence coefficients
λ 0 ˆ
X
t(s)(r) = c
X
j≥[r/3]
ja (s) j + ([2r/3] + 1) 2 λ ξ ([r/3]) 1/2
.
Here c is some constant, a (s) j is defined in the proof below, and [x] denotes the largest integer less than or equal to x.
Proof: For x = (x i ≥ 0, i ∈ Z), define
H s (x) = ax 0 + ax 0 s−1
X
k=1
X
j
1+···+j
k<s
b j
1· · · b j
kx j
1x j
1+j
2· · · , x j
1+···+j
k.
Then ˆ X t (s) = H s (ξ t−j , j ∈ Z). Let
B 0,k (s) = X
j
1+···+j
k<s
b j
1· · · b j
k,
B l,k (s) =
k
X
u=1
X
j1+···+ju=l