Search

We propose a cross horizontal visibility graph (CHVG) algorithm to explore associations between two time series. As a natural extension of the classic horizontal visibility graph algorithm, the proposed CHVG algorithm can preserve merits of the classic algorithm in construction and implementation. To verify the effectiveness of the CHVG algorithm, we design numerical simulations by generating paired time series with three experimental settings: namely independent autocorrelated series, cross-correlated series with no autocorrelation, and cross-correlated series with autocorrelation. The corresponding CHVGs can be accordingly constructed from these generated pairs of time series. Our results show that the degree distributions of all constructed CHVGs follow exponential distributions P (k) ∼ e − λ k . Furthermore, the estimated exponent λ can reflect associations between two time series, mainly due to their cross correlation but also relevant to autocorrelation of individual series. We demonstrate the applicability of the proposed CHVG algorithm by investigating associations between the air pollutant PM 10 and the meteorological factors (i.e., temperature and relative humidity) at two stations in Hong Kong. Our algorithm can effectively capture the negative cross correlations between all combinations pairing the pollutant PM 10 and one of the two meteorological factors at both stations, which sheds light on understanding, modeling, and prediction of the air pollution process. • A cross horizontal visibility graph (CHVG) algorithm is proposed. • The CHVG algorithm preserves merits of the classic HVG algorithm. • CHVGs created from pairs of simulated series have exponential degree distributions. • The exponents of degree distributions reveal associations between two time series. • The applicability of the CHVG algorithm is verified by an air pollution case study. [ABSTRACT FROM AUTHOR]