1996
DOI: 10.1016/s0375-9601(96)00741-4
|View full text |Cite
|
Sign up to set email alerts
|

Recurrence quantification analysis of the logistic equation with transients

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

10
299
0
4

Year Published

2002
2002
2014
2014

Publication Types

Select...
8
1
1

Relationship

0
10

Authors

Journals

citations
Cited by 408 publications
(313 citation statements)
references
References 10 publications
10
299
0
4
Order By: Relevance
“…This method was performed for the measurement of the complexity of the time series in a symmetrical K-dimensional square matrix, which is calculated by computing the Euclidean distances of each vector Xi from all the others (Trulla et al, 1996) The vectors represent the RR interval time series as a trajectory in m dimensional space. The recurrence plot (RP) is the representation of the matrix as a black (for ones) and white (for zeros) image (Niskanen et al, 2004) in which L max is the longest diagonal line segment in a continuous row within the plot.…”
Section: Methods Of Measurement and Analysis Of Hr And Hrv In Dairy Cmentioning
confidence: 99%
“…This method was performed for the measurement of the complexity of the time series in a symmetrical K-dimensional square matrix, which is calculated by computing the Euclidean distances of each vector Xi from all the others (Trulla et al, 1996) The vectors represent the RR interval time series as a trajectory in m dimensional space. The recurrence plot (RP) is the representation of the matrix as a black (for ones) and white (for zeros) image (Niskanen et al, 2004) in which L max is the longest diagonal line segment in a continuous row within the plot.…”
Section: Methods Of Measurement and Analysis Of Hr And Hrv In Dairy Cmentioning
confidence: 99%
“…Studying the DVV from this perspective helps to understand why the DVV does not give the expected results when applied to oscillatory short time series. The computation of the DVV only takes into account the distance between random DVs (vertical black dots) and misses important information about the possible structures that can be used to detect chaos-order 19 and chaos-chaos 20 transitions: diagonal black lines and vertical white lines, 1 respectively. Examples of parameters derived from these structures are how much time the trajectories run parallel paths in the phase space representation (the DET parameter in Table I), complexity measured as the entropy of the black diagonals or the entropy of the vertical white lines (the ENTR or the ENTRWL parameters in Table I), etc.…”
Section: From Dvv To Delay Vector Recurrence Quantification Analmentioning
confidence: 99%
“…One of the main advantages of the RP is that they allow the E-dimensional phase-space trajectory to be investigated through a binary two-dimensional representation of the recurrences of the states. Additionally, the quantification of the number and duration of the recurrences allows us to study the degree of predictability [16] as well as some other characteristics of the underlying dynamic systems: laminar phases [17], unstable periodic orbits [18], etc.…”
Section: Recurrence Plotsmentioning
confidence: 99%