2018
DOI: 10.1038/s41598-018-23388-1
|View full text |Cite
|
Sign up to set email alerts
|

Exact results of the limited penetrable horizontal visibility graph associated to random time series and its application

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 distributi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
11
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 26 publications
(21 citation statements)
references
References 46 publications
(95 reference statements)
2
11
0
Order By: Relevance
“…Wang et al (2018) presents some exact results (similar to those obtained for the HVGs presented in Section 3.1.2) on the topological properties of the LPHVG associated with bi‐infinite time series of i.i.d. random variables with a probability density f ( x ).…”
Section: Mapping Univariate Time Series Into Complex Networksupporting
confidence: 53%
See 2 more Smart Citations
“…Wang et al (2018) presents some exact results (similar to those obtained for the HVGs presented in Section 3.1.2) on the topological properties of the LPHVG associated with bi‐infinite time series of i.i.d. random variables with a probability density f ( x ).…”
Section: Mapping Univariate Time Series Into Complex Networksupporting
confidence: 53%
“…From Equation () we obtain the average degree truek¯: truek¯=italickP()k=4()l+1. And based on the Equation ) we can deduce the minimum and maximum local clustering coefficient of the LPHVG associated to i.i.d. random series as (see Wang, Vilela, et al, 2018 for more details): Cmin()k=2k+2l()k2k()k1,1eml=0,1,2,;1emk2()l+1 Cmax()k=2k+4l()k3k()k1,1eml=0,1,2,;1emk2()2l+1. For an infinite periodic series of period P the average degree depends on the period P : truek¯=4()l+1()12l+12P,1emlP. LPHVG was employed in the analysis of EEG signals and biphasic‐flow signals where they characterize the behaviors underlying the systems (Gao, Cai, et al, 2016), in the analysis of chaotic series and energy and oil price series (Wang, Vilela, et al, 2018), and to distinguish between random, periodic and chaotic signals using motifs (Wang, Xu, et al, 2018).…”
Section: Mapping Univariate Time Series Into Complex Networkmentioning
confidence: 99%
See 1 more Smart Citation
“…This bridge between time series, dynamic systems, and graph theory allows, with relative ease, the inference of a system’s features that would have been derivable with much more complex techniques (nonlinear analyses) and, in certain conditions, the highlighting of features that other methods are not fully able to emphasize, such as changes in the dynamic behavior of the system (e.g., Baggio and Sainaghi 2011). This methodology has had many applications in different domains (M. Wang et al 2018) including tourism (Baggio and Sainaghi 2016; Sainaghi and Baggio 2014, 2017).…”
Section: Literature Reviewmentioning
confidence: 99%
“…e method's primary thought is to express the complex system using complex network and then reveal the essential characteristics of the system by using the network topology. In this field, a series of algorithms have been developed to convert the nonlinear time series of a single variable into a complex network, such as visibility methods, including natural visibility graph [12], horizontal visibility graph [13], parametric natural visibility graph [14], limited penetrable horizontal visibility graph [15], and parametric modified limited penetrable visibility graph [16], the mapping algorithm for pseudoperiodic time series [17], phase space roughening algorithm [18], and algorithms based on phase space reconstruction [19,20]. For multivariate time series, scholars have carried out a significant amount of research on how to analyze multivariate time series using complex networks.…”
Section: Introductionmentioning
confidence: 99%