Mapping time series into signed networks via horizontal visibility graph

Abstract

Time series could be mapped into complex networks through the visibility or horizontal visibility algorithms, and the properties of the constructed network reflect the nonlinear dynamics of the time series. When horizontal visibility algorithm is directly applied to climate anomaly time series, in which both local maximum and local minimum are equally important, local minimum might be “overlooked”. In this paper, we propose a new method that maps climate anomaly time series into signed networks. Positive and negative data values of climate anomaly time series are classified into two types and mapped as nodes of signed networks. Links connecting nodes of the same type are assigned positive signs, while links connecting neighboring nodes of different types are assigned negative signs. This method is also applicable to time series those are assumed to be “stationary” or with no significant trends. Four kinds of degree as well as the degree distributions of the signed networks have been defined. Specifically, the degree and degree distribution could be partly derived analytically for periodic and uncorrelated random time series. The theoretical predictions for periodic and uncorrelated random time series have also been verified by extensive numerical simulations. Based on the entropy of the distribution of net degree, we propose a new complexity measure for chaotic time series. Compared to some previous complexity measures, the new complexity measure is an objective measure without transforming continuous values into discrete probability distributions but still has higher accuracy and sensitivity. Moreover, correlation information of stochastic time series can also be extracted via a topological parameter, the mean of ratio degree, of the signed networks. The extraction of serial correlation has been illustrated through numerical simulations and verified through an empirical climate time series.