1 Introduction

Throughout the paper, let {X, X n ,n1} be a sequence of random variables defined on a fixed probability space (Ω,F,P). C denotes a positive constant not depending on n, which may be different in various places. Let x denote the integer part of x and I(A) be the indicator function of the set A.

Recently, Jajte [1] studied the strong law of large numbers for general weighted sums of independent and identically distributed random variables. The main result of Jajte [1] is as follows.

Theorem 1.1 Let { X n ,n1} be a sequence of independent and identically distributed random variables. Let g() be a positive, increasing function and h() be a positive function such that ϕ(y)g(y)h(y) satisfies the following conditions.

  1. (i)

    For some d0, ϕ() is strictly increasing on [d,) with range [0,).

  2. (ii)

    There exist C and a positive integer k 0 such that ϕ(y+1)/ϕ(y)C for all y k 0 .

  3. (iii)

    There exist constants a and b such that for all s>d,

    ϕ 2 (s) s 1 ϕ 2 ( x ) dxas+b.

Then the following two conditions are equivalent:

  1. (1)

    E[ ϕ 1 (| X 1 |)]<,

  2. (2)

    1 g ( n ) i = 1 n X i m i h ( i ) 0 a.s. as n,

where m i =E X i I(| X i |ϕ(i)) and ϕ 1 is the inverse of a function ϕ.

Inspired by Jajte [1], Jing and Liang [2] extended the result of Jajte [1] for independent and identically distributed random variables to the case of negatively associated random variables with identical distribution. Meng and Lin [3] and Wang [4] extended Theorem 1.1 to the case of ρ ˜ -mixing random variables and non-identically distributed negatively associated random variables, respectively. Sung [5] gave some sufficient conditions to prove the strong law of large numbers for weighted sums of random variables. The main purpose of the paper is to generalize the result of Theorem 1.1 to the case of asymptotically almost negatively associated random variables, which contains independent random variables and negatively associated (NA, in short) random variables as special cases. In addition, we present some sufficient conditions to prove the strong law of large numbers for weighted sums of asymptotically almost negatively associated random variables.

The concept of asymptotically almost negatively associated random variables is as follows.

Definition 1.1 A sequence { X n ,n1} of random variables is called asymptotically almost negatively associated (AANA, in short) if there exists a nonnegative sequence q(n)0 as n such that

Cov ( f ( X n ) , g ( X n + 1 , X n + 2 , , X n + k ) ) q(n) [ Var ( f ( X n ) ) Var ( g ( X n + 1 , X n + 2 , , X n + k ) ) ] 1 / 2

for all n,k1 and for all coordinatewise nondecreasing continuous functions f and g whenever the variances exist.

The family of AANA sequence contains NA (in particular, independent) sequences (with q(n)=0, n1) and some more sequences of random variables which are not much deviated from being negatively associated. For more details about NA random variables, one can refer to Joag-Dev and Proschan [6], and so forth. An example of an AANA sequence which is not NA was constructed by Chandra and Ghosal [7].

Since the concept of AANA sequence was introduced by Chandra and Ghosal [7], many applications have been found. For example, Chandra and Ghosal [7] derived the Kolmogorov type inequality and the strong law of large numbers of Marcinkiewicz-Zygmund; Chandra and Ghosal [8] obtained the almost sure convergence of weighted averages; Wang et al. [9] established the law of the iterated logarithm for product sums; Ko et al. [10] studied the Hájek-Rényi type inequality; Yuan and An [11] established some Rosenthal type inequalities for maximum partial sums of AANA sequence; Yuan and Wu [12] studied the limiting behavior of the maximum of the partial sum for asymptotically negatively associated random variables under residual Cesàro alpha-integrability assumption; Wang et al. [13] obtained some strong growth rate and the integrability of supremum for the partial sums of AANA random variables; Yuan and An [14] established some laws of large numbers for Cesàro alpha-integrable random variables under dependence condition AANA or AQSI; Wang et al. [15] studied the complete convergence for weighted sums of arrays of rowwise AANA random variables; and Yang et al. [16] investigated the complete convergence of moving average process for AANA sequence, and so forth.

