1 Introduction

Let (Ω, F , P ) be a probability space and { X n ,n1} be a sequence of random variables defined on it.

A finite family of random variables { X i ,1in} is said to be negatively associated (NA) if for every pair of disjoint subsets A,B{1,2,,n} and any real coordinatewise nondecreasing functions f on R A and g on R B

Cov ( f ( X i , i A ) , g ( X j , j B ) ) 0.
(1.1)

An infinite family of random variables is negatively associated if every finite subfamily is negatively associated. This concept was introduced by Joag-Dev and Proschan [1].

A new kind of dependence structure called asymptotically negative association was proposed by Zhang [2, 3] which is a useful weakening of the definition of negative association (see also Yuan and Wu [4]).

Definition (Yuan and Wu [4])

A sequence { X n ,n1} of random variables is said to be asymptotically negatively associated (ANA) if

ρ (r)=sup { ρ ( S , T ) : S , T N , dist ( S , T ) r } 0as r,
(1.2)

where

ρ (S,T)=0 { Cov ( f ( X i , i S ) , g ( X j , j T ) ) ( Var f ( X i , i S ) ) 1 2 ( Var g ( X j , j T ) ) 1 2 , f , g C } ,
(1.3)

and C is the set of nondecreasing functions.

It is obvious that a sequence of asymptotically negatively associated random variables is negatively associated if and only if ρ (1)=0. Compared to negative association, asymptotically negative association defines a strictly larger class of random variables (for detailed examples, see Zhang [2]).

Consequently, the study of the limit theorems for asymptotically negatively associated random variables is of much interest.

For example, Zhang [3] proved the central limit theorem, Wang and Lu [5] obtained some inequalities of the maximum of partial sums and weak convergence, Wang and Zhang [6] established the law of the iterated logarithm, and Yuan and Wu [4] showed the limiting behavior of the maximum of partial sums.

Hájek and Rènyi [7] proved that if { X n ,n1} is a sequence of independent random variables with E X n =0 and E X n 2 <, n1, and { b n ,n1} is a sequence of positive nondecreasing real numbers, then for any ϵ>0 and for any positive integer m<n,

P ( max m j n | i = 1 j X i b j | ϵ ) ϵ 2 ( j = m + 1 n E X j 2 b j 2 + j = 1 m E X j 2 b m 2 ) .
(1.4)

Since then, this inequality has been of concern for more and more authors (e.g., Chow [8] and Gan [9] for martingales, Liu et al. [10] for negatively associated random variables and Kim et al. [11] for asymptotically almost negatively associated random variables).

Inspired by Kim et al. [11], we will obtain the Hájek-Rènyi inequality type for asymptotically negatively associated random variables and prove the strong law of large numbers by using this inequality.

2 Hájek-Rènyi inequality for ANA random variables

Lemma 2.1 (Yuan and Wu [4])

Let { X n ,n1} be a sequence of asymptotically negatively associated (ANA) random variables and { a n ,n1} a sequence of positive numbers. Then { a n X n ,n1} is still a sequence of ANA random variables.

From Wang and Lu’s [5] Rosenthal type inequality for asymptotically negatively associated random variables we obtain the following.

Lemma 2.2 Let 0r< 1 12 and N be a positive integer. Let { X n ,n1} be a sequence of asymptotically negatively associated random variables with ρ (N)r, E X n =0, and E X n 2 <. Then, for all n1 there is a positive constant D=D(2,N,r) such that

E max 1 i n | j = 1 i X j | 2 D ( j = 1 n E X j 2 ) .
(2.1)

Theorem 2.3 Let { b n ,n1} be a sequence of positive nondecreasing real numbers and { X 1 ,, X n } a sequence of mean zero, square integrable ANA random variables. Let σ k 2 =E X k 2 . Then, for ϵ>0

P { max 1 k n ( i = 1 k X i b k ) > ϵ } 4D ϵ 2 k = 1 n σ k 2 b k 2 ,
(2.2)

