An elementary proof of the strong law of large numbers

245Citations
Citations of this article
55Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In the following note we present a proof for the strong law of large numbers which is not only elementary, in the sense that it does not use Kolmogorov's inequality, but it is also more applicable because we only require the random variables to be pairwise independent. An extension to separable Banach space-valued r-dimensional arrays of random vectors is also discussed. For the weak law of large numbers concerning pairwise independent random variables, which follows from our result, see Theorem 5.2.2 in Chung [1]. © 1981 Springer-Verlag.

Cite

CITATION STYLE

APA

Etemadi, N. (1981). An elementary proof of the strong law of large numbers. Zeitschrift Für Wahrscheinlichkeitstheorie Und Verwandte Gebiete, 55(1), 119–122. https://doi.org/10.1007/BF01013465

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free