2018
DOI: 10.1103/physreve.97.052117
|View full text |Cite
|
Sign up to set email alerts
|

Topological properties of the limited penetrable horizontal visibility graph family

Abstract: The limited penetrable horizontal visibility graph algorithm was recently introduced to map time series in complex networks. In this work, we extend this algorithm to create a directed-limited penetrable horizontal visibility graph and an image-limited penetrable horizontal visibility graph. We define two algorithms and provide theoretical results on the topological properties of these graphs associated with different types of real-value series. We perform several numerical simulations to check the accuracy of… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 13 publications
(3 citation statements)
references
References 54 publications
0
3
0
Order By: Relevance
“…The LPHVG is an enhancement of the HVG. By setting the limited penetrable distance to ρ, a link between two nodes exists if the number of in-between nodes that block the horizontal line is at most ρ [43][44][45][46][47]. If ρ = 0, LPHVG degenerates into HVG, but if ρ ̸ = 0, there are more connections between any two nodes in LPHVG than in HVG.…”
Section: Limited Penetrable Horizontal Visibility Graphmentioning
confidence: 99%
“…The LPHVG is an enhancement of the HVG. By setting the limited penetrable distance to ρ, a link between two nodes exists if the number of in-between nodes that block the horizontal line is at most ρ [43][44][45][46][47]. If ρ = 0, LPHVG degenerates into HVG, but if ρ ̸ = 0, there are more connections between any two nodes in LPHVG than in HVG.…”
Section: Limited Penetrable Horizontal Visibility Graphmentioning
confidence: 99%
“…The directed-limited penetrable horizontal visibility graph (DLPHVG) and the image-limited penetrable horizontal visibility graph (ILPHVG), which are named as the LPHVG family, have also been developed [ 93 ]. Numerical experiments have been taken to investigate topological properties of these networks, and they can be used to show the irreversibility of time series and discriminate noise from chaos.…”
Section: Visibility Graphmentioning
confidence: 99%
“…Its advantage is that the associated network not only inherits the inherent characteristics of the original time series, but also is convenient to analyze the dynamic characteristics of the time series. Therefore, visibility graph, horizontal visibility graph, penetrable visibility graph, directed limited penetrable visibility graph have gradually become important branches in the study of time series [13][14][15][16].…”
Section: Introductionmentioning
confidence: 99%