Algorithmic information for interval maps with an indifferent fixed point and infinite invariant measure
From MaRDI portal
Publication:5705436
DOI10.1063/1.1782691zbMath1080.37041arXivmath/0403070WikidataQ51988403 ScholiaQ51988403MaRDI QIDQ5705436
Stefano Galatolo, Claudio Bonanno
Publication date: 8 November 2005
Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0403070
37A05: Dynamical aspects of measure-preserving transformations
11Y16: Number-theoretic algorithms; complexity
37A35: Entropy and other invariants, isomorphism, classification in ergodic theory
37E05: Dynamical systems involving maps of the interval
Related Items
Cites Work
- Transformations on [0,1 with infinite invariant measures]
- Random f-expansions
- Recurrence times and rates of mixing
- Subexponential decay of correlations
- Sharp polynomial estimates for the decay of correlations
- Renewal sequences and intermittency
- Possible rates of entropy convergence
- Combinatorial foundations of information theory and the calculus of probabilities
- Sporadicity: Between periodic and chaotic dynamical behaviors
- A probabilistic approach to intermittency
- Algorithmic complexity of points in dynamical systems
- Complexity, initial condition sensitivity, dimension and weak chaos in dynamical systems
- LOCAL LIMIT THEOREMS FOR PARTIAL SUMS OF STATIONARY SEQUENCES GENERATED BY GIBBS–MARKOV MAPS
- Decay of correlations for piecewise smooth maps with indifferent fixed points
- A limit theorem for sojourns near indifferent fixed points of one-dimensional maps
- STABLE LIMITS FOR PROBABILITY PRESERVING MAPS WITH INDIFFERENT FIXED POINTS
- Recurrence and algorithmic information
- Space–time complexity in Hamiltonian dynamics
- Statistical properties of maps with indifferent periodic points
- Non exponential law of entrance times in asymptotically rare events for intermittent maps with infinite invariant measure
