# On the complete convergence for pairwise negatively quadrant dependent random variablesAcademic research paper on "Mathematics"

0
0
Share paper
J Inequal Appl
OECD Field of science
Keywords
{""}

## Academic research paper on topic "On the complete convergence for pairwise negatively quadrant dependent random variables"

﻿Zhang et al. Journal of Inequalities and Applications (2015) 2015:213 DOI 10.1186/s13660-015-0734-0

O Journal of Inequalities and Applications

a SpringerOpen Journal

RESEARCH Open Access

^ CrossMark

On the complete convergence for pairwise negatively quadrant dependent random variables

Shui-Li Zhang1*, Cong Qu1 a

"Correspondence: zhangshuilicong@126.com

1College of Mathematics and Information Science, Pingdingshan University, Pingdingshan, Henan 467000, China

Full list of author information is available at the end of the article

nd Yu Miao2

Abstract

In this paper, we establish several generalized complete convergence results for pairwise negatively quadrant dependent random sequences, which include some well-known results.

MSC: 60F15

Keywords: complete convergence; pairwise negatively quadrant dependent sequence; weakly mean dominated

ft Spri

ringer

1 Introduction

1.1 Complete convergence

A sequence of random variables {Un, n > 1} is said to converge completely to a constant C if

£P(|Un - C| > e) < to, for all e > 0. (1.1)

The concept of complete convergence was introduced firstly by Hsu and Robbins [1]. In view of the Borel-Cantelli lemma, complete convergence implies that Un ^ C almost surely. The converse is true if {Un, n > 1} are independent random variables. Hsu and Robbins [1] proved that the sequence of arithmetic means of independent and identically distributed (i.i.d.) random variables converges completely to the expected value if the variance of the summands is finite. Somewhat later, Erdos [2] proved the converse. We summarize their results as follows.

Hsu-Robbins-Erdos strong law Let {X, Xn, n > 1} be a sequence of i.i.d. random variables with mean zero, and set Sn = ^n=i Xi, n > 1, then EX2 < to is equivalent to the condition that

J>(|Snl > en) < to, for all e > 0. (1.2)

The Hsu-Robbins-Erdos strong law can be viewed as a result on the rate of convergence in the law of large numbers. The following theorem is a more general result which bridges

the integrability of summands and the rate of convergence in the Marcinkiewicz-Zygmund strong law of large numbers.

Theorem A Let 0 < r < 2, r < p. Suppose that {X,Xn, n > 1} is a sequence ofi.i.d. random variables with mean zero, and set Sn = ^nt=i Xi, n > 1, then E|X|p < to is equivalent to the condition that

J2 np/r-2P( |Sn | > enllr) < to, for all e >0, (1.3)

and also equivalent to the condition that

J^np/r-2p( max |Sk | > en1/r) < to, for all e >0. (1.4)

z—' \1<k<n '

n=1 --

For r = p = 1, the equivalence between E|X| < to and (1.3) is a famous result due to Spitzer [3]. Forp = 2 and r = 1, the equivalence between EX2 < to and (1.3) is just the Hsu-Robbins-Erdos strong law. For the general p, r satisfying the conditions of Theorem A, Katz [4], and later Baum and Katz [5] proved the equivalence between E|X|p < to and (1.3) and Chow [6] established the equivalence between E|X|p < to and (1.4). Recently, Li etal. [7] established a refined version of the classical Kolmogorov-Marcinkiewicz-Zygmund strong law of large numbers.

For the i.i.d. case, related results are fruitful and detailed. It is natural to extend them to the dependent case, for example, martingale difference, negatively associated sequence, mixing random variables and so on. In the present paper, we are interested in the negatively quadrant dependent random variables.

Two random variables X and Y are said to be negatively quadrant dependent (NQD) if

P(X < x, Y < y) < P(X < x)P(Y < y), for all x and y.

A sequence of random variables {Xn, n > 1} is said to be pairwise NQD if every pair of random variables in the sequence are NQD.

Incidentally, let us mention another popular concept of negatively association which was first introduced by Alam and Saxena [8] and was further studied by Joag-Dev and Proschan [9]. A finite family of random variables {Xk, 1 < k < n} is said to be negatively associated (NA), if, for any disjoint subsets A and B of {1,2,..., n} and any real coordinate-wise nondecreasing functions f on RA and g on RB,

Covf (Xi, i e A),g(Xj, j e B)) < 0,

whenever the covariance exists. An infinite family of random variables is NA if every finite subfamily is NA. It is well known that NA implies pairwise NQD (see [9]).

