Skip to main content
Springer logoLink to Springer
. 2017 Oct 2;2017(1):241. doi: 10.1186/s13660-017-1517-6

Convergence rates in the law of large numbers for long-range dependent linear processes

Tao Zhang 1, Pingyan Chen 2, Soo Hak Sung 3,
PMCID: PMC5624989  PMID: 29046604

Abstract

Baum and Katz (Trans. Am. Math. Soc. 120:108-123, 1965) obtained convergence rates in the Marcinkiewicz-Zygmund law of large numbers. Their result has already been extended to the short-range dependent linear processes by many authors. In this paper, we extend the result of Baum and Katz to the long-range dependent linear processes. As a corollary, we obtain convergence rates in the Marcinkiewicz-Zygmund law of large numbers for short-range dependent linear processes.

Keywords: linear process, convergence rate, Marcinkiewicz-Zygmund law of large numbers

Introduction

There are many literature works concerning the convergence rates in the Marcinkiewicz-Zygmund law of large numbers. One can refer to Alf [2], Alsmeyer [3], Baum and Katz [1], Heyde and Rohatgi [4], Hu and Weber [5], Rohatgi [6], and so on.

Baum and Katz [1] obtained the following convergence rates in the Marcinkiewicz-Zygmund law of large numbers.

Theorem 1.1

Baum and Katz [1]

Let r1, 1p<2 and {X,Xn,n1} be a sequence of independent and identically distributed (i.i.d.) random variables. Then EX=0 and E|X|rp< imply

n=1nr2P(|k=1nXk|>n1/pε)<for all ε>0.

When r=2, the cases of p=1 and 1p<2 have already been proved by Hsu and Robbins [7] and Katz [8], respectively.

Let {ζi,iZ} be a sequence of i.i.d. random variables and {ai,iZ} be a sequence of real numbers. Here and in the following, Z denotes the set of all integers. Then {Xn,n1} is called a linear process or an infinite order moving average process if Xn is defined by

Xn=i=ai+nζifor n1. 1.1

If i=|ai|<, then {Xn,n1} has short memory or is short-range dependent. If i=|ai|=, then {Xn,n1} has long memory or is long-range dependent (see Chapter 3 in Giraitis et al. [9]).

In the short-range dependent case, Koopmans [10] showed that if ζ0 has the moment generating function, then the strong law of large numbers for the linear process holds with exponential convergence rate. Hanson and Koopmans [11] generalized this result to a class of linear processes of independent but non-identically distributed random variables {ζi,iZ} and to arbitrary subsequences of {Xn,n1}. Li et al. [12] extended Katz [8] theorem to the setting of short-range dependent linear processes.

Theorem 1.2

Li et al. [12]

Let 1p<2. Let {ai,iZ} be an absolutely summable sequence of real numbers. Suppose that {Xn,n1} is the linear process of a sequence {ζi,iZ} of i.i.d. random variables with mean zero and E|ζ0|2p<. Then

n=1P(|k=1nXk|>n1/pε)<for all ε>0.

Note that Theorem 1.2 corresponds to Theorem 1.1 with r=2. Zhang [13] extended Theorem 1.1 with r>1 to the short-range dependent linear process of a sequence of identically distributed φ-mixing random variables. Since independent random variables are also φ-mixing, it follows by Zhang [13] theorem that Theorem 1.2 also holds for r>1.

In this paper, we obtain convergence rates in the Marcinkiewicz-Zygmund law of large numbers for long-range dependent linear processes of i.i.d. random variables. For convenience of notation, let

Wn(t)=(i=|ωni|t)1/tfor n1 and t>0,

where ωni=k=1nai+k. In the long-range dependent case, Characiejus and Račkauskas [14] obtained the convergence rate in the Marcinkiewicz-Zygmund law of large numbers for the linear process {Yn,n1} which is slightly different from (1.1) and defined by

Yn=i=0aiζnifor n1, 1.2

where ai=0 if i<0.

Theorem 1.3

Characiejus and Račkauskas [14]

