Sharp polynomial estimates for the decay of correlations
| dc.creator | Gouezel, Sebastien | |
| dc.date | 2002-02-15 | |
| dc.date.accessioned | 2026-07-07T04:46:28Z | |
| dc.date.available | 2026-07-07T04:46:28Z | |
| dc.description | We generalize a method developed by Sarig to obtain polynomial lower bounds for correlation functions for maps with a countable Markov partition. A consequence is that LS Young's estimates on towers are always optimal. Moreover, we show that, for functions with zero average, the decay rate is better, gaining a factor 1/n. This implies a Central Limit Theorem in contexts where it was not expected, e.g. x+Cx^(1+α) with 1/2 < α< 1. The method is based on a general result on renewal sequences of operator, and gives an asymptotic estimate up to any precision of such operators. | |
| dc.description | 33 pages | |
| dc.identifier | https://arxiv.org/abs/math/0202147 | |
| dc.identifier | http://arxiv.org/abs/math/0202147 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/63347 | |
| dc.subject | Dynamical Systems | |
| dc.subject | 37C30; 37A25 | |
| dc.title | Sharp polynomial estimates for the decay of correlations | |
| dc.type | text |