On the Strong Law of Large Numbers for Sequences of Pairwise Independent Random Variables
Valery Korchevsky

TL;DR
This paper extends the strong law of large numbers to sequences of pairwise independent, non-identically distributed random variables, providing new conditions and generalizations, including results with arbitrary norming sequences.
Contribution
It introduces new sufficient conditions for the SLLN to hold for pairwise independent variables, generalizing previous results and allowing for arbitrary norming sequences.
Findings
Established new SLLN conditions for pairwise independent variables
Generalized Etemadi's extension of Kolmogorov's SLLN
Some results hold with arbitrary norming sequences
Abstract
We establish new sufficient conditions for the applicability of the strong law of large numbers (SLLN) for sequences of pairwise independent non-identically distributed random variables. These results generalize Etemadi's extension of Kolmogorov's SLLN for identically distributed random variables. Some of the obtained results hold with an arbitrary norming sequence in place of the classical normalization.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
On the Strong Law of Large Numbers
for Sequences of Pairwise Independent
Random Variables
Valery Korchevsky Saint-Petersburg State University of Aerospace Instrumentation, Saint-Petersburg. E-mail: [email protected]
Abstract
We establish new sufficient conditions for the applicability of the strong law of large numbers (SLLN) for sequences of pairwise independent non-identically distributed random variables. These results generalize Etemadi’s extension of Kolmogorov’s SLLN for identically distributed random variables. Some of the obtained results hold with an arbitrary norming sequence in place of the classical normalization.
Keywords: strong law of large numbers, pairwise independent random variables.
1. Introduction
Let be a sequence of random variables defined on the same probability space and put .
The classical Kolmogorov’s theorem states that if is a sequence of independent identically distributed random variables and then almost surely. Etemadi [4] generalized the Kolmogorov theorem replacing the mutual independence assumption by the pairwise independence assumption.
Theorem A** ([4]).**
Let be a sequence of pairwise independent identically distributed random variables. If then almost surely.
One can find further extensions of the Kolmogorov theorem to wide classes of dependent random variables in the papers [6] and [7].
In the present work we generalize Theorem A to non-identically distributed random variables. This problem was considered in the several papers. Chandra and Goswami [3] established the following result.
Theorem B** ([3]).**
Let be a sequence of pairwise independent random variables and put for . If
[TABLE]
Then
[TABLE]
for each bounded sequence .
The following result was obtained by Bose and Chandra [1].
Theorem C** ([1]).**
Let be a sequence of pairwise independent random variables. Suppose that
[TABLE]
[TABLE]
Then
[TABLE]
Kruglov [5] proved the next generalization of Theorem A.
Theorem D** ([5]).**
Let be a sequence of pairwise independent random variables. Assume that
[TABLE]
If there exists a random variable such that and
[TABLE]
where is a positive constant, then relation (2) holds.
The aim of present work is to generalize Theorems C and D. We present a generalization of Theorem C using an arbitrary norming sequence in place of the classical normalization. Furthermore we show that condition (3) in Theorems D can be dropped.
In order to prove the theorems in the present work, we use methods developed by Bose and Chandra [1] (see also Chandra [2]).
2. Main results
Theorem 1**.**
Let be a sequence of pairwise independent random variables. Assume that is non-decreasing unbounded sequence of positive numbers. Suppose that
[TABLE]
[TABLE]
Then
[TABLE]
Theorem 1 generalizes Theorem C, which corresponds to the case for all .
Theorem 2**.**
Let be a sequence of pairwise independent random variables. If there exists function such that is non-increasing in the interval ,
[TABLE]
then
[TABLE]
As a consequence of Theorem 2 we immediately obtain the following result.
Corollary 1**.**
Let be a sequence of pairwise independent random variables. If there exists a random variable such that and
[TABLE]
where is a positive constant, then
[TABLE]
Corollary 1 shows that we can omit condition (3) in Theorem D.
3. Proofs
To prove Theorems 1 we need the following proposition that is a consequence of Theorem 1 in [3].
Lemma 1**.**
Let be a sequence of non-negative random variables with finite variances. Assume that is non-decreasing unbounded sequence of positive numbers. Suppose that
[TABLE]
where is a positive constant,
[TABLE]
[TABLE]
Then
[TABLE]
Proof of Theorem 1.
Note that for pairwise independent random variables , the positive parts are pairwise independent. Likewise, the are pairwise independent. Thus it is enough to prove the theorem separately for the positive and negative parts. So we can assume that for all .
Let , for every . To prove the theorem , it is sufficient to show that
[TABLE]
[TABLE]
[TABLE]
Note that for any non-negative random variable and
[TABLE]
and
[TABLE]
Fix an integer . Then, using (4) and (12), for we obtain
[TABLE]
Condition (5) and Kronecker’s lemma (see, for example, [8]) imply that
[TABLE]
Thus for each we have
[TABLE]
so we get assertion (9) by letting .
To establish (10) we shall prove that conditions of Lemma 1 are satisfied for sequence . It follows from pairwise independence of random variables that assertion (7) is satisfied for sequence .
[TABLE]
where is the integer part of . Hence condition (8) is satisfied for sequence .
For each we have
[TABLE]
Thus the sequence of random variables satisfies conditions of Lemma 1, so relation (10) holds.
To complete the proof it remains to verify assertion (11). Using (5), we obtain
[TABLE]
From Borel–Cantelli lemma and relation (10) it follows that
[TABLE]
Thus (11) follows from (10) and (14). ∎
Proof of Theorem 2.
As is non-increasing in the interval , condition implies that . Thus using (6) we have
[TABLE]
Now, taking into account that (6) implies (1), we can conclude that the desired result follows from Theorem C. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Bose A., Chandra T.K. A note on the strong law of large numbers. Calcutta Statistical Association Bulletin 44 , 115–122 (1994)
- 2[2] Chandra T.K. Laws of large numbers. Narosa Publishing House. New Delhi (2012)
- 3[3] Chandra T.K., Goswami A. Cesáro uniform integrability and a strong laws of large numbers. Sankhyā, Ser. A 54 , 215–231 (1992)
- 4[4] Etemadi N. An elementary proof of the strong law of large numbers. Z. Wahrscheinlichkeitstheorie verw. Geb. 55 , 119–122 (1981)
- 5[5] Kruglov V.M. Strong law of large numbers. Stability Problems for Stochastic Models (Zolotarev V.M., Kruglov V.M., Korolev V.Yu., eds.) TVP/VSP. Moscow–Utrecht, 139–150 (1994)
- 6[6] Matula P. A note on the almost sure convergence of sums negatively dependent random variables. Statist. Probab. Lett. 15 , 209–213 (1992)
- 7[7] Matula P. On some families of AQSI random variables and related strong law of large numbers. Appl. Math. E-Notes, 5 , 31–35 (2005)
- 8[8] Petrov V.V. Limit theorems of probability theory. Clarendon Press. Oxford (1995)