Let {Yn,n1} be defined as above and 1<p<2. Let {ai,iZ} be a sequence of real numbers such that

i=|ai|p<,

where ai=0 if i<0. Assume that

Wn(q)/Wn(p)=O(n1/q1/p)for some q(p,2].

If Eζ0=0 and E[|ζ0|plog(1+|ζ0|)]<, then

n=1n1P(|k=1nYk|>Wn(p)ε)<for all ε>0. 1.3

The above theorem shows a convergence rate in the Marcinkiewicz-Zygmund weak law of large numbers with the norming sequence Wn(p).

We now compare Theorem 1.3 with Theorem 1.1. Since Theorem 1.3 deals with only the case r=1, it is interesting to prove that Theorem 1.3 holds for the case r>1. When r=1, Theorem 1.1 requires a finite pth moment condition, but Theorem 1.3 requires more than finite pth moment. To apply Theorem 1.3, it is necessary to estimate Wn(p). If {ai,iZ} is an absolutely summable sequence, then we have, by the result of Burton and Dehling [15] (see also Lemma 2.4), that for any t>0

1nWnt(t)i=ai,

and hence (1.3) holds with Wn(p) replaced by n1/p. However, for the long-range dependent case, it is not easy to estimate Wn(t).

In this paper, we extend Theorem 1.1 to the long-range dependent linear processes. As a corollary, we obtain a long-range dependent setting of Theorem 1.2. Further, we propose a method to estimate Wn(t) for the long-range dependent case.

Throughout this paper, C denotes a positive constant which may vary at each occurrence. For events A and B, I(A) denotes the indicator function of the event A, and I(A,B)=I(AB).

Convergence of long-range dependent linear processes

In this section, we extend Theorem 1.1 to the long-range dependent linear processes. To prove the main results, we need the following lemmas. The first one is the von Bahr-Esseen inequality (see von Bahr and Esseen [16]). The second is known as Fuk-Nagaev inequality (see Corollary 1.8 in Nagaev [17]).

Lemma 2.1

Let {ζi,i1} be a sequence of independent random variables with Eζi=0 and E|ζi|t< for some 1t2. Then, for all n1,

E|i=1nζi|tCti=1nE|ζi|t,

where Ct>0 is a positive constant depending only on t.

Lemma 2.2

Let {ζi,i1} be a sequence of independent random variables with Eζi=0. Then, for any t2 and x>0,

P(|i=1nζi|>x)(1+2/t)txti=1nE|ζi|t+2exp{2x2(t+2)2eti=1nVar(ζi)}.

The following lemma is well known and can be easily proved by using a standard method.

Lemma 2.3

Let p>0 and ζ be a random variable. Then the following statements hold.

  • (i)

    If 0<θ<p, then n=1nθ/pE|ζ|θI(|ζ|>n1/p)CE|ζ|p.

  • (ii)

    If p<q, then n=1nq/pE|ζ|qI(|ζ|n1/p)CE|ζ|p.

  • (iii)

    If r>1, then n=1nr2E|ζ|pI(|ζ|>n1/p)CE|ζ|rp.

  • (iv)

    If rp<q, then n=1nr1q/pE|ζ|qI(|ζ|n1/p)CE|ζ|rp.

The following lemma is useful to estimate Wn(t) when the sequence {ai,iZ} is absolutely summable. However, it is not applicable to the long-range dependent case.

Lemma 2.4

Burton and Dehling [15]

Let i=ai be an absolutely convergent series of real numbers with a=i=ai. Then, for any t>0,

limn1ni=|ωni|t=|a|t,

where ωni=k=1nai+k.

We now state and prove our main results. The first theorem treats the case r>1.

Theorem 2.1

Let r>1 and 1p<2. Let {ai,iZ} be a sequence of real numbers with

i=|ai|p<.

