Almost Sure Central Limit Theorems and the Erdos-Renyi law for Expanding Maps of the Interval
J. -R. Chazottes, P. Collet
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.
Create a lesson
Related papers
Boolean Small-Ball Inequalities for Discrepancy Theory
Emrullah Akbas, Suvrit Sra
Markovian renormalisation for percolation in high-dimension: Semi-decidability of mean field behavior
Arthur Blanc-Renaudie
Point process convergence of large inradii of Poisson-Laguerre tessellations
Matthias Schulte, Martina Švarc Petráková
Interpolation of Gaussian Free Fields via Random Matrices
Gabriel Raposo
Almost-Uniform Bayesian Convergence to the Truth Is Not Characterized by Countable Additivity on Conditional Hitting Times
M. Ali Khan, Arthur Paul Pedersen, Maxwell B. Stinchcombe
The skeleton-blocks decomposition of Bienaymé trees, and applications to their local convergence
Marc Bernard, Robin Stephenson