title: Time reversibility from visibility graphs of nonstationary processes.
abstract: Visibility algorithms are a family of methods to map time series into networks, with the aim of describing the structure of time series and their underlying dynamical properties in graph-theoretical terms. Here we explore some properties of both natural and horizontal visibility graphs associated to several nonstationary processes, and we pay particular attention to their capacity to assess time irreversibility. Nonstationary signals are (infinitely) irreversible by definition (independently of whether the process is Markovian or producing entropy at a positive rate), and thus the link between entropy production and time series irreversibility has only been explored in nonequilibrium stationary states. Here we show that the visibility formalism naturally induces a new working definition of time irreversibility, which allows us to quantify several degrees of irreversibility for stationary and nonstationary series, yielding finite values that can be used to efficiently assess the presence of memory and off-equilibrium dynamics in nonstationary processes without the need to differentiate or detrend them. We provide rigorous results complemented by extensive numerical simulations on several classes of stochastic processes.
authors.affiliation: School of Mathematical Sciences, Queen Mary University of London, Mile End Road, E14NS London, United Kingdom.
authors.forename: Lucas
authors.initials: L
authors.lastname: Lacasa
authors.affiliation: School of Mathematical Sciences, Queen Mary University of London, Mile End Road, E14NS London, United Kingdom.
authors.forename: Ryan
authors.initials: R
authors.lastname: Flanagan