Suppose that {Xn,n1} is the linear process of a sequence {ζi,iZ} of i.i.d. random variables with mean zero and E|ζ0|rp<. Furthermore, assume that one of the following conditions holds.

  1. If 1<rp<2, then
    Wn(q)/Wn(p)=O(n1/q1/p)for some q(rp,2).
  2. If rp2, then
    Wn(q)/Wn(p)=O(n1/q1/p)for some q>rp
    and
    Wn(s)/Wn(p)=o((logn)1/s)for some s(p,2].
    Then
    n=1nr2P(|k=1nXk|>Wn(p)ε)<for all ε>0.

Proof

(1) For each n1, we have

k=1nXk=i=k=1nai+kζi=i=ωniζi=i=ωni[ζiI(|ζi|>n1/p)EζiI(|ζi|>n1/p)]+i=ωni[ζiI(|ζi|n1/p)EζiI(|ζi|n1/p)]:=Sn+Sn

and hence,

n=1nr2P(|k=1nXk|>Wn(p)ε)n=1nr2P(|Sn|>Wn(p)ε/2)+n=1nr2P(|Sn|>Wn(p)ε/2). 2.1

By the Markov inequality, Lemmas 2.1 and 2.3, we have

n=1nr2P(|Sn|>Wn(p)ε/2)n=1nr22pE|Sn|pεpWnp(p)Cn=1nr2i=|ωni|pE|ζ0|pI(|ζ0|>n1/p)i=|ωni|p=Cn=1nr2E|ζ0|pI(|ζ0|>n1/p)CE|ζ0|rp<.

Thus the first series on the right-hand side of (2.1) converges.

Similarly, by the Markov inequality, Lemmas 2.1 and 2.3, we have

n=1nr2P(|Sn|>Wn(p)ε/2)n=1nr22qE|Sn|qεqWnq(p)Cn=1nr2i=|ωni|qE|ζ0|qI(|ζ0|n1/p)Wnq(p)=Cn=1nr2(Wn(q)Wn(p))qE|ζ0|qI(|ζ0|n1/p)Cn=1nr2(n1/q1/p)qE|ζ0|qI(|ζ0|n1/p)=Cn=1nr1q/pE|ζ0|qI(|ζ0|n1/p)CE|ζ0|rp<.

Hence the second series on the right-hand side of (2.1) also converges.

(2) For each n1, we have

k=1nXk=i=k=1nai+kζi=i=ωniζi=i=[ωniζiI(|ωniζi|>Wn(p))EωniζiI(|ωniζi|>Wn(p))]+i=[ωniζiI(|ωniζi|Wn(p))EωniζiI(|ωniζi|Wn(p))]:=Tn+Tn

and hence,

n=1nr2P(|k=1nXk|>Wn(p)ε)n=1nr2P(|Tn|>Wn(p)ε/2)+n=1nr2P(|Tn|>Wn(p)ε/2). 2.2

By the Markov inequality, Lemmas 2.1 and 2.3, we have

n=1nr2P(|Tn|>Wn(p)ε/2)n=1nr22pE|Tn|pεpWnp(p)Cn=1nr2i=E|ωniζi|pI(|ωniζi|>Wn(p))Wnp(p)=Cn=1nr2i=E|ωniζi|pI(|ωniζi|>Wn(p),|ζi|>n1/p)Wnp(p)+Cn=1nr2i=E|ωniζi|pI(|ωniζi|>Wn(p),|ζi|n1/p)Wnp(p)Cn=1nr2i=|ωni|pE|ζi|pI(|ζi|>n1/p)Wnp(p)+Cn=1nr2i=E[|ωniζi|pq|ωniζi|qI(|ωniζi|>Wn(p),|ζi|n1/p)]Wnp(p)Cn=1nr2i=|ωni|pE|ζ0|pI(|ζ0|>n1/p)Wnp(p)+Cn=1nr2(Wn(p))pqi=|ωni|qE|ζ0|qI(|ζ0|n1/p)Wnp(p)=Cn=1nr2E|ζ0|pI(|ζ0|>n1/p)+Cn=1nr2(Wn(q)Wn(p))qE|ζ0|qI(|ζ0|n1/p)Cn=1nr2E|ζ0|pI(|ζ0|>n1/p)+Cn=1nr1q/pE|ζ0|qI(|ζ0|n1/p)CE|ζ0|rp<.

