Entropy-based generating Markov partitions for complex systems
From MaRDI portal
Publication:4565961
DOI10.1063/1.5002097zbMath1390.37020arXiv1711.09072OpenAlexW2768943317WikidataQ52335861 ScholiaQ52335861MaRDI QIDQ4565961
Celso Grebogi, Nicolás Rubido, Murilo S. Baptista
Publication date: 13 June 2018
Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.09072
Cites Work
- Unnamed Item
- A Mathematical Theory of Communication
- Clustering, coding, switching, hierarchical ordering, and control in a network of chaotic elements
- Permutation complexity in dynamical systems. Ordinal patterns, permutation entropy and all that
- Fractal basin boundaries
- Construction of Markov partitions
- Transcripts: An algebraic approach to coupled time series
- Chaos, Strange Attractors, and Fractal Basin Boundaries in Nonlinear Dynamics
- Characterizing strange nonchaotic attractors
- Ergodic theory of chaos and strange attractors
- Introduction to Applied Nonlinear Dynamical Systems and Chaos
- Multistability and the control of complexity
- Crises, sudden changes in chaotic attractors, and transient chaos
- How does a choice of Markov partition affect the resultant symbolic dynamics?
- Successful network inference from time-series data using mutual information rate
