Detecting series periodicity with horizontal visibility graphs

From MaRDI portal
Publication:2843641

DOI10.1142/S021812741250160XzbMATH Open1271.62206arXiv1108.1693OpenAlexW2171558106MaRDI QIDQ2843641FDOQ2843641


Authors: Angel Nuñez, Jose Patricio Gómez, Bartolo Luque, Lucas Lacasa, E. Valero Edit this on Wikidata


Publication date: 23 August 2013

Published in: International Journal of Bifurcation and Chaos in Applied Sciences and Engineering (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1108.1693




Recommendations




Cites Work


Cited In (11)





This page was built for publication: Detecting series periodicity with horizontal visibility graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2843641)