The Simplicial Characterisation of TS Networks: Theory and Applications
We use the visibility algorithm to construct the time series networks obtained from the time series of different dynamical regimes of the logistic map. We define the simplicial characterisers of networks which can analyse the simplicial structure at both the global and local levels. These characterisers are used to analyse the TS networks obtained in different dynamical regimes of the logisitic map. It is seen that the simplicial characterisers are able to distinguish between distinct dynamical regimes. We also apply the simplicial characterisers to time series networks constructed from fMRI data, where the preliminary results indicate that the characterisers are able to differentiate between distinct TS networks.
KeywordsSimplicial Complex Dynamical Regime Hurst Exponent Reading Task Visibility Algorithm
We would like to thank Dr. Nandini Chatterjee Singh and Dr. Sarika Cherodath of NBRC, Manesar for the fMRI data, and N. Nithyanand Rao for earlier collaboration.
- 1.R.V. Donner, Y. Zou, J.F. Donges, N. Marwan, J. Kurths, Recurrence networks—a novel paradigm for nonlinear time series analysis. New J. Phys. 12(3), 033025 (2010)Google Scholar
- 6.J. Jonsson, Simplicial Complexes of Graphs (Springer, 2008)Google Scholar
- 9.B. Luque, L. Lacasa, F. Ballesteros, J. Luque, Horizontal visibility graphs: Exact results for random time series. Phys. Rev. E 80, 046103 (2009)Google Scholar