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. ~
An extension of the almost sure max–limit theorem
✍ Scribed by Ingo Fahrner
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 125 KB
- Volume
- 49
- Category
- Article
- ISSN
- 0167-7152
No coin nor oath required. For personal study only.
✦ Synopsis
We extend the almost sure max-limit theorem to the case of unbounded functions.
📜 SIMILAR VOLUMES
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
We show that the accumulated gain Sn and the maximal gain Mn in n St. Petersburg games satisfy almost sure limit theorems with nondegenerate limits, even though ordinary asymptotic distributions do not exist for Sn and Mn with any numerical centering and norming sequences.