Feigenbaum graphs at the onset of chaos

DOI10.1016/J.PHYSLETA.2012.10.050MaRDI QIDQ2376290zbMATH OpenOpenAlexFDO

Authors Lucas Lacasa, Bartolo Luque, Alberto Robledo

Publication date 21 June 2013

Published in Physics Letters. A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1205.1902, http://oa.upm.es/16711/

zbMATH Keywords

entropyhorizontal visibility algorithminformation created along pathsnetwork degreePesin-like identitiesspectrum of graph-theoretical generalized Lyapunov exponentstrajectoriesunimodal maps

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Nonuniformly hyperbolic systems (Lyapunov exponents, Pesin theory, etc.) (37D25) Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45)

Abstract: We analyze the properties of the self-similar network obtained from the trajectories of unimodal maps at the transition to chaos via the horizontal visibility (HV) algorithm. We first show that this network is uniquely determined by the encoded sequence of positions in the dynamics within the Feigenbaum attractor and it is universal in that it is independent of the shape and nonlinearity of the maps in this class. We then find that the network degrees fluctuate at all scales with an amplitude that increases as the size of the network grows. This suggests the definition of a graph-theoretical Lyapunov exponent that measures the expansion rate of trajectories in network space. On good agreement with the map's counterpart, while at the onset of chaos this exponent vanishes, the subexponential expansion and contraction of network degrees can be fully described via a Tsallis-type scalar deformation of the expansion rate, that yields a discrete spectrum of non-null generalized exponents. We further explore the possibility of defining an entropy growth rate that describes the amount of information created along the trajectories in network space. Making use of the trajectory distributions in the map's accumulation point and the scaling properties of the associated network, we show that such entropic growth rate coincides with the spectrum of graph-theoretical exponents, what appears as a set of Pesin-like identities in the network.

Recommendations

• Analytical properties of horizontal visibility graphs in the Feigenbaum scenario
• Visibility graphs of fractional Wu–Baleanu time series
• On the spectral properties of Feigenbaum graphs
• Visibility graphs and symbolic dynamics
• Horizontal Visibility graphs generated by type-II intermittency

Cites work

• An Introduction to Chaos in Nonequilibrium Statistical Mechanics
• Analytical properties of horizontal visibility graphs in the Feigenbaum scenario
• Introduction to Nonextensive Statistical Mechanics
• Possible generalization of Boltzmann-Gibbs statistics.
• The Structure and Function of Complex Networks
• The universal metric properties of nonlinear transformations

Cited in

(13)

• Quasiperiodic graphs: structural design, scaling and entropic properties
• Chaotic fluctuations in graphs with amplification
• The partial visibility curve of the Feigenbaum cascade to chaos
• Analytical properties of horizontal visibility graphs in the Feigenbaum scenario
• Generalized statistical mechanics at the onset of chaos
• scientific article; zbMATH DE number 5914968 (Why is no real title available?)
• Statistical mechanics for complex systems: on the structure of q-triplets
• Visibility-graphlet approach to the output series of a Hodgkin-Huxley neuron
• Inter-occurrence times and universal laws in finance, earthquakes and genomes
• Visibility graphs of fractional Wu–Baleanu time series
• Chaos as irregular hopping between unstable periodic orbits and its network representation
• On the spectral properties of Feigenbaum graphs
• Visibility graphs and symbolic dynamics

This page was built for publication: Feigenbaum graphs at the onset of chaos

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376290)