摘要：The limited penetrable horizontal visibility algorithm is an analysis tool that maps time series into complex networks and is a further development of the horizontal visibility algorithm. This paper presents exact results on the topological properties of the limited penetrable horizontal visibility graph associated with independent and identically distributed (i:i:d:) random series. We show that the i.i.d: 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 mean degree and clustering coefficient, demonstrate the long distance visibility property of the graph and perform numerical simulations to test the accuracy of our theoretical results. We then use the algorithm in several deterministic chaotic series, such as the logistic map, H´enon map, Lorenz system, energy price chaotic system and the real crude oil price. Our results show that the limited penetrable horizontal visibility algorithm is efficient to discriminate chaos from uncorrelated randomness and is able to measure the global evolution characteristics of the real time series.
