An Almost Sure Functional Limit Theorem for
✍ Scribed by István Fazekas; Alexey Chuprunov
- Publisher
- Springer US
- Year
- 2007
- Tongue
- English
- Weight
- 385 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0894-9840
No coin nor oath required. For personal study only.
📜 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 extend the almost sure max-limit theorem to the case of unbounded functions.
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. ~