where D is a positive constant defined in Lemma  2.2.

Proof First note that { X 1 b 1 ,, X n b n } is a sequence of mean zero, square integrable ANA random variables by Lemma 2.1. Thus { X 1 b 1 ,, X n b n } satisfies (1.2) for all coordinatewise increasing continuous functions f and g. Without loss of generality, set b 0 =0. Since

b k 1 j = 1 k ( b j b j 1 )=1,

we get

j = 1 k X j = j = 1 k ( X j b j i = 1 j ( b i b i 1 ) ) = i = 1 k ( b i b i 1 ) i j k X j b j

and

{ | j = 1 k X j b k | ϵ } { max 1 i k | i j k X j b j | ϵ } .
(2.3)

From (2.3) we have

{ max 1 k n | j = 1 k X j b k | ϵ } { max 1 k n max 1 i k | i j k X j b j | ϵ } = { max 1 i k n | j k X j b j j < i X j b j | ϵ } { max 1 k n | 1 j k X j b j | ϵ 2 } .

Hence by Lemma 2.2 the desired result (2.2) follows. □

From Theorem 2.3, we can get the following more generalized Hájek-Rènyi type inequality.

Theorem 2.4 Let { b n ,n1} be a sequence of positive nondecreasing real numbers. Let 0r< 1 12 and N be a positive integer. Let { X n ,n1} be a sequence of mean zero and square integrable ANA random variables with ρ (N)r and E X n 2 <. Let σ k 2 =E X k 2 , k1. Then, for ϵ>0 and for any positive integer m<n we have

P ( max m k n | j = 1 k X j b k | ϵ ) 16D ϵ 2 ( j = m + 1 n σ j 2 b j 2 + j = 1 m σ j 2 b m 2 ) ,
(2.4)

where D is a positive constant defined in Lemma  2.2.

Proof By Theorem 2.3 we have

P { max m k n | j = 1 k X j b k | ϵ } P { | j = 1 m X j b m | ϵ 2 } + P { max m + 1 k n | j = m + 1 k X j b k | ϵ 2 } P { 1 b m max 1 k m | j = 1 k X j | ϵ 2 } + P { max m + 1 k n | j = m + 1 k X j b k | ϵ 2 } 16 D ϵ 2 ( j = m + 1 n σ j 2 b j 2 + j = 1 m σ j 2 b m 2 ) .

Hence the proof is complete. □

3 Strong law of large numbers for ANA random variables

Using the Hájek-Rènyi inequality for ANA random variables we will prove the strong law of large number for ANA random variables.

Theorem 3.1 Let 0r< 1 12 and N be a positive integer. Let { b n ,n1} be a sequence of positive nondecreasing real numbers and { X n ,n1} a sequence of mean zero, square integrable random variables with ρ (N)r and E X n 2 <. Let σ k 2 =E X k 2 , k1, and S n = i = 1 n X i . Assume

k = 1 σ k 2 b k 2 <.
(3.1)

Then, for any 0<p<2

  1. (A)

    E sup n ( | S n | / b n ) p <,

  2. (B)

    0< b n implies S n / b n 0 a.s. as n.

Proof (A) Note that

E ( sup n | S n | b n ) p < 1 P ( sup n | S n | b n > t 1 p ) dt<.

By Theorem 2.3, it follows from (3.1) that

1 P ( sup n | S n | b n > t 1 p ) d t 4 D lim n 1 t 2 / p d t k = 1 n σ k 2 b k 2 = 4 D lim n k = 1 n σ k 2 b k 2 1 t 2 p d t < ,

where D is a positive constant defined in Lemma 2.2.

Hence the proof of (A) is complete.

(B) By Theorem 2.4 we get

P ( max 1 k n | S k | b k ϵ ) 16D ϵ 2 ( j = m + 1 n σ j 2 b j 2 + j = 1 m σ j 2 b m 2 ) .

But by assumption (3.1) we have

