Feigenbaum Graphs: A Complex Network Perspective of Chaos
2011
Feigenbaum Graphs: Understanding Chaos through Complex Networks
publication
Evidence: high
Author Information
Author(s): Luque Bartolo, Lacasa Lucas, Ballesteros Fernando J., Robledo Alberto
Primary Institution: Universidad Politécnica de Madrid
Hypothesis
Can the horizontal visibility graph method provide a universal analytical description of nonlinear dynamical systems?
Conclusion
The study demonstrates that Feigenbaum graphs effectively capture the dynamics of unimodal maps and their chaotic behavior.
Supporting Evidence
- The horizontal visibility graph method allows for the analysis of chaotic systems through graph theory.
- Feigenbaum graphs encode the dynamics of stationary trajectories of unimodal maps.
- The study provides a universal analytical description of the period-doubling and band-splitting attractor cascades.
Takeaway
This study shows how we can turn complicated data about chaos into simple graphs, helping us understand how chaotic systems behave.
Methodology
The study uses the horizontal visibility algorithm to transform time series data into graphs and analyzes their properties.
Digital Object Identifier (DOI)
Want to read the original?
Access the complete publication on the publisher's website