Thus the first series on the right-hand side of (2.2) converges.

We next prove that the second series on the right-hand side of (2.2) converges. We have by Lemma 2.2 that for t>2,

n=1nr2P(|Tn|>Wn(p)ε/2)Cn=1nr2i=E|ωniζi|tI(|ωniζi|Wn(p))Wnt(p)+Cn=1nr2exp{ε2Wn2(p)2(t+2)2eti=Var(ωniζiI(|ωniζi|Wn(p)))}. 2.3

Hence it is enough to show that two series on the right-hand side of (2.3) converge.

If we take t>q, then we have by Lemma 2.3 that

n=1nr2i=E|ωniζi|tI(|ωniζi|Wn(p))Wnt(p)=n=1nr2i=E|ωniζi|tI(|ωniζi|Wn(p),|ζi|>n1/p)Wnt(p)+n=1nr2i=E|ωniζi|tI(|ωniζi|Wn(p),|ζi|n1/p)Wnt(p)=n=1nr2i=E[|ωniζi|tp|ωniζi|pI(|ωniζi|Wn(p),|ζi|>n1/p)]Wnt(p)+n=1nr2i=E[|ωniζi|tq|ωniζi|qI(|ωniζi|Wn(p),|ζi|n1/p)]Wnt(p)n=1nr2(Wn(p))tpi=|ωni|pE|ζ0|pI(|ζ0|>n1/p)Wnt(p)+n=1nr2(Wn(p))tqi=|ωni|qE|ζ0|qI(|ζ0|n1/p)Wnt(p)=n=1nr2E|ζ0|pI(|ζ0|>n1/p)+n=1nr2(Wn(q)Wn(p))qE|ζ0|qI(|ζ0|n1/p)n=1nr2E|ζ0|pI(|ζ0|>n1/p)+n=1nr1q/pE|ζ0|qI(|ζ0|n1/p)CE|ζ0|rp<.

Hence the first series on the right-hand side of (2.3) converges.

Finally, we show that the second series on the right-hand side of (2.3) converges. Since p<s2, we have that

i=Var(ωniζiI(|ωniζi|Wn(p)))Wn2(p)i=E|ωniζi|2I(|ωniζi|Wn(p))Wn2(p)=i=E|ωniζi|s+2sI(|ωniζi|Wn(p))Wn2(p)(Wn(p))2si=E|ωniζi|sWn2(p)=i=|ωni|sE|ζ0|sWns(p)=(Wn(s)Wn(p))sE|ζ0|s=o(1/logn),

which implies that

n=1nr2{ε2Wn2(p)2(t+2)2eti=Var(ωniζiI(|ωniζi|Wn(p)))}Cn=1nr2{ε2logn2(t+2)2eto(1)}<.

 □

The next theorem treats the case r=1.

Theorem 2.2

Let 1p<2. Let {ai,iZ} be a sequence of real numbers with

i=|ai|θ<for some 0<θ<p.

Suppose that {Xn,n1} is the linear process of a sequence {ζi,iZ} of i.i.d. random variables with mean zero and E|ζ0|p<. Furthermore, assume that

Wn(θ)/Wn(p)=O(n1/θ1/p)

and

Wn(q)/Wn(p)=O(n1/q1/p)for some q(p,2).

Then

n=1n1P(|k=1nXk|>Wn(p)ε)<for all ε>0.

Proof

The proof is similar to that of Theorem 2.1(1). We proceed with two cases 1θ<p and 0<θ<1.

For the case 1θ<p, we have by Lemmas 2.1 and 2.3 that

n=1n1P(|Sn|>Wn(p)ε/2)n=1n12θE|Sn|θεθWnθ(p)Cn=1n1i=|ωni|θE|ζ0|θI(|ζ0|>n1/p)Wnθ(p)=Cn=1n1(Wn(θ)Wn(p))θE|ζ0|pI(|ζ0|>n1/p)Cn=1n1n(1/θ1/p)θE|ζ0|pI(|ζ0|>n1/p)CE|ζ0|p<.

