Visibility graphlet approach to chaotic time series

被引:33
作者
Mutua, Stephen [1 ,2 ]
Gu, Changgui [1 ]
Yang, Huijie [1 ]
机构
[1] Univ Shanghai Sci & Technol, Sch Business, Shanghai 200093, Peoples R China
[2] Masinde Muliro Univ Sci & Technol, Dept Comp Sci, POB 190-50100, Kakamega, Kenya
基金
中国国家自然科学基金;
关键词
COMPLEX NETWORKS; RECURRENCE NETWORKS; DYNAMICAL-SYSTEMS; SIGNALS; MOTIFS; FLOWS;
D O I
10.1063/1.4951681
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Many novel methods have been proposed for mapping time series into complex networks. Although some dynamical behaviors can be effectively captured by existing approaches, the preservation and tracking of the temporal behaviors of a chaotic system remains an open problem. In this work, we extended the visibility graphlet approach to investigate both discrete and continuous chaotic time series. We applied visibility graphlets to capture the reconstructed local states, so that each is treated as a node and tracked downstream to create a temporal chain link. Our empirical findings show that the approach accurately captures the dynamical properties of chaotic systems. Networks constructed from periodic dynamic phases all converge to regular networks and to unique network structures for each model in the chaotic zones. Furthermore, our results show that the characterization of chaotic and non-chaotic zones in the Lorenz system corresponds to the maximal Lyapunov exponent, thus providing a simple and straightforward way to analyze chaotic systems. Published by AIP Publishing.
引用
收藏
页数:10
相关论文
共 53 条
  • [1] Statistical mechanics of complex networks
    Albert, R
    Barabási, AL
    [J]. REVIEWS OF MODERN PHYSICS, 2002, 74 (01) : 47 - 97
  • [2] Emergence of scaling in random networks
    Barabási, AL
    Albert, R
    [J]. SCIENCE, 1999, 286 (5439) : 509 - 512
  • [3] The architecture of complex weighted networks
    Barrat, A
    Barthélemy, M
    Pastor-Satorras, R
    Vespignani, A
    [J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2004, 101 (11) : 3747 - 3752
  • [4] Bechhoefer J., 1996, MATH MAG, V69, P115, DOI DOI 10.1080/0025570X.1996.11996402
  • [5] Practical method for determining the minimum embedding dimension of a scalar time series
    Cao, LY
    [J]. PHYSICA D, 1997, 110 (1-2): : 43 - 50
  • [6] Cheng Z., 2010, MATH MAG, V83, P295, DOI [10.4169/002557010X521859, DOI 10.4169/002557010X521859]
  • [7] RECURRENCE-BASED TIME SERIES ANALYSIS BY MEANS OF COMPLEX NETWORK METHODS
    Donner, Reik V.
    Small, Michael
    Donges, Jonathan F.
    Marwan, Norbert
    Zou, Yong
    Xiang, Ruoxi
    Kurths, Juergen
    [J]. INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS, 2011, 21 (04): : 1019 - 1046
  • [8] Recurrence networks-a novel paradigm for nonlinear time series analysis
    Donner, Reik V.
    Zou, Yong
    Donges, Jonathan F.
    Marwan, Norbert
    Kurths, Juergen
    [J]. NEW JOURNAL OF PHYSICS, 2010, 12
  • [9] Ambiguities in recurrence-based complex network representations of time series
    Donner, Reik V.
    Zou, Yong
    Donges, Jonathan F.
    Marwan, Norbert
    Kurths, Juergen
    [J]. PHYSICAL REVIEW E, 2010, 81 (01):
  • [10] Dormand J., 1980, J. Comput. Appl. Math., V6, P19