The notion of NQD was first introduced by Lehmann [10] and was applied widely in mathematics and mechanic models, percolation theory, and reliability theory. In fact, in many practical applications, a pairwise NQD assumption among the random variables

is more reasonable than an independence assumption. One can refer to Matula [11] for Kolmogorov-type strong law of large numbers of the identically distributed pairwise NQD sequences, Chen [12] for Kolmogorov-Chung strong law of large numbers for the non-identically distributed pairwise NQD sequences under very mild conditions, Wu [13] for the three series theorem of pairwise NQD sequences and the Marcinkiewicz strong law of large numbers, Li and Yang [14], Wu and Jiang [15] for strong limit theorems, Shen et al. [16], Wu [17] and Wu [18, 19] for the complete convergence and complete moment convergence for pairwise NQD random variables.

1.3 Some notations and known results

First, let us recall that the random variables {Xn, n > 1} are uniformly dominated by a random variable X if there exists a random variable X, such that

P(|Xn| > x) < P(|X| > x), (.5)

for all x >0 and n > 1. This dominated condition means weakly dominated (WD), where weak refers to the fact that domination is distributional. In [20], Gut introduced a (weakly) mean dominated condition. We say that the random variables {Xn, n > 1} is (weakly) mean dominated (WMD) by the random variable X, where X is possibly defined on a different space if for some C >0,

-J2 p( Ix* | > x < CP( |X | > x, (.6)

for all x > 0, all n > 1. It is clear that if X dominates the sequence {Xn, n > 1} in the WD-sense, then it also dominates the sequence in the WMD-sense. Furthermore, Gut [20] gave an example to show that the condition (1.6) is weaker than the above condition (1.5).

Now let us state some well-known results for the complete convergence of pairwise NQD random variables.

Theorem B (Gan and Chen [21]) Let 0 <p < 2, ap >1, and {Xn,n > 1} be a sequence of pairwise NQD random variables, which is uniformly dominated by a random variables X, and E|X|p < to. If a < 1, assume EXn = 0, n > 1. Then

Wp-2P max

^ \1<k<n

> sna < to, Ve >0.

Theorem C (Shen etal. [16]) Let {an, n > 1} be a sequence of positive constants with an/n t. Let {X, Xn, n > 1} be a sequence of pairwise NQD random variables identically distributed. If £toi p(|XI > an) < to, then

£n-1P

Y\Xi -EXiI(|Xi|<an)]

> ane ) < to, Ve >0.

Theorem D (Shen et al. [16]) Let {an, n > 1} be a sequence of positive constants with an/n t to. Let {X, Xn, n > 1} be a sequence of pairwise NQD random variables identically

distributed. If Y^TO=1 p(|xi > an) < to, then

¿n-1P

n P| max

> ans i < to, Ve >0.

Motivated by the above works, the main purposes of the paper are to give several generalized complete convergence results for pairwise NQD random sequences, which include some well-known results. Our main results are stated in Section 2 and all proofs are given in Section 3.

2 Main results

In the section, we state our main results and remarks.

Theorem 2.1 Let {Xn, n > 1} be a sequence of pairwise NQD random variables which is weakly mean dominated by X. Let {an, n > 1} and {bn, n > 1} be sequences of positive constants such that, for some 0 < p < 2,

= O(al 2), J^nbn = O(ak) and nP(|X| >a^ ^ 0. (2.1)

n=k n n=1

If E|X|p < to, then, for any e >0,

J2X - EXkI (|Xk Kan)]

> ane < to.

Remark 2.1 Under the conditions in Theorem 2.1, the condition nP(|X| > an) ^ 0 can be obtained by ap/n t.

Corollary 2.1 Let {Xn, n > 1} be a sequence of pairwise NQD random variables which is weakly mean dominated by X. Let {an, n > 1} and {bn, n > 1} be sequences of positive constants such that, for some p >2,

