2000 character limit reached
Shortest distance between multiple orbits and generalized fractal dimensions (1912.07516v1)
Published 13 Dec 2019 in math.DS, cs.IT, math.IT, and math.PR
Abstract: We consider rapidly mixing dynamical systems and link the decay of the shortest distance between multiple orbits with the generalized fractal dimension. We apply this result to multidimensional expanding maps and extend it to the realm of random dynamical systems. For random sequences, we obtain a relation between the longest common substring between multiple sequences and the generalized R\'enyi entropy. Applications to Markov chains, Gibbs states and the stochastic scrabble are given.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.