Shortest distance between multiple orbits and generalized fractal dimensions

12/13/2019
by   Vanessa Barros, et al.
0

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ényi entropy. Applications to Markov chains, Gibbs states and the stochastic scrabble are given.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/08/2022

Open dynamical systems as coalgebras for polynomial functors, with application to predictive processing

We present categories of open dynamical systems with general time evolut...
research
03/11/2020

Rényi entropy and pattern matching for run-length encoded sequences

In this note, we studied the asymptotic behaviour of the length of the l...
research
06/30/2022

Minimization of Dynamical Systems over Monoids

Quantitative notions of bisimulation are well-known tools for the minimi...
research
11/28/2018

On the relation between topological entropy and restoration entropy

In the context of state estimation under communication constraints, seve...
research
07/11/2012

Dynamical Systems Trees

We propose dynamical systems trees (DSTs) as a flexible class of models ...
research
09/11/2023

Generalized Graphon Process: Convergence of Graph Frequencies in Stretched Cut Distance

Graphons have traditionally served as limit objects for dense graph sequ...

Please sign up or login with your details

Forgot password? Click here to reset