A universal result in almost sure central limit theory
The discovery of the almost sure central limit theorem (Brosamler, Math. Proc. Cambridge Philos. Soc. 104 (1988) 561-574; Schatte, Math. Nachr. 137 (1988) 249-256) revealed a new phenomenon in classical central limit theory and has led to an extensive literature in the past decade. In particular, a.s. central limit theorems and various related 'logarithmic' limit theorems have been obtained for several classes of independent and dependent random variables. In this paper we extend this theory and show that not only the central limit theorem, but every weak limit theorem for independent random variables, subject to minor technical conditions, has an analogous almost sure version. For many classical limit theorems this involves logarithmic averaging, as in the case of the CLT, but we need radically different averaging processes for 'more sensitive' limit theorems. Several examples of such a.s. limit theorems are discussed.
Year of publication: |
2001
|
---|---|
Authors: | Berkes, István ; Csáki, Endre |
Published in: |
Stochastic Processes and their Applications. - Elsevier, ISSN 0304-4149. - Vol. 94.2001, 1, p. 105-134
|
Publisher: |
Elsevier |
Keywords: | Almost sure central limit theorem Logarithmic averages Summation methods |
Saved in:
Saved in favorites
Similar items by person
-
Almost sure limit theorems for the St. Petersburg game
Berkes, István, (1999)
-
Almost sure central limit theorems under minimal conditions
Berkes, István, (1998)
-
Empirical distribution function
Csáki, Endre, (1984)
- More ...