Sharp polynomial estimates for the decay of correlations
- 140 Downloads
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 operators, and gives an asymptotic estimate up to any precision of such operators.
KeywordsCentral Limit Theorem Fourier Coefficient Transfer Operator Banach Algebra Spectral Projection
Unable to display preview. Download preview PDF.
- [Hol02]M. Holland,Slowly mixing systems and intermittency maps, Preprint, 2002.Google Scholar
- [Liv96]C. Liverani,Central limit theorems for deterministic systems, inInternational Conference on Dynamical Systems, Montevideo 1995, Pitman Research Notes in Mathematics, Volume 362, Longman Sci. Tech., Harlow, 1996.Google Scholar