The structure of this paper is as follows. Some important lemmas are presented in Section 2. Main results and their proofs are provided in Section 3 and Section 4, respectively.

2 Preliminaries

In this section, we will present some important lemmas which will be used to prove the main results of the paper. The first one is a basic property of AANA random variables, which was given by Yuan and An [11].

Lemma 2.1 (cf. Yuan and An [11])

Let { X n ,n1} be a sequence of AANA random variables with mixing coefficients {q(n),n1}, f 1 , f 2 , … be all nondecreasing (or nonincreasing) continuous functions, then { f n ( X n ),n1} is still a sequence of AANA random variables with mixing coefficients {q(n),n1}.

The next one, the Khintchine-Kolmogorov type convergence theorem for AANA random variables proved by Wang et al. [17], will play an essential role in proving the main results of the paper.

Lemma 2.2 (cf. Wang et al. [17])

Let { X n ,n1} be a sequence of AANA random variables with mixing coefficients {q(n),n1} and n = 1 q 2 (n)<. Assume that n = 1 Var( X n )<, then n = 1 ( X n E X n ) converges a.s.

By Lemma 2.2 and the standard method, we can easily get the following three series theorem for AANA random variables. The proof is easy, so we omit the details.

Lemma 2.3 Let { X n ,n1} be a sequence of AANA random variables with mixing coefficients {q(n),n1} and n = 1 q 2 (n)<. Denote X n ( c ) =cI( X n <c)+ X n I(| X n |c)+cI( X n >c), where c is a positive constant. If the following three conditions are satisfied:

  1. (i)

    n = 1 P(| X n |>c)<;

  2. (ii)

    n = 1 E X n ( c ) converges;

  3. (iii)

    n = 1 Var X n ( c ) <,

then n = 1 X n converges a.s.

The following concept of stochastic domination will be used in this paper.

Definition 2.1 A sequence { X n ,n1} of random variables is said to be stochastically dominated by a random variable X if there exists a positive constant C such that

P ( | X n | > x ) CP ( | X | > x )
(2.1)

for all x0 and n1.

By the definition of stochastic domination and integration by parts, we can get the following basic inequalities. The proof is standard, so we omit it.

Lemma 2.4 Let { X n ,n1} be a sequence of random variables which is stochastically dominated by a random variable X. For any α>0 and b>0, the following two statements hold:

(2.2)
(2.3)

where C 1 and C 2 are positive constants. Consequently, E | X n | α CE | X | α .

3 Main results

Hypothesis A Let f(x) and g(x) be real positive functions defined on the same domain (0,) and φ(x)=f(x)g(x) (φ(0)=0). φ(x) is strictly increasing on [0,), lim x φ(x)=, and its range is [0,).

Hypothesis B There exist constants a,bR such that for every tR,

t 2 φ 1 ( | t | ) 1 φ 2 ( x ) dxa φ 1 ( | t | ) +b.
(3.1)

Throughout the paper, let { X n ,n1} be a sequence of AANA random variables with mixing coefficients {q(n),n1} and n = 1 q 2 (n)<, which is stochastically dominated by a random variable X. Denote m n =E X n I(| X n |φ(n)) for each n1. Based on Hypothesis A and Hypothesis B, we will establish the strong law of large numbers for the weighted sums of AANA random variables. Our main results are as follows.

Theorem 3.1 Let f(x), g(x) and φ(x) be functions satisfying the conditions of Hypothesis A and Hypothesis B. If E[ φ 1 (|X|)]<, then

n = 1 X n m n φ ( n ) converges a.s.
(3.2)

If we further assume that f(x) is increasing on its domain and lim x f(x)=, then 1 f ( n ) i = 1 n X i m i g ( i ) 0 a.s. as n.

Theorem 3.2 Let f(x), g(x) and φ(x) be functions satisfying the conditions of Hypothesis A and Hypothesis B. Assume further that φ(x) satisfies the following conditions:

  1. (i)

    If r 1 φ ( x ) dx is finite, then r 1 φ ( x ) dx C 1 r/φ(r), where r1 and C 1 >0 are constants.

  2. (ii)

    If r 1 φ ( x ) dx does not exist or is infinite, then x/φ(x) is nondecreasing and 1 t 1 φ ( x ) dx C 2 t/φ(t), where r1, t1 and C 2 >0 are constants.

