This HTML5 document contains 1 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

PrefixNamespace IRI
dctermshttp://purl.org/dc/terms/
n2http://hub.abes.fr/cup/periodical/ets/2005/volume_25/issue_2/101017s0143385704000550AF2E3092AE483366E053120B220AB295/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
xsdhhttp://www.w3.org/2001/XMLSchema#
Subject Item
n2:w
dcterms: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 rate of convergence in the Kantorovich distance. Maxima of partial sums are also shown to obey an ASCLT. The key tool is an exponential inequality recently obtained. Then we establish (optimal) almost-sure convergence rates for the supremum of moving averages of Lipschitz observables (Erdös-Rényi-type law). This is done by refining the usual large-deviations estimates available for expanding maps of the interval. We end up with an application to entropy estimation ASCLTs that refine the Shannon-McMillan-Breiman and Ornstein-Weiss theorems.