2023/06/02 by Zhao, Boyuan · 1 citation
#37B10 (Primary) 60F10 (Secondary) #37B20 #Dynamical Systems (math.DS) #FOS: Mathematics
paper · doi:10.48550/arxiv.2306.01628
The shortest distance between the first n iterates of a typical point can be quantified with a log rule for some dynamical systems admitting Gibbs measures. We show this in two settings. For topologically mixing Markov shifts with at most countably infinite alphabet admitting a Gibbs measure with respect to a locally Hölder potential, we prove the asymptotic length of the longest common substring for a typical point converges and the limit depends on the Rényi entropy. For interval maps with the Gibbs-Markov structure, we prove a similar rule relating the correlation dimension of Gibbs measures with the shortest distance between two iterates in the orbit generated by a typical point.