The geometry of chaotic dynamics — a complex network perspective

  title={The geometry of chaotic dynamics — a complex network perspective},
  author={Reik V. Donner and Jobst Heitzig and Jonathan F. Donges and Yong Zou and Norbert Marwan and J. Kurths},
  journal={The European Physical Journal B},
Abstract Recently, several complex network approaches to time series analysis have been developed and applied to study a wide range of model systems as well as real-world data, e.g., geophysical or financial time series. Among these techniques, recurrence-based concepts and prominently ε-recurrence networks, most faithfully represent the geometrical fine structure of the attractors underlying chaotic (and less interestingly non-chaotic) time series. In this paper we demonstrate that the well… 

Multiscale characterization of recurrence-based phase space networks constructed from time series.

This paper systematically investigates the recurrence-based phase space network of order k that has previously been used to specify different types of dynamics in terms of the motif ranking from a different perspective and finds that the network size scales with different scale exponents and the degree distribution follows a quasi-symmetric bell shape around the value of 2k.

Signatures of chaotic and stochastic dynamics uncovered with ϵ-recurrence networks

Results show that both local and global ϵ-recurrence network measures are sensitive to the presence of unstable periodic orbits and other structural features associated with chaotic dynamics that are otherwise absent in stochastic dynamics, and are still robust at high noise levels and short data lengths.

Analytical framework for recurrence network analysis of time series.

Theoretical framework for a number of archetypical chaotic attractors such as those of the Bernoulli and logistic maps, periodic and two-dimensional quasiperiodic motions, and for hyperballs and hypercubes are illustrated.

Disentangling regular and chaotic motion in the standard map using complex network analysis of recurrences in phase space.

It is shown that the recently developed approach of recurrence network analysis provides potentially useful geometric characteristics distinguishing between regular and chaotic orbits, and it is found that chaotic orbits in an intermittent laminar phase (commonly referred to as sticky orbits) have a distinct geometric structure possibly differing in a subtle way from those of regular orbits.

Uniform framework for the recurrence-network analysis of chaotic time series.

Two practical applications are presented, detection of transition between two dynamical regimes in a time-delayed system and identification of the dimensionality of the underlying system from real-world data with a limited number of points through recurrence network measures.

Can recurrence networks show small-world property?

Complex network approaches to nonlinear time series analysis

Weighted recurrence networks for the analysis of time-series data

This work proposes a method to construct a ‘weighted recurrence network’ from a time series and shows that it can reveal useful information regarding the structure of a chaotic attractor which the usual unweighted RN cannot provide.

Network structure of multivariate time series

A non-parametric method based on the mapping of a multidimensional time series into a multilayer network, which allows to extract information on a high dimensional dynamical system through the analysis of the structure of the associated multiplex network is presented.



Recurrence networks—a novel paradigm for nonlinear time series analysis

It has been demonstrated here that there are fundamental relationships between many topological properties of recurrence networks and different nontrivial statistical properties of the phase space density of the underlying dynamical system.

Complex network from pseudoperiodic time series: topology versus dynamics.

Standard measures of structure in complex networks can be applied to distinguish different dynamic regimes in time series and application to human electrocardiograms shows that such statistical properties are able to differentiate between the sinus rhythm cardiograms of healthy volunteers and those of coronary care patients.

Analysis of Chaotic Dynamics Using Measures of the Complex Network Theory

Deterministic chaos from a new aspect is analyzed, based on the idea that attractors of nonlinear dynamical systems and networks are characterized by a two-dimensional matrix: a recurrence plot and an adjacent matrix, and the networks constructed from the chaotic systems show a small world property.

Complex network from time series based on phase space reconstruction.

A reliable method for constructing complex networks from a time series with each vector point of the reconstructed phase space represented by a single node and edge determined by the phase space distance is proposed.

Identifying complex periodic windows in continuous-time dynamical systems using recurrence-based methods.

It is demonstrated that nonlinear measures based on recurrence plots obtained from such trajectories provide a practicable alternative for numerically detecting shrimps and the average path length and the clustering coefficient of the resulting recurrence networks are particularly powerful discriminatory statistics for the identification of complex periodic windows.

Collective dynamics of ‘small-world’ networks

Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.

On the properties of small-world network models

Abstract:We study the small-world networks recently introduced by Watts and Strogatz [Nature 393, 440 (1998)], using analytical as well as numerical tools. We characterize the geometrical properties

From time series to complex networks: The visibility graph

A simple and fast computational method, the visibility algorithm, that converts a time series into a graph, which inherits several properties of the series in its structure, enhancing the fact that power law degree distributions are related to fractality.