Sharp error terms for return time statistics under mixing conditions

Abstract

We describe the statistics of repetition times of a string of symbols in a stochastic process. Denote by T(A) the time elapsed until the process spells the finite string A and by S(A) the number of consecutive repetitions of A. We prove that, if the length of the string grows unbondedly, (1) the distribution of T(A), when the process starts with A, is well aproximated by a certain mixture of the point measure at the origin and an exponential law, and (2) S(A) is approximately geometrically distributed. We provide sharp error terms for each of these approximations. The errors we obtain are point-wise and allow to get also approximations for all the moments of T(A) and S(A). To obtain (1) we assume that the process is phi-mixing while to obtain (2) we assume the convergence of certain contidional probabilities.

Cited by in corpus (15)

• Extremal Index, Hitting Time Statistics and periodicity
• Speed of convergence for laws of rare events and escape rates
• Rare Events for the Manneville-Pomeau map
• Discontinuity of Lyapunov Exponents Near Fiber Bunched Cocycles
• Local Escape Rates for $\varphi$-mixing Dynamical Systems
• Estimating entropy rate from censored symbolic time series: a test for time-irreversibility
• Recurrence times, waiting times and universal entropy production estimators
• Poisson approximation for search of rare words in DNA sequences
• Clustering indices and decay of correlations in non-Markovian models
• A note on the limiting entry and return times distributions for induced maps
• Potential well in Poincaré recurrence
• The complete $L^q$-spectrum and large deviations for return times for equilibrium states with summable potentials
• On Large Deviation Property of Recurrence Times
• Entry and Return times distribution
• The distribution of the overlapping function