Recurrence and algorithmic information

DOI10.1088/0951-7715/17/3/016MaRDI QIDQ4812579zbMATH OpenOpenAlexFDO

Authors Claudio Bonanno, Stefano Galatolo, S. Isola

Publication date 23 August 2004

Published in Nonlinearity (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0306340

zbMATH Keywords

entropyasymptotic behaviorHausdorff dimensioninvariant measurePoincaré recurrence theoremalgorithmic complexity of orbitsquantitative recurrence indicatorsweakly chaotic dynamical systems

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Entropy and other invariants, isomorphism, classification in ergodic theory (37A35) Notions of recurrence and recurrent behavior in topological dynamical systems (37B20) Dynamical systems involving maps of the interval (37E05)

Abstract: In this paper we initiate a somewhat detailed investigation of the relationships between quantitative recurrence indicators and algorithmic complexity of orbits in weakly chaotic dynamical systems. We mainly focus on examples.

Cited in

(16)

• Long hitting times for expanding systems
• A renormalization approach to irrational rotations
• Diophantine properties of iets and general systems: quantitative proximality and connectivity
• A Survey on the Dimension Theory in Dynamical Diophantine Approximation
• Algorithmic information for interval maps with an indifferent fixed point and infinite invariant measure
• Denoising signals corrupted by chaotic noise
• Quantitative uniform hitting in exponentially mixing systems
• The Rényi entropy function and the large deviation of short return times
• Quantitative recurrence for generic homeomorphisms
• Quantitative mixing results and inner functions
• Recurrence near given sets and the complexity of the Casati-Prosen map
• Hitting time and dimension in axiom A systems, generic interval exchanges and an application to Birkoff sums
• How much information is contained in a recurrence plot?
• The dynamical Borel-Cantelli Lemma and the waiting time problems
• “Metric” complexity for weakly chaotic systems
• ON THE STATISTICAL DISTRIBUTION OF FIRST-RETURN TIMES OF BALLS AND CYLINDERS IN CHAOTIC SYSTEMS

This page was built for publication: Recurrence and algorithmic information

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