J2nlT = O«-2), J^nbn = O(4) and nP(|X| > aj ^ 0.

In addition, let the following condition hold: there exist positive constants M1, M2 such that, for all n large enough,

„ , an+1 „ ,

M1 <-< M2.

If E|X|p < to, then, for any e >0,

J2bnp(

J2[Xk - EXkl( iXk Kan)]

> ane < to.

Proof If we note the inequality (3.9) and the condition (2.4), the proof of Corollary 2.1 can be obtained by similar proofs to Theorem 2.1. □

Corollary 2.2 Let {Xn, n > 1} be a sequence ofpairwise NQD random variables which is weakly mean dominated by X. Let {an, n > 1} be a sequence of positive constants such that, for some 0 <p <2,

E~2 = 0(ap2), apk = O(k) and nP(|X| >aj ^ 0.

n=k an

If E|X|k < TO, then, for any e >0,

£n-¥

> ane < to.

J2[Xk - EXkl(|Xk|<a^]

Remark 2.2 In [16] (or see Theorem C), the authors assume the conditions

an/n t and ^ P(|X| > an) < to.

It is easy to see that the condition (2.8) can be guaranteed by E|X| < to. In fact, however, Theorem C dealt with the case E|X| < to. Seen from this angle, Corollary 2.2 is an important supplement to the works in Shen et al. [16].

Corollary 2.3 Let {Xn, n > 1} bea sequence ofpairwise NQD random variables which is weakly mean dominated by X. If for some 0 <p <1, E|X|p < to, then, for any e >0,

J2[Xk - EXkI(|Xk| < (nlogn)1/k)]

> (n log n)1/ke I < to.

Theorem 2.2 Let {Xn, n > 1} be a sequence ofpairwise NQD random variables which is weakly mean dominated by X. Let {an, n > 1} and {bn, n > 1} be sequences of positive constants, such that, for some 0 < p < 2,

= 0(af2), J2nbn = O(ak)

(2.10)

— tTO, forp > 1 and — tTO, for 0 <p <1. nn

(2.11)

If E|X|k < to, then, for any e >0,

EbnP( max |Sk| > ane) < to.

\1<k<n >

Remark 2.3 For 0 < p < 2, a >1, and ap > 1, let bn = nap-2, an = na, then the conditions in (2.10) holds, which can yield Theorem B.

Corollary 2.4 Let {Xn, n > 1} be a sequence ofpairwise NQD random variables which is weakly mean dominated by X. Let {an, n > 1} be a sequence of positive constants, such that, for some 0 <p < 2,

to 1 k ..

= O(aPi2) and y — = O(ap) (2.12)

a2n log n v k ' log n v k' y '

n=k n ° n=1 °

— tTO, forp > 1 and — \ to, for 0 <p <1. (2.13) nn

If E|X|p < to, then, for any s >0,

y^-W max |5k| > a„s) < to.

n log n \1<k<n /

n=1 °

By the same reasons in Corollary 2.1, we have the following result.

Corollary 2.5 Let {Xn, n > 1} be a sequence ofpairwise NQD random variables which is weakly mean dominated by X. Let {an, n > 1} and {bn, n > 1} be sequences of positive constants, such that, for some p >2,

to U k

ynJl = o(af2), ynbn = O(4)

n=k n n=1

— t to, forp > 1 and — t to, for 0 <p <1. (2.14) nn

In addition, let thefollowing condition hold: there exist positive constants M\, M2 such that, for all n large enough,

Mi < — < M2. (2.15)

If E|X|p < to, then, for any s >0,

EbnP( max |5k| > a„s) < to.

3 Proofs of main results

Let C and C1 represent positive constants which may vary in different places.

3.1 Some lemmas

To prove our results, we first give some lemmas as follows.

Lemma 3.1 (Kuzmaszewska [22]) Let {Xn, n > 1} be a sequence of random variables which is weakly mean dominated by a random variable X. If E|X |p < to for some p >0, then, for

any t >0 and n > 1, the following statements hold:

-VE|Xk|p < CE|X|p, nt1

E\Xk|pl(\XkI < t) < C[E|X|p/(|X| < t) + tpp|X| > t)]

(.1) (3.2)

■ ¿E|Xk fl(|Xk| > t) < CE|X|p/(|X| > t).

Lemma 3.2 (Lehmann [10]) LetX and Y be NQD, then we have

(i) E(XY) < E(X)E(Y);

(ii) iff andg are both nondecreasing (or nonincreasing) functions, then f (X) andg(Y) are NQD.

Lemma 3.3 (Patterson and Taylor [23]) Let {Xn, n > 1} be a sequence ofpairwise NQD random variable with mean zero and EX2 < to, then

(n \ 2 n

i=1 / i=1

3.2 Proof of Theorem 2.1

For every n > 1,1 < i < n,let

Yin = -aj(Xi < -an) + Xil(X < a^ + aJ(Xi > an), = Xi - EXil(|Xi|<an)

Z'n = Xil(|Xi| < an) -EXil(X| < an). From the assumption

p |Xk | > e) < Cp |X| > e),

we have

X>k - EXkl (|Xk |<an)]

<12 bnHU {|Xk | > an N + £ bnP

n=1 \k=1 / n=1

<12 bnJ2 p|Xk| > an) + £ bnP

n=1 k=1 n=1 '

an£,f] {|Xi| < an

an£,f]{|Xi| < an)

