Detecting series periodicity with horizontal visibility graphs
arXiv:1108.1693 · doi:10.1142/S021812741250160X
Abstract
The horizontal visibility algorithm has been recently introduced as a mapping between time series and networks. The challenge lies in characterizing the structure of time series (and the processes that generated those series) using the powerful tools of graph theory. Recent works have shown that the visibility graphs inherit several degrees of correlations from their associated series, and therefore such graph theoretical characterization is in principle possible. However, both the mathematical grounding of this promising theory and its applications are on its infancy. Following this line, here we address the question of detecting hidden periodicity in series polluted with a certain amount of noise. We first put forward some generic properties of horizontal visibility graphs which allow us to define a (graph theoretical) noise reduction filter. Accordingly, we evaluate its performance for the task of calculating the period of noisy periodic signals, and compare our results with standard time domain (autocorrelation) methods. Finally, potentials, limitations and applications are discussed.
arXiv commentTo be published in International Journal of Bifurcation and Chaos
References in corpus (6)
- From time series to complex networks: the visibility graph
- Recurrence-based time series analysis by means of complex network methods
- The Visibility Graph: a new method for estimating the Hurst exponent of fractional Brownian motion
- Description of stochastic and chaotic series using visibility graphs
- Statistical properties of visibility graph of energy dissipation rates in three-dimensional fully developed turbulence
- A characterization of horizontal visibility graphs and combinatorics on words
Cited by in corpus (5)
- From the time series to the complex networks: the parametric (dynamical) natural visibility graph
- Horizontal Visibility graphs generated by type-I intermittency
- Time Series Analysis via Network Science: Concepts and Algorithms
- Characteristic exponents of complex networks
- Haros graphs: an exotic representation of real numbers