As in the proof of Theorem 2.1(1), we have that

n=1n1P(|Sn|>Wn(p)ε/2)CE|ζ0|p<.

For the case 0<θ<1, we rewrite k=1nXk as

k=1nXk=i=ωniζiI(|ζi|>n1/p)+i=ωni[ζiI(|ζi|n1/p)EζiI(|ζi|n1/p)]i=ωniEζiI(|ζi|>n1/p):=Sn+SnSn.

If 0<θ<1, then n=1|an|(n=1|an|θ)1/θ<. It follows by Lemma 2.4 that

Wn1(p)|Sn|Wn1(p)i=|ωni|E|ζ0|I(|ζ0|>n1/p)Cn11/pE|ζ0|I(|ζ0|>n1/p)CE|ζ0|pI(|ζ0|>n1/p)0

as n. Hence

n=1n1P(|k=1nXk|>Wn(p)ε)Cn=1n1P(|Sn|>Wn(p)ε/3)+Cn=1n1P(|Sn|>Wn(p)ε/3).

The rest of the proof is the same as that of the previous case and is omitted. □

The following corollary extends Theorem 1.1 to the short-range dependent linear processes.

Corollary 2.1

Let r1, 1p<2, and rp>1. Let {ai,iZ} be an absolutely summable sequence of real numbers. Suppose that {Xn,n1} is the linear process of a sequence {ζi,iZ} of i.i.d. random variables with mean zero and E|ζ0|rp<. Then

n=1nr2P(|k=1nXk|>n1/pε)<for all ε>0.

Proof

We first note that

i=|ai|p(i=|ai|)p<.

If 1<p<2, then we take θ such that 1θ<p. Then

i=|ai|θ(i=|ai|)θ<.

By Lemma 2.4, for any t>0, there exist positive constants C1 and C2 independent of n such that

C1n1/tWn(t)C2n1/tfor all n1.

Then all conditions on Wn() in Theorems 2.1 and 2.2 are easily satisfied. Hence the proof follows from Theorems 2.1 and 2.2. □

Remark 2.1

In Corollary 2.1, the case rp=1 (i.e., r=1 and p=1) is not considered. In fact, Corollary 2.1 does not hold for this case (see Sung [18]).

An estimation of Wn(t) for the long-range dependent case

As we have seen in Sections 1 and 2, it is easy to estimate Wn(t) for the short-range dependent case. In this section, we propose a method to estimate Wn(t) for the long-range dependent case. It is not easy to estimate Wn(t) when the sequence {ai,iZ} is not absolutely summable. For simplicity, we will consider non-increasing sequences of positive numbers. For the finiteness of Wn(t), without loss of generality, it is necessary to assume that ai=0 if i0 and i=1ait<.

Lemma 3.1

Let t>0. Let {ai,iZ} be a non-increasing sequence of positive real numbers satisfying ai=0 if i0 and i=1ait<. Then

n2(a1++a[n/2])t+nti=naitWnt(t)2n(a1++an)t+nti=nait.

Proof

Since ai=0 if i0 and 0<ai, we get that

Wnt(t)=i=1n(j=1iaj)t+i=1n(j=1nai+j)t+i=n+1(j=1nai+j)t2n(a1++an)t+nti=n+1ai+1t2n(a1++an)t+nti=nait.

Similarly,

Wnt(t)=i=1n1(j=1iaj)t+i=1(j=0n1ai+j)ti=[n/2]n1(j=1iaj)t+nti=naitn2(a1++a[n/2])t+nti=nait.

Thus the proof is completed. □

The following lemma can be found in Martikainen [19].

Lemma 3.2

Martikainen [19]

Let {bn,n1} be a non-decreasing sequence of positive real numbers. Then

i=n1ibi=O(bn1)lim infnbrnbn>1for some integer r2.