< C J2 b„«P(\X\ > an) + J2 bnP

YXYkn - EXk/(|Xk\< an)]

= Ii+ h.

Therefore, it is enough to show that I1 < to and I2 < to. By the condition (2.1) and E|X|p < to, we get

Ii <J2 bnnp\X\ > an)

< Cj2nbnj2P(ak < \X\ < ak+i)

n=1 k=n

< CJ2 Pak < \X\<ak+^ nbn

k=1 n=1

< Cj2aPkP(ak < \X\ < ak+i) < CE\X\p < to.

Furthermore, since

(p(Xk > an)-P(Xk < -an))

< J2P(\Xk\ > an) < CnP(\X\ > an) ^ 0,

for all n large enough, we have

J2[Ykn - EXkI(\Xk\< an)]

> a„£t < P

¿[Yfa - EYn]

By Lemma 3.2, we know that {Yin - EYin, 1 < i < n} are pairwise NQD random variables. By Markov's inequality and Lemma 3.3, we have

I2 < C^bnP

J2[Yin - EYin]

n=1 \ i=1

< Cj^bnan2E £\ Yin E Yin \ )

n=1 i=1

< Cj^bnan^y E(Yin - EYin)2

n=1 i=1

< Cj2bnan2j2 EY£

n=1 i=1

= Cj^bna-2j2[EX21(\Xi\ < an) + a\P(\Xi\ > an)]

n=1 i=1

n TO n

= CJ2 bna-2J2 ExfK|Xi I < On) + £ bnJ2 PX I > an

n=l i=1 n=l i=1

= /21+ /22. 0.8)

Similar to the proof of I1 < to, we can get I22 < to. By Lemma 3.1 and the condition (2.1), we have

I21 < £ b

^EXf I( |Xi |<«n)

n=1 1=1

< C^]bna-2(nEX2I(|X|<«^ + n«np|X| > An))

= Cj2nbna-2EX2I(|X|<«n) + £nbnP(|X| > an)

n=1 n=1

< Cj2nbna-2j2 EX2I(ak-1 < |X| < ak) + C1

n=1 k=1

< CJ2 EX2I(ak-1 < |X| < ak) £ nbna~2 + C1

k=1 n=k

< Cj^al^EXfI(ak-1 < |X| < ak) ^nKa'2 + C1

k=1 n=k

< E|X|pI(ak-1 < |X| < ak) + C1

< CE|X|p + C1 < to. (.9) From the above discussions, the desired results in this theorem can be obtained.

3.3 Proof of Theorem 2.2

For any n > 1,1 < i < n,let

Yin = -anI(Xi < -an) + XiI(|X;| < a^ + aJX > an). From Lemma 3.1, we get

£E|YinKJ2E|Xi|I(|Xi| < a^ + anJ2P(|X;|

an + an > p |Xi | > an

i=1 i=1 i=1

CnE|X|I(|X| < an) + CnanP(|X| > an), ifp > 1,

Cna]-pEIXIpI(IXI < an) + CnanP(|X| > an), if 0 <p <1,

(3.10)

which implies by the condition (2.11)

^E| Yn I = o(an). (3.11)

By a similar proof to (3.5), it follows that

to / n \

Y,bn P(U {|Xi | > an}) < to. (3.12)

n=1 \ i=1 !

Hence, combining (3.11) with (3.12), we have

^bnP( max |Sk | > an s)

^ \1<k<n /

n=1 --

to / n \to/ n \

<H bn P(U {|Xi | > a^j + J] bn Pi max |Sk | > an s,Q {|Xi |<an})

>an) I +

n=1 \ i=1 / n=1 i=1