Suppose that E[ φ 1 (|X|)]< and E X i =0 when (ii) holds, then

n = 1 X n φ ( n ) converges a.s.
(3.3)

If we further assume that f(x) is increasing on its domain and lim x f(x)=, then 1 f ( n ) i = 1 n X i g ( i ) 0 a.s. as n.

By Theorem 3.1 and Theorem 3.2, we can get the Marcinkiewicz strong law of large numbers for AANA random variables as follows.

Corollary 3.1 Let { X n ,n1} be a sequence of identically distributed AANA random variables with mixing coefficients {q(n),n1} and n = 1 q 2 (n)<. If E | X 1 | p < for some 0<p<2, then for some finite constant a,

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

If 0<p<1, then a can take an arbitrary real number. If 1p<2, then a=E X 1 .

The next two results are based on different conditions from Hypothesis B. The main idea is inspired by Sung [5]. Here we consider stochastic domination, not identical distribution.

Theorem 3.3 Let f(x), g(x) and φ(x) be functions satisfying the conditions of Hypothesis  A. Assume further that the following conditions hold:

  1. (i)

    n = 1 P(|X|>φ(n))<;

  2. (ii)

    n = 1 1 φ 2 ( n ) E X 2 I(|X|φ(n))<.

Then (3.2) holds true. If we further assume that f(x) is increasing on its domain and lim x f(x)=, then 1 f ( n ) i = 1 n X i m i g ( i ) 0 a.s. as n.

Theorem 3.4 Let f(x), g(x) and φ(x) be functions satisfying the conditions of Hypothesis  A. Assume further that the following conditions hold:

  1. (i)

    n = 1 1 φ ( n ) E|X|I(|X|>φ(n))<;

  2. (ii)

    n = 1 1 φ 2 ( n ) E X 2 I(|X|φ(n))<.

Then

n = 1 X n E X n φ ( n ) converges a.s.
(3.5)

If we further assume that f(x) is increasing on its domain and lim x f(x)=, then 1 f ( n ) i = 1 n X i E X i g ( i ) 0 a.s. as n.

Remark 3.1 The methods used in this paper are the Khintchine-Kolmogorov type convergence theorem and the three series theorem for AANA random variables, which are partially the same as that in Jajte [1] and Jing and Liang [2]. But here we consider some different conditions.

4 Proofs of the main results

Proof of Theorem 3.1 For every n1, denote

Y n =φ(n)I ( X n < φ ( n ) ) + X n I ( | X | n φ ( n ) ) +φ(n)I ( X n > φ ( n ) ) .

It is easily seen that

n = 1 P ( X n Y n ) = n = 1 P ( | X n | > φ ( n ) ) C n = 1 P ( | X | > φ ( n ) ) = C n = 1 P ( φ 1 ( | X | ) > n ) C E [ φ 1 ( | X | ) ] < ,
(4.1)

which together with the Borel-Cantelli lemma yields that

P ( ( X n Y n ) , i.o. ) = P ( X n Y n , i.o. ) = 0 , P ( X n = Y n ,  for  n  large enough ) = 1 .
(4.2)

Now, we consider the series n = 1 E Y n 2 φ 2 ( n ) . By C r ’s inequality, Lemma 2.4 and (4.1), we can get that

n = 1 E Y n 2 φ 2 ( n ) C n = 1 1 φ 2 ( n ) [ E X n 2 I ( | X n | φ ( n ) ) + φ 2 ( n ) P ( | X n | > φ ( n ) ) ] C n = 1 E X 2 I ( | X | φ ( n ) ) φ 2 ( n ) + C n = 1 P ( | X | > φ ( n ) ) C E [ n = 1 X 2 I ( | X | φ ( n ) ) φ 2 ( n ) ] .
(4.3)

Since E[ φ 1 (|X|)]<, it follows that φ 1 (|X|)< a.s. Hence, we have by (3.1) that

