Statistical Mechanics and Information-Theoretic Perspectives on Complexity in the Earth System

Peer reviewedPublisher PD

Feigenbaum graphs: a complex network perspective of chaos

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.Comment: Published in PLoS ONE (Sep 2011

Symbolic Toolkit for Chaos Explorations

New computational technique based on the symbolic description utilizing kneading invariants is used for explorations of parametric chaos in a two exemplary systems with the Lorenz attractor: a normal model from mathematics, and a laser model from nonlinear optics. The technique allows for uncovering the stunning complexity and universality of the patterns discovered in the bi-parametric scans of the given models and detects their organizing centers -- codimension-two T-points and separating saddles.Comment: International Conference on Theory and Application in Nonlinear Dynamics (ICAND 2012

Algorithmic Verification of Continuous and Hybrid Systems

We provide a tutorial introduction to reachability computation, a class of computational techniques that exports verification technology toward continuous and hybrid systems. For open under-determined systems, this technique can sometimes replace an infinite number of simulations.Comment: In Proceedings INFINITY 2013, arXiv:1402.661