2011
DOI: 10.1142/s0219477511000636
|View full text |Cite
|
Sign up to set email alerts
|

Visibility Graphs for Time Series Containing Different Components

Abstract: We consider the visibility graphs for superpositions of fractional Brownian motions with different Hurst exponents. It is found that the degree distributions obey power-law. The components with lower Hurst exponents dominate the heterogeneity behaviors of the visibility graphs. These findings are helpful for us to understand the characteristics of visibility graphs for real-world time series.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 19 publications
0
3
0
Order By: Relevance
“…The multicluster feature selection (MCFS) algorithm was applied to sort features [30]. The basic principle of MCFS is first to construct a p -nearest neighbor graph according to (21):…”
Section: Feature Selection and Classificationmentioning
confidence: 99%
See 1 more Smart Citation
“…The multicluster feature selection (MCFS) algorithm was applied to sort features [30]. The basic principle of MCFS is first to construct a p -nearest neighbor graph according to (21):…”
Section: Feature Selection and Classificationmentioning
confidence: 99%
“…EEG signals are recorded as time-series signals of brain activity, and studies show that such time-series signals captured at different brain regions reflect the brain activity synergy of their corresponding brain regions. Such EEG time-series signals acquired from multiple locations of the brain form a brain network [21,22], and cognitive activities can be analyzed by extracting different measures in the brain network in order to reflect differences between brain regions activated by different users. Finally, the classification accuracy can be improved.…”
Section: Introductionmentioning
confidence: 99%
“…We have done some work on the mixture problem for a one-dimensional visibility graph. [70] To understand the results for real-world landscapes, detailed and systematic works based upon modelgenerated landscapes are required to serve as benchmarks.…”
Section: Discussionmentioning
confidence: 99%