Theoretical results on the topological properties of the limited penetrable horizontal visibility graph family

The limited penetrable horizontal visibility graph algorithm was recently introduced to map time series in complex networks. We extend this visibility graph and create a directed limited penetrable horizontal visibility graph and an image limited penetrable horizontal visibility graph. We define the...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:arXiv.org
Hlavní autoři: Wang, Minggang, Vilela, Andre L M, Du, Ruijin, Zhao, Longfeng, Dong, Gaogao, Tian, Lixin, Stanley, H Eugene
Médium: Paper
Jazyk:angličtina
Vydáno: Ithaca Cornell University Library, arXiv.org 14.11.2017
Témata:
Algorithms
Computer simulation
Economic models
Time series
Topology
Visibility
ISSN:2331-8422
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The limited penetrable horizontal visibility graph algorithm was recently introduced to map time series in complex networks. We extend this visibility graph and create a directed limited penetrable horizontal visibility graph and an image limited penetrable horizontal visibility graph. We define the two algorithms and provide theoretical results on the topological properties of these graphs associated with different types of real-value series (or matrices). We perform several numerical simulations to further check the accuracy of our theoretical results. Finally we present an application of the directed limited penetrable horizontal visibility graph for measuring real-value time series irreversibility, and an application of the image limited penetrable horizontal visibility graph that discriminates noise from chaos. The empirical results show the effectiveness of our proposed algorithms.
Bibliografie:SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
ISSN:2331-8422
DOI:10.48550/arxiv.1711.05158