Computing the topological entropy of continuous maps with at most three different kneading sequences with applications to Parrondo's paradox
From MaRDI portal
Publication:509196
DOI10.1016/j.chaos.2015.10.036zbMath1355.37030OpenAlexW2191886115MaRDI QIDQ509196
María Muñoz Guillermo, Jose S. Cánovas
Publication date: 9 February 2017
Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.chaos.2015.10.036
Topological entropy (37B40) Dynamical systems involving maps of the interval (37E05) Numerical problems in dynamical systems (65P99)
Related Items (4)
Periodic sequences of simple maps can support chaos ⋮ Parrondo effect: exploring the nature-inspired framework on periodic functions ⋮ On the complexity of economic dynamics: an approach through topological entropy ⋮ Applying Circulant Matrices Properties to Synchronization Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the topological entropy of multimodal maps via min-max sequences
- Can two chaotic systems give rise to order?
- An improved algorithm for computing topological entropy
- Simple and complex adjustment dynamics in Cournot duopoly models.
- Computing the topological entropy of maps of the interval with three monotone pieces
- Calculating topological entropy
- Computing the topological entropy for piecewise monotonic maps on the interval
- Formulas for the derivative and critical points of topological entropy for Anosov and geodesic flows
- Computing topological entropy for periodic sequences of unimodal maps
- Periodic difference equations, population biology and the Cushing--Henson conjectures
- Dynamic Parrondo's paradox
- Entropy of piecewise monotone mappings
- Topological Entropy
- Computing the Topological Entropy of General One-Dimensional Maps
This page was built for publication: Computing the topological entropy of continuous maps with at most three different kneading sequences with applications to Parrondo's paradox