n = 1 X 2 I ( | X | φ ( n ) ) φ 2 ( n ) = n = 1 φ 1 ( | X | ) + 1 X 2 I ( | X | φ ( n ) ) φ 2 ( n ) + φ 1 ( | X | ) + 2 X 2 I ( | X | φ ( n ) ) φ 2 ( n ) φ 1 ( | X | ) + 1 + φ 1 ( | X | ) + 2 X 2 φ 2 ( n ) φ 1 ( | X | ) + 1 + X 2 φ 1 ( | X | ) 1 φ 2 ( x ) d x φ 1 ( | X | ) + 1 + a φ 1 ( | X | ) + b = ( 1 + a ) φ 1 ( | X | ) + 1 + b ,

which implies that

E [ n = 1 X 2 I ( | X | φ ( n ) ) φ 2 ( n ) ] (1+a)E [ φ 1 ( | X | ) ] +1+b<.
(4.4)

Combining (4.3) and (4.4), we can see that

n = 1 Var ( Y n ) φ 2 ( n ) n = 1 E Y n 2 φ 2 ( n ) <.
(4.5)

It follows by Lemma 2.1 that { Y n /φ(n),n1} is also a sequence of AANA random variables. Hence, we have by (4.5) and Lemma 2.2 that

n = 1 Y n E Y n φ ( n ) converges a.s.,

which together with (4.2) implies that

n = 1 X n E Y n φ ( n ) converges a.s.

To complete the proof of (3.2), it suffices to show that

But this follows from (4.1) immediately. This completes the proof of (3.2). Finally, 1 f ( n ) i = 1 n X i m i g ( i ) 0 a.s. as n follows from (4.1) and Kronecker’s lemma immediately. The proof is complete. □

Proof of Theorem 3.2 We use the same notations as those in Theorem 3.1. In the proof of Theorem 3.1, we have proved that

n = 1 P ( | X n | > φ ( n ) ) C n = 1 P ( | X | > φ ( n ) ) <

and

n = 1 Var ( Y n ) φ 2 ( n ) <.

Note that { Y n /φ(n),n1} is also a sequence of AANA random variables. By Lemma 2.3, we can see that in order to prove (3.3), we only need to show

n = 1 E Y n φ ( n ) converges.
(4.6)

Suppose that (i) holds, we have by Lemma 2.4 that

n = 1 | E Y n φ ( n ) | n = 1 1 φ ( n ) [ E | X n | I ( | X n | φ ( n ) ) + φ ( n ) P ( | X n | > φ ( n ) ) ] C n = 1 1 φ ( n ) E | X | I ( | X | φ ( n ) ) + C n = 1 P ( | X | > φ ( n ) ) C n = 1 1 φ ( n ) j = 1 n E | X | I ( j 1 < φ 1 ( | X | ) j ) C n = 1 1 φ ( n ) j = 1 n φ ( j ) P ( j 1 < φ 1 ( | X | ) j ) = C j = 1 φ ( j ) P ( j 1 < φ 1 ( | X | ) j ) n = j 1 φ ( n ) C j = 1 φ ( j ) P ( j 1 < φ 1 ( | X | ) j ) [ 1 φ ( j ) + j 1 φ ( x ) d x ] C j = 1 j P ( j 1 < φ 1 ( | X | ) j ) C n = 1 P ( φ 1 ( | X | ) n ) C E [ φ 1 ( | X | ) ] < ,

which implies (4.6).

Suppose that (ii) holds. Note that E X i =0. We have by Lemma 2.4 again that

n = 1 | E Y n φ ( n ) | n = 1 1 φ ( n ) [ | E X n I ( | X n | φ ( n ) ) | + φ ( n ) P ( | X n | > φ ( n ) ) ] n = 1 1 φ ( n ) [ E | X n | I ( | X n | > φ ( n ) ) + φ ( n ) P ( | X n | > φ ( n ) ) ] C n = 1 1 φ ( n ) E | X | I ( | X | > φ ( n ) ) + C n = 1 P ( | X | > φ ( n ) ) C n = 1 1 φ ( n ) j = n E | X | I ( j < φ 1 ( | X | ) j + 1 ) C n = 1 1 φ ( n ) j = n φ ( j + 1 ) P ( j < φ 1 ( | X | ) j + 1 ) = C j = 1 φ ( j + 1 ) P ( j < φ 1 ( | X | ) j + 1 ) n = 1 j 1 φ ( n ) C j = 1 φ ( j + 1 ) P ( j < φ 1 ( | X | ) j + 1 ) [ 1 φ ( 1 ) + 1 j + 1 1 φ ( x ) d x ] C j = 1 ( j + 1 ) P ( j < φ 1 ( | X | ) j + 1 ) = C [ j = 1 j P ( j < φ 1 ( | X | ) j + 1 ) + j = 1 P ( j < φ 1 ( | X | ) j + 1 ) ] C { E [ φ 1 ( | X | ) ] + 1 } < ,