^XiI( ^i Kan

J2bnp .

< C bn P| max

\ 1<k<n

>ans,f| {|Xi | <an

< C + ^ bn Pi ^ Yin | > an s,f) {Xi | < an}

> ans,

n=1 \ i=1 i=1 /

to / n \

< C + £ bn P E | Yin - EYin | > ^Y

n=1 \ i=1 '

< C + E i (Yin -EYin)+ > + p( it (Yin- EYin)" > ^. (3.13)

Since {(Y - EY)+,1 < i < n} and {(Yi - EYi)",1 < i < n} are pairwise NQD random sequences, from a similar proof to Theorem 2.1 (see (3.8) and (3.9)), the desired results in this theorem can be obtained.

Competing interests

The authors declare that they have no competing interests. Authors' contributions

All authors read and approved the final manuscript. Author details

1 College of Mathematics and Information Science, Pingdingshan University, Pingdingshan, Henan 467000, China. 2College of Mathematics and Information Science, Henan Normal University, Xinxiang, Henan 453007, China.

Acknowledgements

The authors are most grateful to the editor and an anonymous referee for careful reading of the manuscript and valuable suggestions, which helped in improving an earlier version of this paper. This work is supported by IRTSTHN (14IRTSTHN023), NSFC (11471104), NCET (NCET-11-0945), and Plan For Scientific Innovation Talent of Henan Province (124100510014).

Received: 10 February 2015 Accepted: 12 June 2015 Published online: 30 June 2015 References

1. Hsu, PL, Robbins, H: Complete convergence and the law of large number. Proc. Natl. Acad. Sci. USA 33, 25-31 (1947)

2. Erdos, P: On a theorem of Hsu and Robbins. Ann. Math. Stat. 20,286-291 (1949)

3. Spitzer, F: A combinatorial lemma and its applications to probability theory. Trans. Am. Math. Soc. 82, 323-339 (1956)

4. Katz, M:The probability in the tail of a distribution. Ann. Math. Stat. 34,312-318(1963)

5. Baum, LE, Katz, M: Convergence rates in the law of large numbers. Trans. Am. Math. Soc. 120,108-123 (1965)

6. Chow, YS: Delayed sums and Borel summability of independent, identically distributed random variables. Bull. Inst. Math. Acad. Sin. 1, 207-220 (1973)

7. Li, D, Qi, Y, Rosalsky, A: A refinement of the Kolmogorov-Marcinkiewicz-Zygmund strong law of large numbers. J. Theor. Probab. 24,1130-1156(2011)

8. Alam, K, Saxena, KML: Positive dependence in multivariate distributions. Commun. Stat., Theory Methods 10(12), 1183-1196(1981)

9. Joag-Dev, K, Proschan, F: Negative association of random variables with application. Ann. Stat. 11, 286-295 (1983)

10. Lehmann, EL: Some concepts of dependence. Ann. Math. Stat. 37,1137-1153 (1966)

11. Matuta, P: A note on the almost sure convergence of sums of negatively dependent random variables. Stat. Probab. Lett. 15, 209-213 (1992)

12. Chen, PY: Strong law of large numbers on pairwise NQD random sequences. Acta Math. Sci. Ser. A Chin. Ed. 25(3), 386-392 (2005)

13. Wu, QY: Convergence properties of pairwise NQD random sequences. Acta Math. Sin. 45(3), 617-624 (2002)

14. Li, R, Yang, WG: Strong convergence of pairwise NQD random sequences. J. Math. Anal. Appl. 344, 741-747 (2008)

15. Wu, QY, Jiang, YY: The strong law of large numbers for pairwise NQD random variables. J. Syst. Sci. Complex. 24, 347-357(2011)

16. Shen, AT, Zhang, Y, Volodin, A: On the strong convergence and complete convergence for pairwise NQD random variables. Abstr. Appl. Anal. 2014, Article ID 949608 (2014)

17. Wu, QY: Sufficient and necessary conditions of complete convergence for weighted sums of PNQD random variables. J. Appl. Math. 2012, Article ID 104390 (2012)

18. Wu, YF: Strong convergence for weighted sums of arrays of rowwise pairwise NQD random variables. Collect. Math. 65, 119-130 (2014)

19. Wu, YF, Shen, GJ: On convergence for sequence of pairwise negatively quadrant dependent random variables. Appl. Math. 59,473-487 (2014)

20. Gut, A: Complete convergence for arrays. Period. Math. Hung. 25, 51-75 (1992)

21. Gan, SX, Chen, PY: Some limit theorems for sequences of pairwise NQD random variables. Acta Math. Sci. 28, 269-281 (2008)

22. Kuzmaszewska, A: On complete convergence in Marcinkiewicz-Zygmund type SLLN for negatively associated random variables. Acta Math. Hung. 128,116-130 (2010)

23. Patterson, RF, Taylor, RL: Strong laws of large numbers for negatively dependent random elements. Nonlinear Anal., Theory Methods Appl. 30(7), 4229-4235 (1997)

Submit your manuscript to a SpringerOpen journal and benefit from:

► Convenient online submission

► Rigorous peer review

► Immediate publication on acceptance

► Open access: articles freely available online

► High visibility within the field