P { sup k m | S k | b k ϵ } = lim n P { max m k n | S k | b k ϵ } 16D ϵ 2 ( j = m + 1 σ j 2 b j 2 + j = 1 m σ j 2 b m 2 ) .
(3.2)

By the Kronecker lemma and (3.1) we get

j = 1 m σ j 2 b m 2 0as m.
(3.3)

Hence, by combining (3.1), (3.2), and (3.3) we have

lim n P { sup k n | S k | b k ϵ } =0,

i.e., S n / b n 0 a.s. as n. □

Corollary 3.2 Let 0r< 1 12 and N be a positive integer. Let { X n ,n1} be a sequence of mean zero, square integrable ANA random variables with ρ (N)r and E X n 2 <. Then, for 0<t<2

P ( sup k m | S k | k 1 / t ϵ ) 4D ϵ 2 2 2 t sup k σ k 2 m ( t 2 ) / t ,

for all ϵ0 and m1, where D is a constant defined in Lemma  2.2,

S n = j = 1 n X j and σ n 2 =E X n 2 ,n1.

Corollary 3.3 Let 0r< 1 12 and N be a positive integer. Let { X n ,n1} be a sequence of mean zero and square integrable ANA random variables with ρ (N)r and E X n 2 <. Assume that

sup n σ n 2 <,

where σ n 2 =E X n 2 , n1. Then, for 0<t<2

  1. (A)

    ( S n / n 1 / t )0 a.s. as n,

  2. (B)

    E sup n ( | S n | / n 1 / t ) p < for any 0<p<2, where S n = j = 1 n X j .

Finally, we consider almost convergence for weighted sums of ANA random variables as applications of Theorem 3.1.

Theorem 3.4 Let 0r< 1 12 and N be a positive integer. Let { a n i ,1in,n1} be an array of real numbers with a n i =0, i>n, sup n 1 i = 1 n | a n i |<, and { b n ,n1} be a sequence of positive nondecreasing real numbers such that 0< b n and let { X n ,n1} be a sequence of mean zero, square integrable ANA random variables satisfying ρ (N)r, E X n 2 <, and (3.1). Then

i = 1 n a n i X i b n 0a.s. as n.
(3.4)

Proof Define

T n = i = 1 n X i b n , c n i = b i b n ( a n i a n i + 1 )for 1in.

Then we obtain

c n n = a n n , T n 0 as  n  by Theorem 3.1(B) ,
(3.5)
i = 1 n a n i X i b n = i = 1 n c n i T i ,
(3.6)
i = 1 n | c n i |2 sup n 1 i = 1 n | a n i |<,
(3.7)

and

lim n | c n i |=0for every fixed i.
(3.8)

Note that if an array of real numbers { c n i ,1in,n1} satisfies i = 1 n | c n i |< and lim n | c n i |=0 for every fixed i then, for every sequence of real numbers d n with d n 0 as n

i = 1 n c n i d i 0as n.
(3.9)

(See Kim et al. [11] for more details.) □

Hence, from the above fact and (3.5)-(3.9), the desired result (3.4) follows.

Theorem 3.5 Let 0r< 1 12 and N be a positive integer. Let { a n i ,1in,n1} be an array of real numbers with a n i =0, i>n, sup n 1 i = 1 n | a n i |<, and { b n ,n1} be a sequence of positive nondecreasing real numbers such that 0< b n and let { X n ,n1} be a sequence of mean zero, square integrable ANA random variables with ρ (N)r and sup n σ n 2 <, where σ n 2 =E X n 2 , n1. Then, for some 0<t<2

i = 1 n a n i X i n 1 / t 0a.s. as n.

Proof By putting b n = n 1 / t from Corollary 3.3 and Theorem 3.4, the result follows and the proof is omitted. □

Now we prove the Marcinkiewicz strong law of large numbers for ANA random variables by using Theorem 3.1. The method of proof is the same as that used in the classical Marcinkiewicz strong law of large numbers for i.i.d. random variables (see Stout [[12], Theorem 3.2.3]).

