No data available.
Please log in to see this content.
You have no subscription access to this content.
No metrics data to plot.
The attempt to load metrics for this article has failed.
The attempt to plot a graph for these metrics has failed.
Characterizing system dynamics with a weighted and directed network constructed from time series data
1. B. Kitchens, Symbolic Dynamics: One Sided, Two-Sided and Countable State Markov Shifts (Springer, 1998).
3. J. Zhang, J. Sun, X. Luo, K. Zhang, T. Nakamura, and M. Small, “ Characterizing pseudoperiodic time series through the complex network approach,” Physica D 237(22), 2856–2865 (2008).
4. R. V. Donner, M. Small, J. F. Donges, N. Marwan, Y. Zou, R. Xiang, and J. Kurths, “ Recurrence-based time series analysis by means of complex network methods,” Int. J. Bifurcation Chaos 21(04), 1019–1046 (2011).
5. L. Lacasa, B. Luque, F. Ballesteros, J. Luque, and J. C. Nuño, “ From time series to complex networks: The visibility graph,” Proc. Natl. Acad. Sci. U.S.A. 105(13), 4972–4975 (2008).
8. A. M. Nuñez, L. Lacasa, J. P. Gomez, and B. Luque, “ Visibility algorithms: A short review,” in New Frontiers in Graph Theory (InTech, Rijeka, 2012), pp. 119–152.
11. X. Xu, J. Zhang, and M. Small, “ Super family phenomena and motifs of networks induced from time series,” Proc. Natl. Acad. Sci. U.S.A. 105(50), 19601–19605 (2008).
12. Y. Shimada, T. Kimura, and T. Ikeguchi, “ Analysis of chaotic dynamics using measures of the complex network theory,” in ICANN (1), Vol. 5163 Lecture Notes in Computer Science, edited by V. Kurková, R. Neruda, and J. Koutník (Springer, 2008), p. 61–70.
16. R. Xiang, J. Zhang, X.–K. Xu, and M. Small, “ Multiscale characterization of recurrence-based phase space networks constructed from time series,” Chaos 22, 013107 (2012).
20. M. Small, “ Complex networks from time series: Capturing dynamics,” in 2013 IEEE International Symposium on Circuits and Systems (ISCAS) (IEEE, 2013), pp. 2509–2512.
21.That is, replace the L numbers with a permutation of the integers such that the ith integer indicates the relative size of xi among the L numbers.
23. Y. Cao, W.-W. Tung, J. B. Gao, V. A. Protopopescu, and L. M. Hively, “ Detecting dynamical changes in time series using the permutation entropy,” Phys. Rev. E 70(4), 46217 (2004).
25. D. Li, Z. Liang, Y. Wang, S. Hagihira, J. W. Sleigh, and X. Li, “ Parameter selection in permutation entropy for an electroencephalographic measure of isoflurane anesthetic drug effect,” J. Clin. Monit. Comput. 27(2), 113–123 (2013).
26. B. Fadlallah, B. Chen, A. Keil, and J. Príncipe, “ Weighted-permutation entropy: A complexity measure for time series incorporating amplitude information,” Phys. Rev. E 87(2), 022911 (2013).
27. R. Donner, B. Scholz-Reiter, and U. Hinrichs, “ Nonlinear characterization of the performance of production and logistics networks,” J. Manuf. Syst. 27(2), 84–99 (2008).
28. R. Donner, U. Hinrichs, and B. Scholz-Reiter, “ Symbolic recurrence plots: A new quantitative framework for performance analysis of manufacturing networks,” Eur. Phys. J. Spec. Top. 164(1), 85–104 (2008).
32.We note that we do not claim that this estimate of the underlying distribution is unbiased. We will show that it is enough that it depends in some non-trivial way on the true distribution—and hence the true recurrence pattern of the underlying dynamical system.
33. E. Mosekilde, Topics in Nonlinear Dynamics: Applications to Physics, Biology and Economic Systems (World Scientific, 1996).
34. Y. Zou, R. V. Donner, M. Wickramasinghe, I. Z. Kiss, M. Small, and J. Kurths, “ Phase coherence and attractor geometry of chaotic electrochemical oscillators,” Chaos 22, 033130 (2012).
35. Y. Zou, R. V. Donner, J. F Donges, N. Marwan, and J. Kurths, “ Identifying complex periodic windows in continuous-time dynamical systems using recurrence-based methods,” Chaos 20(4), 043130 (2010).
36. R. Hegger, H. Kantz, and T. Schreiber, “ Practical implementation of nonlinear time series methods: The tisean package,” Chaos 9(2), 413–435 (1999).
Article metrics loading...
In this work, we propose a novel method to transform a time series into a weighted and directed network. For a given time series, we first generate a set of segments via a sliding window, and then use a doubly symbolic scheme to characterize every windowed segment by combining absolute amplitude information with an ordinal pattern characterization. Based on this construction, a network can be directly constructed from the given time series: segments corresponding to different symbol-pairs are mapped to network nodes and the temporal succession between nodes is represented by directed links. With this conversion, dynamics underlying the time series has been encoded into the network structure. We illustrate the potential of our networks with a well-studied dynamical model as a benchmark example. Results show that network measures for characterizing global properties can detect the dynamical transitions in the underlying system. Moreover, we employ a random walk algorithm to sample loops in our networks, and find that time series with different dynamics exhibits distinct cycle structure. That is, the relative prevalence of loops with different lengths can be used to identify the underlying dynamics.
Full text loading...
Most read this month