Detecting series periodicity with horizontal visibility graphs

DOI10.1142/S021812741250160XMaRDI QIDQ2843641zbMATH OpenOpenAlexFDO

Authors Angel Nuñez, Jose Patricio Gómez, Bartolo Luque, Lucas Lacasa, E. Valero

Publication date 23 August 2013

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

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

zbMATH Keywords

time seriescomplex networksperiodicity detectionnoise filterhorizontal visibility graph

Mathematics Subject Classification ID

Time series, auto-correlation, regression, etc. in statistics (GARCH) (62M10) Learning and adaptive systems in artificial intelligence (68T05) Graph theory (05C99)

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.

Recommendations

• From time series to complex networks: the visibility graph
• Degree distributions and motif profiles of limited penetrable horizontal visibility graphs
• Horizontal visibility graphs from integer sequences
• Fast transformation from time series to visibility graphs
• Discriminating chaotic time series with visibility graph eigenvalues

Cites work

• From time series to complex networks: the visibility graph
• Recurrence-based time series analysis by means of complex network methods

Cited in

(11)

• Nonuniversality of the horizontal visibility graph in inferring series periodicity
• A numerical study on the regularity of \(d\)-primes via informational entropy and visibility algorithms
• Fast transformation from time series to visibility graphs
• From standard alpha-stable Lévy motions to horizontal visibility networks: dependence of multifractal and Laplacian spectrum
• Intermittency route to self-excited chaotic thermoacoustic oscillations
• Mapping time series into signed networks via horizontal visibility graph
• Discriminating chaotic time series with visibility graph eigenvalues
• On the spectral properties of Feigenbaum graphs
• Multiscale horizontal visibility entropy: measuring the temporal complexity of financial time series
• From the time series to the complex networks: the parametric natural visibility graph
• Tetradic motif profiles of horizontal visibility graphs

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)