Visibility graph analysis for re-sampled time series from auto-regressive stochastic processes

Abstract Visibility graph (VG) and horizontal visibility graph (HVG) play a crucial role in modern complex network approaches to nonlinear time series analysis. However, depending on the underlying dynamic processes, it remains to characterize the exponents of presumably exponential degree distributions. It has been recently conjectured that there is a critical value of exponent λ c = ln 3 / 2 , which separates chaotic from correlated stochastic processes. Here, we systematically apply (H)VG analysis to time series from autoregressive (AR) models, which confirms the hypothesis that an increased correlation length results in larger values of λ > λ c . On the other hand, we numerically find a regime of negatively correlated process increments where λ λ c , which is in contrast to this hypothesis. Furthermore, by constructing graphs based on re-sampled time series, we find that network measures show non-trivial dependencies on the autocorrelation functions of the processes. We propose to choose the decorrelation time as the maximal re-sampling delay for the algorithm. Our results are detailed for time series from AR(1) and AR(2) processes.

[1]  Michael Small,et al.  Long-term changes in the north-south asymmetry of solar activity: a nonlinear dynamics characterization using visibility graphs , 2014 .

[2]  J. M. R. Parrondo,et al.  Time series irreversibility: a visibility graph approach , 2012 .

[3]  Lucas Lacasa,et al.  Time reversibility from visibility graphs of nonstationary processes. , 2015, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Michael Small,et al.  Phase coherence and attractor geometry of chaotic electrochemical oscillators. , 2012, Chaos.

[5]  J. Kurths,et al.  Complex network approach for recurrence analysis of time series , 2009, 0907.3368.

[6]  Lucas Lacasa,et al.  On the degree distribution of horizontal visibility graphs associated with Markov processes and dynamical systems: diagrammatic and variational approaches , 2014, 1402.5368.

[7]  M. Weigt,et al.  On the properties of small-world network models , 1999, cond-mat/9903411.

[8]  Yue Yang,et al.  Visibility graph approach to exchange rate series , 2009 .

[9]  Emily A. Fogarty,et al.  Visibility network of United States hurricanes , 2009 .

[10]  Zhong-Ke Gao,et al.  Recurrence networks from multivariate signals for uncovering dynamic transitions of horizontal oil-water stratified flows , 2013 .

[11]  Michael Small,et al.  Complex network approach to characterize the statistical features of the sunspot series , 2013, 1307.6280.

[12]  J. C. Nuño,et al.  The visibility graph: A new method for estimating the Hurst exponent of fractional Brownian motion , 2009, 0901.0888.

[13]  Mark E. J. Newman,et al.  Power-Law Distributions in Empirical Data , 2007, SIAM Rev..

[14]  Jürgen Kurths,et al.  Analyzing long-term correlated stochastic processes by means of recurrence networks: potentials and pitfalls. , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  J. A. Stewart,et al.  Nonlinear Time Series Analysis , 2015 .

[16]  Zhi-Qiang Jiang,et al.  Degree distributions of the visibility graphs mapped from fractional Brownian motions and multifractal random walks , 2008, 0812.2099.

[17]  H. Adeli,et al.  Improved visibility graph fractality with application for the diagnosis of Autism Spectrum Disorder , 2012 .

[18]  Jürgen Kurths,et al.  Recurrence networks—a novel paradigm for nonlinear time series analysis , 2009, 0908.3447.

[19]  Lucas Lacasa,et al.  Description of stochastic and chaotic series using visibility graphs. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Martín Gómez Ravetti,et al.  Distinguishing Noise from Chaos: Objective versus Subjective Criteria Using Horizontal Visibility Graph , 2014, PloS one.

[21]  Jürgen Kurths,et al.  Nonlinear detection of paleoclimate-variability transitions possibly related to human evolution , 2011, Proceedings of the National Academy of Sciences.

[22]  M E Newman,et al.  Scientific collaboration networks. I. Network construction and fundamental results. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  Jurgen Kurths,et al.  Testing time series irreversibility using complex network methods , 2012, 1211.1162.

[24]  Norbert Marwan,et al.  The geometry of chaotic dynamics — a complex network perspective , 2011, 1102.1853.

[25]  Michael Small,et al.  Recurrence-based time series analysis by means of complex network methods , 2010, Int. J. Bifurc. Chaos.

[26]  M Small,et al.  Complex network from pseudoperiodic time series: topology versus dynamics. , 2006, Physical review letters.

[27]  Michael Small,et al.  Superfamily phenomena and motifs of networks induced from time series , 2008, Proceedings of the National Academy of Sciences.

[28]  Wei-Xing Zhou,et al.  Statistical properties of visibility graph of energy dissipation rates in three-dimensional fully developed turbulence , 2009, 0905.1831.

[29]  B. Mandelbrot,et al.  Fractional Brownian Motions, Fractional Noises and Applications , 1968 .

[30]  Annette Witt,et al.  Quantification of Long-Range Persistence in Geophysical Time Series: Conventional and Benchmark-Based Improvement Techniques , 2013, Surveys in Geophysics.

[31]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[32]  Zhong-Ke Gao,et al.  Visibility Graphs From Experimental Three-Phase Flow For Characterizing Dynamic Flow Behavior , 2012 .

[33]  Jan Beran,et al.  Statistics for long-memory processes , 1994 .

[34]  B. Luque,et al.  Horizontal visibility graphs: exact results for random time series. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[35]  M E J Newman.  Assortative mixing in networks. , 2002, Physical review letters.

[36]  Lucas Lacasa,et al.  From time series to complex networks: The visibility graph , 2008, Proceedings of the National Academy of Sciences.