Similarly, we can obtain a counterpart of Lemma 3.2.

Lemma 3.3

Let {bn,n1} be a non-decreasing sequence of positive real numbers. Then

i=1nbii=O(bn)lim infnbrnbn>1for some integer r2.

Proof

The proof is similar to that of Lemma 3.2 and is omitted. □

Using Lemmas 3.2 and 3.3, we have the following lemma.

Lemma 3.4

Let t>1 and let {an,n1} be a sequence of positive real numbers satisfying nan, nant, and

1r<lim infnarnanlim supnarnan<(1r)1/tfor some integer r2.

Then the following statements hold:

  • (i)

    i=nait=O(nant).

  • (ii)

    i=1nai=O(nan).

Proof

The proof of (i) follows from Lemma 3.2. The proof of (ii) follows from Lemma 3.3. □

Now we present a method to estimate Wn(t) for the long-range dependent case.

Theorem 3.1

Let t>1, and let {an,n1} be a sequence of positive real numbers satisfying the same conditions as in Lemma  3.4. Then there exist positive constants C1 and C2 independent of n such that

C1n1+tantWnt(t)C2n1+tantfor all n1,

where ai=0 if i0.

Proof

By the condition nant, we have (an+1/an)tn/(n+1), which implies 0<an. The upper bound of Wnt(t) follows by Lemmas 3.1 and 3.4. For the lower bound, we have by lim infnarn/an>1/r that

arn/an1/rfor all large n.

It follows that for all large n

nti=naitnti=nrnait(r1)n1+tarnt(r1)rtn1+tant.

Since 0<an,

n(a1++a[n/2])tn[n/2]ta[n/2]tn[n/2]tant.

Hence the lower bound follows from Lemma 3.1. □

Finally, we give two long-range dependent linear processes.

Example 3.1

Let ai=1/i if i1 and ai=0 if i0. Then the series i=ai diverges, but i=ait converges if t>1. Observe that

ln(n+1)i=1nai1+lnn.

If t>1, then

1t1nt+1i=naitnt+1t1nt+1.

By Lemma 3.1, for any t>1, there exist positive constants C1 and C2 independent of n such that

C1n(lnn)tWnt(t)C2n(lnn)tfor all n2.

Let Xn=i=ai+nζi be the long-range dependent linear process of a sequence {ζi} of i.i.d. random variables with mean zero and E|ζ0|rp<, where r>1 and 1<p<2. Then all conditions of Theorem 2.1 are easily satisfied. By Theorem 2.1,

n=1nr2P(|k=1nXk|>n1/plnnε)<for all ε>0.

Example 3.2

Let 1<p<2. Let ai=1/id if i1 and ai=0 if i0, where 1/p<d<1. Then the series i=ai diverges, but i=ait converges if t>1/d. Since a2n/an=2d, we have by Theorem 3.1 that

C1n1+tdtWnt(t)C2n1+tdtfor all n1.

Let Xn=i=ai+nζi be the long-range dependent linear process of a sequence {ζi} of i.i.d. random variables with mean zero and E|ζ0|p<. Take θ such that 1/d<θ<p. Then all conditions of Theorem 2.2 are easily satisfied. By Theorem 2.2,

n=1n1P(|k=1nXk|>n1/p+1dε)<for all ε>0.

Acknowledgements

The research of Pingyan Chen is supported by the National Natural Science Foundation of China (No. 11271161). The research of Soo Hak Sung is supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (2017R1D1A1B03029898).

Authors’ contributions

All authors read and approved the manuscript.

Competing interests

The authors declare that they have no competing interests.

Footnotes

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

