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

Recurrence Networks: Evolution and Robustness

Abstract: We analyze networks generated by the recurrence plots of the time series of chaotic systems and study their properties, evolution and robustness against several types of attacks. Evolving recurrence networks obtained from chaotic systems display interesting features from the point of view of robustness (in particular, those related to their connectivity), which could help in the design of systems with high capability and robustness for information diffusion. The approach is extended to cases where the equation… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0

Year Published

2011
2011
2021
2021

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(14 citation statements)
references
References 33 publications
0
14
0
Order By: Relevance
“…For example, noise can hide peaks in the power spectrum of a time series, whereas recurrence network analysis and related geometric methods can conserve the basic attractor properties such as a torus-like shape even in the presence of moderate noise levels. 66,79 Hence, it can be challenging to decide about the presence of phase coherence using dynamical characteristics such as power spectral density, recurrence time distribution, or phase diffusion coefficient even after an appropriate coordinate transformation (see above) in case of noisy experimental data. These problems are partially avoided by considering the geometric viewpoint.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…For example, noise can hide peaks in the power spectrum of a time series, whereas recurrence network analysis and related geometric methods can conserve the basic attractor properties such as a torus-like shape even in the presence of moderate noise levels. 66,79 Hence, it can be challenging to decide about the presence of phase coherence using dynamical characteristics such as power spectral density, recurrence time distribution, or phase diffusion coefficient even after an appropriate coordinate transformation (see above) in case of noisy experimental data. These problems are partially avoided by considering the geometric viewpoint.…”
Section: Discussionmentioning
confidence: 99%
“…[54][55][56] Finally, e-recurrence networks (RNs) provide a graphtheoretical framework for quantifying various aspects of the underlying attractor's geometry. 29,[57][58][59][60][61][62][63][64][65][66][67] In the following, we will use pðsÞ and K 2 for further characterizing the dynamical complexity of the observed electrochemical oscillations. For this purpose, we will restrict our attention to the first N ¼ 10 000 points of the embedded time series in order to keep the computational efforts at an acceptable level.…”
Section: -5mentioning
confidence: 99%
“…ε networks have been applied to model systems as well as real world data like paleoclimate records and biomedical data [11,[18][19][20][21][22][23][24][25][26]. Network measures, like the average clustering coefficient C and the average path length L, have been used to discriminate between chaotic and periodic dynamics [20].…”
Section: Introductionmentioning
confidence: 99%
“…Quite independent of the above, the field of complex networks has been extensively studied by itself and successfully applied in manifold instances in science, nature and engineering 30 31 . With significant advances being reported from various fields 32 33 34 35 36 37 38 39 40 41 42 43 , the importance of converting time series into networks is becoming increasingly clear over the last few years 44 .…”
Section: Time Series To Networkmentioning
confidence: 99%