2014
DOI: 10.1371/journal.pone.0108004
|View full text |Cite
|
Sign up to set email alerts
|

Distinguishing Noise from Chaos: Objective versus Subjective Criteria Using Horizontal Visibility Graph

Abstract: A recently proposed methodology called the Horizontal Visibility Graph (HVG) [Luque et al., Phys. Rev. E., 80, 046103 (2009)] that constitutes a geometrical simplification of the well known Visibility Graph algorithm [Lacasa et al., Proc. Natl. Sci. U.S.A. 105, 4972 (2008)], has been used to study the distinction between deterministic and stochastic components in time series [L. Lacasa and R. Toral, Phys. Rev. E., 82, 036120 (2010)]. Specifically, the authors propose that the node degree distribution of these … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
50
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
8
1

Relationship

2
7

Authors

Journals

citations
Cited by 79 publications
(50 citation statements)
references
References 81 publications
0
50
0
Order By: Relevance
“…This would open for the possibility to distinguish between the two process classes by determining the corresponding λ from the HVG degree distribution. However, Ravetti et al 18 provide ample numerical evidence which does not support this suggestion, and the classification based on the criterion seems unfeasible. To the best of our knowledge, there is no analytical expression for the degree distribution of correlated noise available, and it thus remains unclear whether it would be an exponential at all.…”
Section: E Degree Distributionsmentioning
confidence: 98%
“…This would open for the possibility to distinguish between the two process classes by determining the corresponding λ from the HVG degree distribution. However, Ravetti et al 18 provide ample numerical evidence which does not support this suggestion, and the classification based on the criterion seems unfeasible. To the best of our knowledge, there is no analytical expression for the degree distribution of correlated noise available, and it thus remains unclear whether it would be an exponential at all.…”
Section: E Degree Distributionsmentioning
confidence: 98%
“…In the past decade many methods in a different application domains have been proposed to make this distinction, the most recent are reported in Skiadas and Skiadas (2016), Ravetti et al (2014), Rohde (2008), Gao et al (2006), and Rosso et al (2007). …”
Section: Detecting Chaos In B Subtilis Sporulation Network Dynamicsmentioning
confidence: 99%
“…The topology of a graph is characterized by the degree distribution, p(k), that is the probability that a node has k links. Thus, the entropy of the degree distribution, S HV G = p k log(p k ) (in the following, referred to as HVG entropy), is another measure of the complexity of the time series {x i } [18]. An appropriate normalization of the HVG entropy is that of the Gaussian white noise, which rapidly converges to stable values for increasing time series lengths (percentage variations for times series with N = 10 5 and N = 5 × 10 5 data points are 10 4 and 10 5 ; in contrasts, the normalization through log(N) results in decreasing entropy values as N increases [18]).…”
Section: The Time-series Analysismentioning
confidence: 99%