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 P(k)∼exp[−λ(k−2ρ−2)],λ=ln[(2ρ+3)/(2ρ+2)],ρ=0,1,2,...,k=2ρ+2,2ρ+3,...,
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
Heˊnon 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.Comment: 23 pages, 12 figure