2015
DOI: 10.1088/1367-2630/17/2/023068
|View full text |Cite
|
Sign up to set email alerts
|

Quantifying sudden changes in dynamical systems using symbolic networks

Abstract: We characterize the evolution of a dynamical system by combining two well-known complex systems' tools, namely, symbolic ordinal analysis and networks. From the ordinal representation of a time series we construct a network in which every node weight represents the probability of an ordinal pattern (OP) to appear in the symbolic sequence and each edgeʼs weight represents the probability of transitions between two consecutive OPs. Several network-based diagnostics are then proposed to characterize the dynamics … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
30
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
9
1

Relationship

2
8

Authors

Journals

citations
Cited by 31 publications
(32 citation statements)
references
References 41 publications
(54 reference statements)
0
30
0
Order By: Relevance
“…It is worth noticing that other generalized algorithms for building ordinal networks from time series have been proposed and applied. These different numerical recipes include the use of non-overlapping partitions [10,27], partitions with time-lagged elements [25], and the inclusion of amplitude information about the time series elements [26]. Naturally, the constraints we have discussed here do not hold for these generalized algorithms.…”
Section: Methodsmentioning
confidence: 99%
“…It is worth noticing that other generalized algorithms for building ordinal networks from time series have been proposed and applied. These different numerical recipes include the use of non-overlapping partitions [10,27], partitions with time-lagged elements [25], and the inclusion of amplitude information about the time series elements [26]. Naturally, the constraints we have discussed here do not hold for these generalized algorithms.…”
Section: Methodsmentioning
confidence: 99%
“…If the EEG signals are generated by fully random processes, all symbols are equally probable and the PE is maximum, P E = ln(D!). Additional diagnostic tools were proposed by Masoller et al 3 , which are based in the transition probabilities (TPs) between consecutive symbols defined from nonoverlapping data values. The transition probability from pattern π a to pattern π b is the relative number of times pattern π a is followed by pattern π b , in the sequence s(t):…”
Section: Methodsmentioning
confidence: 99%
“…It allows to classify different types of behaviors [20,21], to detect dynamical changes [22][23][24], etc. (see [25,26] for many examples).…”
Section: Introductionmentioning
confidence: 99%