Asymptotic recurrence and waiting times for stationary processes

DOI10.1023/A:1022610816550zbMath0912.60051WikidataQ105584633 ScholiaQ105584633MaRDI QIDQ1266775

Ioannis Kontoyiannis

Publication date: 10 May 1999

Published in: Journal of Theoretical Probability (Search for Journal in Brave)

zbMATH Keywords

waiting time; strong approximation; recurrence time; almost-sure invariance principles

Mathematics Subject Classification ID

60G10: Stationary stochastic processes

60F15: Strong limit theorems

60F17: Functional limit theorems; invariance principles

Related Items

FLUCTUATIONS OF THE METRIC ENTROPY FOR MIXING MEASURES, From the divergence between two measures to the shortest path between two observables, Estimating entropy rate from censored symbolic time series: A test for time-irreversibility, Entry and return times distribution, A Central Limit Theorem for Non-Overlapping Return Times, Convergence of recurrence of blocks for mixing processes, Central limit theorem behavior in the skew tent map, The asymptotics of waiting times between stationary processes, allowing distortion, More on recurrence and waiting times, On the shortest distance between orbits and the longest common substring problem, Stochastic sub-additivity approach to the conditional large deviation principle, The almost sure invariance principle for beta-mixing measures, Decay of correlations for maps with uniformly contracting fibers and logarithm law for singular hyperbolic attractors, Convergence properties of functional estimates for discrete distributions, Return- and hitting-time limits for rare events of null-recurrent Markov maps, Lorenz-like flows: exponential decay of correlations for the Poincaré map, logarithm law, quantitative recurrence, THE CENTRAL LIMIT THEOREM FOR UNIFORMLY STRONG MIXING MEASURES, Relative entropy via non-sequential recursive pair substitution