which implies (4.6).

Thus, (4.6) holds both in case (i) and in case (ii). This completes the proof of the theorem. □

Proof of Corollary 3.1 If 0<p<1, then for an arbitrary real number a,

1 n 1 / p i = 1 n a0as n.

Thus, in order to prove (3.4), we only need to show that

1 n 1 / p i = 1 n X i 0a.s. as n.
(4.7)

If 1<p<2, a=E X 1 , without loss of generality, we assume that E X 1 =0. Hence, for 0<p<2 and p1, we only need to show (4.7) holds true.

Taking

in Theorem 3.2, we can get the desired result (3.4) immediately.

For p=1, f(x), g(x) and φ(x) satisfy the conditions of Theorem 3.1, hence,

1 n i = 1 n ( X i m i )0a.s. as n,
(4.8)

where m i =E X i I(| X i |φ(i))=E X 1 I(| X 1 |φ(i)). By the dominated convergence theorem, we can get that m i E X 1 , which implies that

1 n i = 1 n m i E X 1 .
(4.9)

Therefore, the desired result (3.4) follows from (4.8) and (4.9) immediately. This completes the proof of the corollary. □

Proof of Theorem 3.3 We use the same notations as those in Theorem 3.1. By (i), we can see that

n = 1 P ( X n X n I ( | X n | φ ( n ) ) ) = n = 1 P ( | X n | > φ ( n ) ) C n = 1 P ( | X | > φ ( n ) ) < ,

which together with the Borel-Cantelli lemma yields that

P ( X n X n I ( | X n | φ ( n ) ) , i.o. ) =0.
(4.10)

Note that { Y n /φ(n),n1} is still a sequence of AANA random variables, and by (4.3)

n = 1 Var ( Y n ) φ 2 ( n ) n = 1 E Y n 2 φ 2 ( n ) C n = 1 E X 2 I ( | X | φ ( n ) ) φ 2 ( n ) + C n = 1 P ( | X | > φ ( n ) ) < .

We have by Lemma 2.2 that

(4.11)

The fact n = 1 P(| X n |>φ(n))< and the monotone convergence theorem yield that

n = 1 [ I ( | X n | > φ ( n ) ) + P ( | X n | > φ ( n ) ) ] converges a.s.
(4.12)

Combining (4.11) and (4.12), we can get that

n = 1 X n I ( | X n | φ ( n ) ) m n φ ( n ) converges a.s.
(4.13)

The desired result (3.2) follows from (4.10) and (4.13) immediately. This completes the proof of the theorem. □

Proof of Theorem 3.4 By (i), we can easily get

n = 1 P ( | X n | > φ ( n ) ) C n = 1 P ( | X | > φ ( n ) ) C n = 1 1 φ ( n ) E|X|I ( | X | > φ ( n ) ) <.
(4.14)

Applying Theorem 3.3, we can get (3.2) immediately. In order to prove (3.5), it suffices to show that

n = 1 E X n I ( | X n | > φ ( n ) ) φ ( n ) converges.
(4.15)

By (i) again and Lemma 2.4, we have

n = 1 | E X n I ( | X n | > φ ( n ) ) φ ( n ) | n = 1 E | X n | I ( | X n | > φ ( n ) ) φ ( n ) C n = 1 E | X | I ( | X | > φ ( n ) ) φ ( n ) < ,

which implies (4.15). The desired result (3.5) follows from (3.2) and (4.15) immediately. The proof is complete. □