Exact results of the limited penetrable horizontal visibility graph associated to random time series and its application.
Ontology highlight
ABSTRACT: 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
SUBMITTER: Wang M
PROVIDER: S-EPMC5865175 | biostudies-literature | 2018 Mar
REPOSITORIES: biostudies-literature
ACCESS DATA