pith. sign in

arxiv: math/0210286 · v2 · submitted 2002-10-18 · 🧮 math.PR · math.DS

Almost Sure Central Limit Theorems and the Erdos-Renyi law for Expanding Maps of the Interval

classification 🧮 math.PR math.DS
keywords ascltalmostcentralconvergenceerdos-renyiexpandingintervallimit
0
0 comments X
read the original abstract

For a large class of expanding maps of the interval, we prove that partial sums of Lipschitz observables satisfy an almost sure central limit theorem (ASCLT). In fact, we provide a speed of convergence in the Kantorovich metric. Maxima of partial sums are also shown to obey an ASCLT. The key-tool is an exponential inequality recently obtained. Then we derive almost-sure convergence rates for the supremum of moving averages of Lipschitz observables (Erdos-Renyi type law). We end up with an application to entropy estimation ASCLT's that refi ne Shannon-McMillan-Breiman and Ornstein-Weiss theorems.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.