The Shortest Possible Return Time of β-Mixing Processes

Miguel Abadi; Sandro Gallo and Erika Alejandra Rada-Mora

We consider a stochastic process and a givenn-string. We study the shortestpossiblereturn time (or shortest return path) of the string over all the realizations of process starting from this string. For aβ-mixing process having complete grammar, and for each sizenof the strings, we approximate the distribution of this short return (properly re-scaled) by a non-degenerated distribution. Under mild conditions on theβcoefficients, we prove the existence of the limit of this distribution to a non-degenerated distribution. We also prove that ergodicity is not enough to guaranty this convergence. Finally, we present a connection between the shortest return and the Shannon entropy, showing that maximum of the re-scaled variables grow as the matching function of Wyner and Ziv.

The whole paper is available here.



The Research, Innovation and Dissemination Center for Neuromathematics is hosted by the University of São Paulo and funded by FAPESP (São Paulo Research Foundation).


User login



1010 Matão Street - Cidade Universitária - São Paulo - SP - Brasil. 05508-090. See map.

55 11 3091-1717

General contact email:

Media inquiries email: