Exact results of the limited penetrable horizontal visibility graph associated to random time series and its application
arXiv:1710.09877
Abstract
The limited penetrable horizontal visibility algorithm is a new time analysis tool and is a further development of the horizontal visibility algorithm. We present some exact results on the topological properties of the limited penetrable horizontal visibility graph associated with random series. We show that the random series maps on a limited penetrable horizontal visibility graph with exponential degree distribution , independent of the probability distribution from which the series was generated. We deduce the exact expressions of the mean degree and the clustering coefficient and demonstrate the long distance visibility property. Numerical simulations confirm the accuracy of our theoretical results. We then examine several deterministic chaotic series (a logistic map, the Hnon map, the Lorentz system, and an energy price chaotic system) and a real crude oil price series to test our results. The empirical results show that the limited penetrable horizontal visibility algorithm is direct, has a low computational cost when discriminating chaos from uncorrelated randomness, and is able to measure the global evolution characteristics of the real time series.
arXiv comment23 pages, 12 figures
References in corpus (7)
- Emergence of scaling in random networks
- From time series to complex networks: the visibility graph
- Detrended Cross-Correlation Analysis: A New Method for Analyzing Two Non-stationary Time Series
- Renormalization group analysis of the small-world network model
- Description of stochastic and chaotic series using visibility graphs
- From the time series to the complex networks: the parametric (dynamical) natural visibility graph
- On the degree distribution of horizontal visibility graphs associated to Markov processes and dynamical systems: diagrammatic and variational approaches