Description of stochastic and chaotic series using visibility graphs
Lucas Lacasa, Raul Toral

TL;DR
This paper uses the horizontal visibility algorithm to analyze different types of nonlinear time series, revealing that their graph representations follow exponential degree distributions with specific parameters.
Contribution
It demonstrates that the horizontal visibility algorithm can distinguish between stochastic and chaotic processes through their graph degree distributions.
Findings
Series map into graphs with exponential degree distribution
The parameter λ characterizes the process type
Exact calculation of the chaos-stochastic frontier at λ = ln(3/2)
Abstract
Nonlinear time series analysis is an active field of research that studies the structure of complex signals in order to derive information of the process that generated those series, for understanding, modeling and forecasting purposes. In the last years, some methods mapping time series to network representations have been proposed. The purpose is to investigate on the properties of the series through graph theoretical tools recently developed in the core of the celebrated complex network theory. Among some other methods, the so-called visibility algorithm has received much attention, since it has been shown that series correlations are captured by the algorithm and translated in the associated graph, opening the possibility of building fruitful connections between time series analysis, nonlinear dynamics, and graph theory. Here we use the horizontal visibility algorithm to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
