Published May 2016 | Version v1
Journal article

Visibility graphlet approach to chaotic time series

  • 1. Computer Science Department, Masinde Muliro University of Science and Technology, P.O. Box 190-50100, Kakamega (Kenya)
  • 2. Business School, University of Shanghai for Science and Technology, Shanghai 200093 (China)

Description

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.

Additional details

Identifiers

Publishing Information

Journal Title
Chaos (Woodbury, N. Y.)
Journal Volume
26
Journal Issue
5
Journal Page Range
vp.
ISSN
1054-1500
CODEN
CHAOEH

INIS

Country of Publication
United States
Country of Input or Organization
International Atomic Energy Agency (IAEA)
INIS RN
48041316
Subject category
S71: CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; S97: MATHEMATICAL METHODS AND COMPUTING;
Descriptors DEI
CHAOS THEORY; LYAPUNOV METHOD; MAPPING; PERIODICITY
Descriptors DEC
CALCULATION METHODS; MATHEMATICS; VARIATIONS

Optional Information

Notes
(c) 2016 Author(s)