Power-laws in recurrence networks from dynamical systems

Abstract

Recurrence networks are a novel tool of nonlinear time series analysis allowing the characterisation of higher-order geometric properties of complex dynamical systems based on recurrences in phase space, which are a fundamental concept in classical mechanics. In this Letter, we demonstrate that recurrence networks obtained from various deterministic model systems as well as experimental data naturally display power-law degree distributions with scaling exponents $\gamma$ that can be derived exclusively from the systems' invariant densities. For one-dimensional maps, we show analytically that $\gamma$ is not related to the fractal dimension. For continuous systems, we find two distinct types of behaviour: power-laws with an exponent $\gamma$ depending on a suitable notion of local dimension, and such with fixed $\gamma =1$.

6 pages, 7 figures

Cited by in corpus (8)

• Complex network approaches to nonlinear time series analysis
• Time lagged ordinal partition networks for capturing dynamics of continuous dynamical systems
• Unified functional network and nonlinear time series analysis for complex systems science: The pyunicorn package
• Time Series Analysis via Network Science: Concepts and Algorithms
• Uniform framework for the recurrence-network analysis of chaotic time series
• Analyzing long-term correlated stochastic processes by means of recurrence networks: Potentials and pitfalls
• Fluctuation of similarity (FLUS) to detect transitions between distinct dynamical regimes in short time series
• Can recurrence networks show small world property?