Time series irreversibility: a visibility graph approach
Lucas Lacasa, \'Angel M. N\'u\~nez, \'Edgar Rold\'an, Juan M.R., Parrondo, Bartolo Luque

TL;DR
This paper introduces a novel, efficient method combining visibility graphs and Kullback-Leibler divergence to quantify time series irreversibility across multiple scales, distinguishing between reversible and irreversible processes.
Contribution
It presents a new approach that maps time series to directed networks and measures irreversibility without ad hoc symbolization, applicable to various stochastic and chaotic processes.
Findings
Successfully distinguishes reversible and irreversible time series
Effective for stochastic, chaotic, and noisy processes
Uses degree and degree-degree distributions for analysis
Abstract
We propose a method to measure real-valued time series irreversibility which combines two differ- ent tools: the horizontal visibility algorithm and the Kullback-Leibler divergence. This method maps a time series to a directed network according to a geometric criterion. The degree of irreversibility of the series is then estimated by the Kullback-Leibler divergence (i.e. the distinguishability) between the in and out degree distributions of the associated graph. The method is computationally effi- cient, does not require any ad hoc symbolization process, and naturally takes into account multiple scales. We find that the method correctly distinguishes between reversible and irreversible station- ary time series, including analytical and numerical studies of its performance for: (i) reversible stochastic processes (uncorrelated and Gaussian linearly correlated), (ii) irreversible…
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.