Theorem 3.6 Let 0r< 1 12 and N be a positive integer. Let { X n ,n1} be a sequence of identically distributed ANA random variables with E X 1 =0, E | X 1 | t < for some 0<t<2 and ρ (N)r. Then

j = 1 n X j n 1 / t 0a.s. as n.
(3.10)

Sketch of proof To prove (3.10) it suffices to show that

j = 1 n X j + n 1 t 0a.s. as n
(3.11)

and

j = 1 n X j n 1 t 0a.s. as n,
(3.12)

where X j + =max( X j ,0) and X j =max( X j ,0).

Note that { X j + ,j1} and { X j ,j1} are sequences of identically distributed ANA random variables. We only show (3.11). Equation (3.12) can be proved similarly.

Set Y j = X j + n 1 t , j=1,2,,n . Then { Y j ,1jn} is a sequence of identically distributed ANA random variables.

Note that E | X 1 | t < n = 1 P(| X 1 |> n 1 t )<.

P ( Y j X j + ) =P ( X 1 + n 1 t X 1 + ) P ( X 1 + > n 1 t ) P ( | X 1 | > n 1 t ) .

So

P ( Y j X j +  i.o. ) =0.
(3.13)

We will prove

n 1 t j = 1 n E Y j 0a.s. as n.
(3.14)

Notice that

n = 1 E Y n n 1 t = n = 1 n 1 t ( E X 1 + I ( X 1 + n 1 t ) + n 1 t P ( X 1 + > n 1 t ) ) = n = 1 n 1 t E X 1 + I ( X 1 + n 1 t ) + n = 1 P ( X 1 + > n 1 t ) n = 1 n 1 t k = 1 n E X 1 + I ( ( k 1 ) 1 t < X 1 + k 1 t ) + n = 1 P ( | X 1 | > n 1 t ) k = 1 E X 1 + I ( ( k 1 ) 1 t < X 1 + k 1 t ) n = k n 1 t + E | X 1 | t C k = 1 k 1 t + 1 E X 1 + I ( ( k 1 ) 1 t < X 1 + k 1 t ) + E | X 1 | t C E | X 1 | t < .
(3.15)

By Kronecker’s lemma and (3.15) we see that (3.14) is true.

We also have

n = 1 n 2 t E ( Y n E Y n ) 2 C n = 1 n 2 t E Y n 2 = C n = 1 n 2 t E ( X 1 + n 1 t ) 2 C n = 1 n 2 t E ( X 1 + ) 2 I ( X 1 + n 1 t ) + n = 1 P ( X 1 + > n 1 t ) C n = 1 n 2 t k = 1 n E ( X 1 + ) 2 I ( ( k 1 ) 1 t < X 1 + k 1 t ) + E | X 1 | t = C k = 1 E ( X 1 + ) 2 I ( ( k 1 ) 1 t < X 1 + k 1 t ) n = k n 2 t + E | X 1 | t C k = 1 k 2 t + 1 E ( X 1 + ) 2 I ( ( k 1 ) 1 t < X 1 + k 1 t ) + E | X 1 | t C k = 1 k 2 t + 1 k 2 t 1 E ( X 1 + ) t I ( ( k 1 ) 1 t < X 1 + k 1 t ) + E | X 1 | t C E | X 1 | t < .
(3.16)

By Theorem 3.1 and (3.13)-(3.16) the proof of (3.11) is complete. □

Theorem 3.7 Let 0r< 1 12 and N be a positive integer. Let { a n i ,1in,n1} be an array of real numbers with sup n 1 i = 1 n | a n i |< and let { X n ,n1} be a sequence of identically distributed ANA random variables with random variables with ρ (N)r, E X 1 =0, and E | X 1 | t < for 0<t<2. Then, for some 0<t<2

i = 1 n a n i X i n 1 / t 0a.s. as n.
(3.17)

Proof Basically, using the ideas in the proof of Theorem 3.4 and Theorem 3.6, we can obtain (3.17) and the proof is omitted. □