Feigenbaum graphs: a complex network perspective of chaos

Abstract

The recently formulated theory of horizontal visibility graphs transforms time series into graphs and allows the possibility of studying dynamical systems through the characterization of their associated networks. This method leads to a natural graph-theoretical description of nonlinear systems with qualities in the spirit of symbolic dynamics. We support our claim via the case study of the period-doubling and band-splitting attractor cascades that characterize unimodal maps. We provide a universal analytical description of this classic scenario in terms of the horizontal visibility graphs associated with the dynamics within the attractors, that we call Feigenbaum graphs, independent of map nonlinearity or other particulars. We derive exact results for their degree distribution and related quantities, recast them in the context of the renormalization group and find that its fixed points coincide with those of network entropy optimization. Furthermore, we show that the network entropy mimics the Lyapunov exponent of the map independently of its sign, hinting at a Pesin-like relation equally valid out of chaos.

Published in PLoS ONE (Sep 2011)

References in corpus (13)

• Statistical mechanics of complex networks
• The structure and function of complex networks
• From time series to complex networks: the visibility graph
• Self-similarity of complex networks
• Renormalization group analysis of the small-world network model
• Recurrence networks - A novel paradigm for nonlinear time series analysis
• Origins of fractality in the growth of complex networks
• Recurrence-based time series analysis by means of complex network methods
• The Visibility Graph: a new method for estimating the Hurst exponent of fractional Brownian motion
• Description of stochastic and chaotic series using visibility graphs
• Phase oscillators with global sinusoidal coupling evolve by Mobius group action
• A characterization of horizontal visibility graphs and combinatorics on words
• Complex networks renormalization: flows and fixed points

Cited by in corpus (29)

• Dynamic Analysis of Digital Chaotic Maps via State-Mapping Networks
• Time series irreversibility: a visibility graph approach
• From the time series to the complex networks: the parametric (dynamical) natural visibility graph
• Distinguishing noise from chaos: objective versus subjective criteria using Horizontal Visibility Graph
• Analytical properties of horizontal visibility graphs in the Feigenbaum scenario
• Time reversibility from visibility graphs of non-stationary processes
• Sequential visibility-graph motifs
• Horizontal Visibility graphs generated by type-I intermittency
• Visibility graphs and symbolic dynamics
• Neural Network for Low-Memory IoT Devices and MNIST Image Recognition Using Kernels Based on Logistic Map
• Quantifying sudden changes in dynamical systems using symbolic networks
• Multiplex visibility graphs to investigate recurrent neural networks dynamics
• Feigenbaum graphs at the onset of chaos
• Approximate entropy of network parameters
• Generalized Statistical Mechanics at the Onset of Chaos
• Horizontal Visibility graphs generated by type-II intermittency
• Networks with time structure from time series
• Network analysis of chaotic dynamics in fixed-precision digital domain
• Quasiperiodic graphs at the onset of chaos
• The partial visibility curve of the Feigenbaum cascade to chaos
• Manifestations of the onset of chaos in condensed matter and complex systems
• Universal visibility patterns of unimodal maps
• Haros graphs: an exotic representation of real numbers
• On the network analysis of the state space of discrete dynamical systems
• On the degree distribution of Haros graphs
• On the ubiquity of the ruler sequence
• Identification of epileptic regions from electroencephalographic data: Feigenbaum graphs
• Characterizing the complexity of time series network graphs: A simplicial approach
• Chaotic renormalization group flow and entropy gradients over Haros graphs