Distinguishing noise from chaos: objective versus subjective criteria using Horizontal Visibility Graph

Abstract

A recently proposed methodology called the Horizontal Visibility Graph (HVG) [Luque {\it et al.}, Phys. Rev. E., 80, 046103 (2009)] that constitutes a geometrical simplification of the well known Visibility Graph algorithm [Lacasa {\it et al.\/}, Proc. Natl. Sci. U.S.A. 105, 4972 (2008)], has been used to study the distinction between deterministic and stochastic components in time series [L. Lacasa and R. Toral, Phys. Rev. E., 82, 036120 (2010)]. Specifically, the authors propose that the node degree distribution of these processes follows an exponential functional of the form $P(\kappa )\sim \exp (-\lambda \kappa )$, in which $\kappa$ is the node degree and $\lambda$ is a positive parameter able to distinguish between deterministic (chaotic) and stochastic (uncorrelated and correlated) dynamics. In this work, we investigate the characteristics of the node degree distributions constructed by using HVG, for time series corresponding to $28$ chaotic maps and $3$ different stochastic processes. We thoroughly study the methodology proposed by Lacasa and Toral finding several cases for which their hypothesis is not valid. We propose a methodology that uses the HVG together with Information Theory quantifiers. An extensive and careful analysis of the node degree distributions obtained by applying HVG allow us to conclude that the Fisher-Shannon information plane is a remarkable tool able to graphically represent the different nature, deterministic or stochastic, of the systems under study.

Submitted to PLOS One

References in corpus (1)

• From time series to complex networks: the visibility graph

Cited by in corpus (19)

• Complex network approaches to nonlinear time series analysis
• Unveiling temporal correlations characteristic to phase transition in the intensity of a fibre laser radiation
• Time Series Analysis via Network Science: Concepts and Algorithms
• Classification and Verification of Online Handwritten Signatures with Time Causal Information Theory Quantifiers
• Visibility graph analysis of economy policy uncertainty indices
• Fully Developed Turbulence in the view of Horizontal Visibility Graphs
• Multiplex visibility graphs to investigate recurrent neural networks dynamics
• Quantifying instabilities in Financial Markets
• Simulation of complex dynamics of mean-field $p$-spin models using measurement-based quantum feedback control
• Exact Shannon entropies for the multidimensional harmonic states
• Analytic degree distributions of horizontal visibility graphs mapped from unrelated random series and multifractal binomial measures
• Exploiting the impact of ordering patterns in the Fisher-Shannon complexity plan
• Schrödinger-Koopman quasienergy states of quantum systems driven by a classical flow
• Persistence and Stochastic Periodicity in the Intensity Dynamics of a Fiber Laser During the Transition to Optical Turbulence
• Reconciling econometrics with continuous maximum-entropy network models
• Visibility graph analysis of the grains and oilseeds indices
• Discriminating chaotic and stochastic time series using permutation entropy and artificial neural networks
• Leveraging the Self-Transition Probability of Ordinal Pattern Transition Graph for Transportation Mode Classification
• Exploring Complexity Measures for Analysis of Solar Wind Structures and Streams