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

Yong Zou, Reik V Donner, Marco Thiel, Jurgen Kurths

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

In recent years, complex network theory has provided many conceptual insights based on recurrence characteristics of time series from various fields, which is referred to as recurrence network analysis. While recent applications of this novel concept have been restricted almost exclusively to dissipative dynamics (i.e., the quantitative characterization of attractors), we demonstrate in this work that some of the characteristic features of recurrence networks are useful for disentangling the complex
dynamics of low-dimensional conservative systems as well. In the standard map, a typical chaotic orbit can be temporarily trapped in the vicinity of the regular domains in phase space, resulting in a possibly rather long time necessary to homogeneously fill the chaotic domain—a phenomenon known as stickiness. The presence of sticky orbits (i.e., intermittent laminar phases of chaotic trajectories) presents an ongoing challenge to
numerically characterizing the associated phase portraits.
In this work, we demonstrate that in the standard map, the geometric organization of regular orbits as well as sticky versus filling parts of chaotic orbits in phase space can be successfully discriminated based on relatively short time series by using several recurrence network measures, including network transitivity, global clustering coefficient, and average path length. This result provides the first documented finding pointing to
the relevance of recurrence network analysis for studying conservative dynamical systems.
Original languageEnglish
Article number023120
Number of pages13
JournalChaos
Volume26
Issue number2
Early online date29 Feb 2016
DOIs
Publication statusPublished - Feb 2016

Fingerprint

network analysis
Standard Map
Chaotic Motion
Complex Analysis
Complex networks
Network Analysis
Electric network analysis
Complex Networks
Recurrence
Phase Space
Orbits
orbits
Orbit
Time series
Circuit theory
Conservative System
Clustering Coefficient
dynamical systems
Phase Portrait
Transitivity

Cite this

Disentangling regular and chaotic motion in the standard map using complex network analysis of recurrences in phase space. / Zou, Yong; Donner, Reik V; Thiel, Marco; Kurths, Jurgen.

In: Chaos, Vol. 26, No. 2, 023120 , 02.2016.

Research output: Contribution to journalArticle

@article{69ed32fcc46b42f78a56e2dbaeda6bf1,
title = "Disentangling regular and chaotic motion in the standard map using complex network analysis of recurrences in phase space",
abstract = "In recent years, complex network theory has provided many conceptual insights based on recurrence characteristics of time series from various fields, which is referred to as recurrence network analysis. While recent applications of this novel concept have been restricted almost exclusively to dissipative dynamics (i.e., the quantitative characterization of attractors), we demonstrate in this work that some of the characteristic features of recurrence networks are useful for disentangling the complexdynamics of low-dimensional conservative systems as well. In the standard map, a typical chaotic orbit can be temporarily trapped in the vicinity of the regular domains in phase space, resulting in a possibly rather long time necessary to homogeneously fill the chaotic domain—a phenomenon known as stickiness. The presence of sticky orbits (i.e., intermittent laminar phases of chaotic trajectories) presents an ongoing challenge tonumerically characterizing the associated phase portraits.In this work, we demonstrate that in the standard map, the geometric organization of regular orbits as well as sticky versus filling parts of chaotic orbits in phase space can be successfully discriminated based on relatively short time series by using several recurrence network measures, including network transitivity, global clustering coefficient, and average path length. This result provides the first documented finding pointing tothe relevance of recurrence network analysis for studying conservative dynamical systems.",
author = "Yong Zou and Donner, {Reik V} and Marco Thiel and Jurgen Kurths",
note = "Acknowledgements Y.Z. acknowledges financial support by the National 756 Natural Science Foundation of China (Grant Nos. 11305062, 757 11135001, and 81471651), the Specialized Research Fund 758 (SRF) for the Doctoral Program (No. 20130076120003), and 759 the SRF for ROCS, SEM. R.V.D. has been supported by the 760 Federal Ministry for Education and Research (BMBF) via 761 the young investigators group CoSy-CC 762 2 (Project No. 01LN1306A).",
year = "2016",
month = "2",
doi = "10.1063/1.4942584",
language = "English",
volume = "26",
journal = "Chaos",
issn = "1054-1500",
publisher = "American Institute of Physics",
number = "2",

}

TY - JOUR

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

AU - Zou, Yong

AU - Donner, Reik V

AU - Thiel, Marco

AU - Kurths, Jurgen

N1 - Acknowledgements Y.Z. acknowledges financial support by the National 756 Natural Science Foundation of China (Grant Nos. 11305062, 757 11135001, and 81471651), the Specialized Research Fund 758 (SRF) for the Doctoral Program (No. 20130076120003), and 759 the SRF for ROCS, SEM. R.V.D. has been supported by the 760 Federal Ministry for Education and Research (BMBF) via 761 the young investigators group CoSy-CC 762 2 (Project No. 01LN1306A).

PY - 2016/2

Y1 - 2016/2

N2 - In recent years, complex network theory has provided many conceptual insights based on recurrence characteristics of time series from various fields, which is referred to as recurrence network analysis. While recent applications of this novel concept have been restricted almost exclusively to dissipative dynamics (i.e., the quantitative characterization of attractors), we demonstrate in this work that some of the characteristic features of recurrence networks are useful for disentangling the complexdynamics of low-dimensional conservative systems as well. In the standard map, a typical chaotic orbit can be temporarily trapped in the vicinity of the regular domains in phase space, resulting in a possibly rather long time necessary to homogeneously fill the chaotic domain—a phenomenon known as stickiness. The presence of sticky orbits (i.e., intermittent laminar phases of chaotic trajectories) presents an ongoing challenge tonumerically characterizing the associated phase portraits.In this work, we demonstrate that in the standard map, the geometric organization of regular orbits as well as sticky versus filling parts of chaotic orbits in phase space can be successfully discriminated based on relatively short time series by using several recurrence network measures, including network transitivity, global clustering coefficient, and average path length. This result provides the first documented finding pointing tothe relevance of recurrence network analysis for studying conservative dynamical systems.

AB - In recent years, complex network theory has provided many conceptual insights based on recurrence characteristics of time series from various fields, which is referred to as recurrence network analysis. While recent applications of this novel concept have been restricted almost exclusively to dissipative dynamics (i.e., the quantitative characterization of attractors), we demonstrate in this work that some of the characteristic features of recurrence networks are useful for disentangling the complexdynamics of low-dimensional conservative systems as well. In the standard map, a typical chaotic orbit can be temporarily trapped in the vicinity of the regular domains in phase space, resulting in a possibly rather long time necessary to homogeneously fill the chaotic domain—a phenomenon known as stickiness. The presence of sticky orbits (i.e., intermittent laminar phases of chaotic trajectories) presents an ongoing challenge tonumerically characterizing the associated phase portraits.In this work, we demonstrate that in the standard map, the geometric organization of regular orbits as well as sticky versus filling parts of chaotic orbits in phase space can be successfully discriminated based on relatively short time series by using several recurrence network measures, including network transitivity, global clustering coefficient, and average path length. This result provides the first documented finding pointing tothe relevance of recurrence network analysis for studying conservative dynamical systems.

U2 - 10.1063/1.4942584

DO - 10.1063/1.4942584

M3 - Article

VL - 26

JO - Chaos

JF - Chaos

SN - 1054-1500

IS - 2

M1 - 023120

ER -