Fiber entropy and algorithmic complexity of random orbits

DOI10.3934/DCDS.2022098MaRDI QIDQ6376309arXivFDO

Authors Elias Zimmermann

Publication date 30 August 2021

Published in arXiv

Full work available at URL https://doi.org/10.3934/DCDS.2022098

Mathematics Subject Classification ID

Measure-preserving transformations (28D05) Entropy and other invariants (28D20) Dynamical aspects of measure-preserving transformations (37A05) Topological entropy (37B40) Random iteration (37H12) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Measures of information, entropy (94A17)

arXiv classification

math.DS

Abstract: Let $Theta$ be a finite alphabet. We consider a bundle of measure preserving transformations $(T_{heta}{)}_{hetainTheta}$ acting on a probability space $(X,mu)$, which are chosen randomly according to an ergodic stochastic process $(Xi,u,sigma)$ with state space $Theta$. This describes a paradigmatic case of a random dynamical system (RDS). Considering a finite partition $mathcalP$ of $X$ we show that the conditional algorithmic complexity of a random orbit $x,T_{alph{a}_0}(x),T_{alph{a}_1}circ{T}_{alph{a}_0}(x),\mathrm{...}$ in $X$ along a sequence $alpha=alph{a}_{0}alph{a}_{1}alph{a}_2\mathrm{...}$ in $Xi$ equals almost surely the fiber entropy of the RDS with respect to $mathcalP$, whenever the latter is ergodic. This extends a classical result of A. A. Brudno connecting algorithmic complexity and entropy in deterministic dynamical systems.

This page was built for publication: Fiber entropy and algorithmic complexity of random orbits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6376309)