Abstract
The Komlós–Révész strong law of large numbers (SLLN) is proved for -mixing sequences without a rate assumption.
MSC:
60F15; 11N05
1. Introduction and Result
Let be a sequence of random variables defined on a probability space and . It was proved by Komlós and Révész in [1] that for centered, independent random variables ,
provided that diverges (see also [2], p. 75 and Ex. 13 on p. 137 in [3]). If then we have strong consistency:
and it was proved that this estimator has minimal variance. Nevertheless, as observed in the preface of [4], “For many phenomena in the real world, the observations are not independent…”, so the question on (1) is intriguing when there is a lack of independence. In [5], the Komlós–Révész theorem is investigated for pairwise independence by the method of subsequences. For martingale difference sequences in , , by the Doob theorem (see Th. 2 on p. 246 in [3]), it is obtained in [6]. In [7], the case and is also discussed for negatively dependent and mixing sequences. In the latter, some rate on mixing is assumed, so this paper aims to remove this restriction.
Let -fields satisfy . Recall the following strong measure of dependence:
It is well known that (see p. 124 in Vol. I, [4])
where denotes –field generated by , and the inner sup is taken over . We say that is -mixing if . It is worth noticing that Kesten and O’Brien and Bradley gave examples of –mixing sequences with an arbitrary rate of mixing (see Ch. 3 and Ch. 26 in [4]).
The following is the main result in this paper.
Theorem 1.
Suppose is ψ–mixing. Let be a sequence satisfying for .
- (i)
- If and converges, then
- (ii)
- If and and diverges, then
- (iii)
- If and and diverges and for , then (3) holds.
Remark 1.
(a) It follows from the proof that in case , ψ–mixing is not required.
(b) In fact, if . The latter is also used in the case of pairwise independent random variables (see Theorem 2 in [5]) and can be omitted if for some .
(c) For , Theorem 1 does not hold. Suppose that is a stochastic sequence constructed in the proof of Theorem 1 in [8]. Thus, if is a non-increasing sequence, , then . Now, let be a sequence of independent random variables with and independent of . Set , so that . Thus, . By Proposition 3.16 on p. 82 in Vol. I, [4] and by Theorem 6.2 on p. 193 in Vol. I, [4] we have that is ψ-mixing (non-stationary) with rate . Let Now, (3) fails by the second Borel–Cantelli lemma (see [9] and p. 210 in [10]) since .
The following variant of the converse statement does not require strong mixing.
Proposition 1.
Let be a sequence of positive reals. Suppose is an arbitrary dependent random sequence such that and . If (3) holds, then diverges.
Set . Theorem 1 applied with and, in case with , yields
Corollary 1.
Suppose is ψ-mixing.
- (i)
- If and converges, then
- (ii)
- If and diverges, then
- (iii)
- If
and diverges, then
We apply our result to the -mixing Cramér model. Namely, we have sequence with which is -mixing. Let . It is easy to see that and . Thus, for in the case , we obtain by (5) that SLLN for Cramér model independence can be replaced by -mixing (see e.g., Lemma A.1 in [11]).
Lemma 1.
The paper is organized as follows. In the next section, there are some auxiliary results. These results are required in the proof of Theorem 1 in the last section.
2. Auxiliary Results
The following result for is in [12] and for see [9] (see also Theorem 2.20 on p. 40 in [13]).
Theorem 2.
Suppose is ψ-mixing and . Let be an increasing to infinity sequence of real numbers such that for some ,
- (i)
- (ii)
- ;
- (iii)
Then, almost surely (a.s.).
The next result improves Lemma 2.1 slightly in [14].
Proposition 2.
Suppose is ψ-mixing and . Let and then a.s.
Proof of Proposition 2.
Set In view of Theorem 2, we can assume .
Further,
So that
Now, apply Theorem 2 to with . □
By Lemma 3.6″ on p. 284 in [15] and Kronecker’s lemma (see e.g., [16], p. 236) we have the following SLLN for arbitrary dependent random variables (see also [17]).
Lemma 2.
Suppose is a sequence of random variables, and . Then, a.s.
3. Proofs
Proof of Theorem 1.
The key role in the proof of Theorem 1 is played by the Dini theorem (see e.g., [18], Theorem 4 on p. 127) and the Abel–Dini theorem (see e.g., [18], Theorem 1 on p. 125) (for a generalization, see Lemma 11 in [7]).
For by the Dini theorem,
since . Thus, (2) holds by Lemma 2.
Now, assume . By the Abel–Dini theorem,
since . Set . Since
holds by Proposition 2.
In the case that , set . By Theorem 2 and the previous point, it is enough to prove that
Let where is fixed. In view of , we have that there exist such that for each n. Therefore,
But so that by the Abel–Dini theorem,
Since Theorem 1 is proved. □
Proof of Proposition 1.
Suppose and (3) holds. Choose such that for . Next, choose such that for . Now, for a fixed , we have
On the other hand, by Fatou’s lemma (cf. Theorem 5.1 on p. 218, [19]),
Thus, . Contradiction. □
Funding
This research received no external funding.
Institutional Review Board Statement
Not applicable.
Data Availability Statement
Data is contained within the article.
Conflicts of Interest
The author declares no conflict of interest.
References
- Komlós, J.; Révész, P. On the weighted averages of independent random variables. Magyar Tud. Akad. Mat. Kutató Int. Közl. 1965, 9, 583–587. [Google Scholar]
- Révész, P. The Laws of Large Numbers; Academic Press: New York, NY, USA, 1968. [Google Scholar]
- Chow, Y.S.; Teicher, H. Probability Theory. Independence, Interchangebility, Martingales, 3rd ed.; Springer Texts in Statistics: New York, NY, USA, 2003. [Google Scholar]
- Bradley, R.C. Introduction to Strong Mixing Conditions; Kendrick Press: Heber City, UT, USA, 2007; Volume I–III. [Google Scholar]
- Rosalsky, A. A strong law for weighted averages of random variables and the Komlós–Révész estimation problem. Calcutta Statist. Assoc. Bull. 1986, 35, 59–66. [Google Scholar] [CrossRef] [Scilit]
- Cohen, G. On the Komlós–Révész estimation problem for random variables without variances. Acta Sci. Math. 2008, 74, 915–925. [Google Scholar]
- Szewczak, Z.S. On the Komlós–Révész SLLN for dependent variables. Acta Math. Hungar. 2018, 156, 47–55. [Google Scholar] [CrossRef] [Scilit]
- Kesten, H.; O’Brien, G.L. Examples of mixing sequences. Duke Math. J. 1976, 43, 405–415. [Google Scholar] [CrossRef] [Scilit]
- Blum, J.R.; Hanson, D.L.; Koopmans, L.H. On the Strong Law of Large Numbers for a Class of Stochastic Processes. Z. Wahr. Verw. Gebiete 1963, 2, 1–11. [Google Scholar] [CrossRef] [Scilit]
- Petrov, V.V. Limit Theorems of Probability Theory. Sequences of Independent Random Variables; Oxford Studies in Probability 4; Clarendon Pr: Oxford, UK, 1995. [Google Scholar]
- Weber, M.J.G. Critical probabilistic characteristics of the Cramér model for primes and arithmetical properties. Indian J. Pure Appl. Math. 2024. [Google Scholar] [CrossRef] [Scilit]
- Szewczak, Z.S. On the Wittmann strong law for mixing sequences. Period. Math. Hungar. 2024, 89, 257–264. [Google Scholar] [CrossRef] [Scilit]
- Hall, P.; Heyde, C.C. Martingale Limit Theory and Its Applications; Academic Press: New York, NY, USA, 1980. [Google Scholar]
- Hu, D.; Chen, P.; Sung, S.H. Strong laws of weighted sums of ψ–mixing random variables and applications in errors-in-variables regression models. TEST 2017, 26, 600–617. [Google Scholar] [CrossRef] [Scilit]
- Loève, M. On almost sure convergence. In Proceedings of the 2nd Berkeley Symposium on Mathematical Statistics and Probability, Berkeley, CA, USA, 31 July–12 August 1950; University of California Press: Berkeley, CA, USA, 1951; pp. 279–303. [Google Scholar]
- Ash, R.B. Probability and Measure Theory; Academic Press: New York, NY, USA, 2000. [Google Scholar]
- Petrov, V.V. On the order of growth and sums of dependent variables. Theory Probab. Appl. 1974, 18, 348–350. [Google Scholar] [CrossRef] [Scilit]
- Knopp, K. Infinite Sequences and Series; Dover Publication Inc.: New York, NY, USA, 1956. [Google Scholar]
- Gut, A. Probability: A Graduate Course, 2nd ed.; Springer: New York, NY, USA, 2013. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).