Open AccessThe study of network motifs induced from discrete time series
Author(s) -
Dong Zhao,
Xiang Li
Publication year - 2010
Publication title -
wuli xuebao
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.199
H-Index - 47
ISSN - 1000-3290
DOI - 10.7498/aps.59.1600
Subject(s) - computer science , complex network , series (stratigraphy) , algorithm , phase space , time series , graph , graph theory , network motif , theoretical computer science , mathematics , physics , combinatorics , machine learning , paleontology , world wide web , biology , thermodynamics
Complex network theory is used to characterize the temporal and phase space features of a time series when it is transferred into a network. In this paper, we study the motif ranks of complex networks induced from different categories of time series with periodic bifurcations and chaos, which are generated with two algorithms: the Visiblity Graph VG algorithm and the Phase-space Reconstruction PR algorithm. The advantages of both algorithms are analyzed.