## Abstract A general almost sure limit theorem is presented for random fields. It is applied to obtain almost sure versions of some (functional) central limit theorems. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
Almost sure central limit theorems under minimal conditions
✍ Scribed by István Berkes; Endre Csáki; Lajos Horváth
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 412 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0167-7152
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We prove an almost sure version of a maximum limit theorem using logarithmic means and show that essentially only logarithmic means work as it is the case for almost sure central limit theorems. ~
We prove an almost sure central limit theorem for some multidimensional stochastic algorithms used for the search of zeros of a function and known to satisfy a central limit theorem. The almost sure version of the central limit theorem requires either a logarithmic empirical mean (in the same way as
## Abstract Let __X__, __X__~1~, __X__~2~, … be i.i.d. random variables with nondegenerate common distribution function __F__, satisfying __EX__ = 0, __EX__^2^ = 1. Let __X~i~__ and __M~n~__ = max{__X~i~__, 1 ≤ __i__ ≤ __n__ }. Suppose there exists constants __a~n~__ > 0, __b~n~__ ∈ __R__ and a non