References

  • 1.Baum LE, Katz M. Convergence rates in the law of large numbers. Trans. Am. Math. Soc. 1965;120:108–123. doi: 10.1090/S0002-9947-1965-0198524-1. [DOI] [Google Scholar]
  • 2.Alf C. Rates of convergence for the laws of large numbers for independent Banach-valued random variables. J. Multivar. Anal. 1975;5:322–329. doi: 10.1016/0047-259X(75)90051-2. [DOI] [Google Scholar]
  • 3.Alsmeyer G. Convergence rates in the law of large numbers for martingales. Stoch. Process. Appl. 1990;36:181–194. doi: 10.1016/0304-4149(90)90090-F. [DOI] [Google Scholar]
  • 4.Heyde CC, Rohatgi VK. A pair of complementary theorems on convergence rates in the law of large numbers. Proc. Camb. Philol. Soc. 1967;63:73–82. doi: 10.1017/S0305004100040901. [DOI] [Google Scholar]
  • 5.Hu T-C, Weber NC. On the rate of convergence in the strong law of large numbers for arrays. Bull. Aust. Math. Soc. 1992;45:479–482. doi: 10.1017/S0004972700030379. [DOI] [Google Scholar]
  • 6.Rohatgi VK. Convergence rates in the law of large numbers II. Proc. Camb. Philol. Soc. 1968;64:485–488. doi: 10.1017/S0305004100043103. [DOI] [Google Scholar]
  • 7.Hsu PL, Robbins H. Complete convergence and the law of large numbers. Proc. Natl. Acad. Sci. USA. 1947;33:25–31. doi: 10.1073/pnas.33.2.25. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 8.Katz M. The probability in the tail of a distribution. Ann. Math. Stat. 1963;34:312–318. doi: 10.1214/aoms/1177704268. [DOI] [Google Scholar]
  • 9.Giraitis L, Koul HL, Surgailis D. Large Sample Inference for Long Memory Processes. London: Imperial College Press; 2012. [Google Scholar]
  • 10.Koopmans LH. An exponential bound on the strong law of large numbers for linear stochastic processes with absolutely convergent coefficients. Ann. Math. Stat. 1961;32:583–586. doi: 10.1214/aoms/1177705063. [DOI] [Google Scholar]
  • 11.Hanson DL, Koopmans LH. On the convergence rate of the law of large numbers for linear combinations of independent random variables. Ann. Math. Stat. 1965;36:559–564. doi: 10.1214/aoms/1177700167. [DOI] [Google Scholar]
  • 12.Li D, Rao MB, Wang X. Complete convergence of moving average processes. Stat. Probab. Lett. 1992;14:111–114. doi: 10.1016/0167-7152(92)90073-E. [DOI] [Google Scholar]
  • 13.Zhang L. Complete convergence of moving average processes under dependence assumptions. Stat. Probab. Lett. 1996;30:165–170. doi: 10.1016/0167-7152(95)00215-4. [DOI] [Google Scholar]
  • 14.Characiejus V, Račkauskas A. Weak law of large numbers for linear processes. Acta Math. Hung. 2016;149:215–232. doi: 10.1007/s10474-016-0603-4. [DOI] [Google Scholar]
  • 15.Burton RM, Dehling H. Large deviations for some weakly dependent random processes. Stat. Probab. Lett. 1990;9:397–401. doi: 10.1016/0167-7152(90)90031-2. [DOI] [Google Scholar]
  • 16.von Bahr B, Esseen CG. Inequalities for the rth absolute moment of a sum of random variables, 1r2. Ann. Math. Stat. 1965;36:299–303. doi: 10.1214/aoms/1177700291. [DOI] [Google Scholar]
  • 17.Nagaev SV. Large deviations of sums of independent random variables. Ann. Probab. 1979;7:745–789. doi: 10.1214/aop/1176994938. [DOI] [Google Scholar]
  • 18.Sung SH. A note on the complete convergence of moving average processes. Stat. Probab. Lett. 2009;79:1387–1390. doi: 10.1016/j.spl.2009.03.001. [DOI] [Google Scholar]
  • 19.Martikainen AI. Criteria for strong convergence of normalized sums of independent random variables and their applications. Theory Probab. Appl. 1985;29:519–533. doi: 10.1137/1129065. [DOI] [Google Scholar]

Articles from Journal of Inequalities and Applications are provided here courtesy of Springer

RESOURCES