Recurrence quantification analysis

Recurrence quantification analysis (RQA) is a method of nonlinear data analysis (cf. chaos theory) for the investigation of dynamical systems. It quantifies the number and duration of recurrences of a dynamical system presented by its phase space trajectory.[1]

## Contents

* 1 Background
* 2 RQA measures
* 3 Time-dependent RQA
* 4 Example
* 5 See also
* 6 References
* 7 External links

## Background

The recurrence quantification analysis (RQA) was developed in order to quantify differently appearing recurrence plots (RPs), based on the small-scale structures therein.[2] Recurrence plots are tools which visualise the recurrence behaviour of the phase space trajectory x→(i) of dynamical systems:[3]

R(i,j)=Θ(ε−‖x→(i)−x→(j)‖),

where Θ:𝐑->{0,1} is the Heaviside function and ε a predefined tolerance.

Recurrence plots mostly contain single dots and lines which are parallel to the mean diagonal (line of identity, LOI) or which are vertical/horizontal. Lines parallel to the LOI are referred to as diagonal lines and the vertical structures as vertical lines. Because an RP is usually symmetric, horizontal and vertical lines correspond to each other, and, hence, only vertical lines are considered. The lines correspond to a typical behaviour of the phase space trajectory: whereas the diagonal lines represent such segments of the phase space trajectory which run parallel for some time, the vertical lines represent segments which remain in the same phase space region for some time.[1]

If only a univariate time series u(t) is available, the phase space can be reconstructed by using a time delay embedding (see Takens' theorem):

x→(i)=(u(i),u(i+τ),…,u(i+τ(m−1)),

where u(i) is the time series (with t=iΔt and Δt the sampling time), m the embedding dimension, and τ the time delay. However, pPhase space reconstruction is not essential part of the RQA (although often stated in literature), because it is based on phase space trajectories which could be derived from the system's variables directly (e.g., from the three variables of the Lorenz system) or from multivariate data.

The RQA quantifies the small-scale structures of recurrence plots, which present the number and duration of the recurrences of a dynamical system. The measures introduced for the RQA were developed heuristically between 1992 and 2002.[4][5][6] They are actually measures of complexity. The main advantage of the RQA is that it can provide useful information even for short and non-stationary data, where other methods fail.

RQA can be applied to almost every kind of data. It is widely used in physiology, but was also successfully applied on problems from engineering, chemistry, Earth sciences etc.[2] Further extensions and variations of measures for quantifying recurrence properties have been proposed to address specific research questions. RQA measures are also combined with machine learning approaches for classification tasks.[7]

## RQA measures

The simplest measure is the recurrence rate, which is the density of recurrence points in a recurrence plot:[1]

RR=1N2∑i,j=1NR(i,j).

The recurrence rate corresponds with the probability that a specific state will recur. It is almost equal with the definition of the correlation sum, where the LOI is excluded from the computation.

The next measure is the percentage of recurrence points which form diagonal lines in the recurrence plot of minimal length ℓmin:[5]

DET=∑ℓ=ℓminNℓP(ℓ)∑ℓ=1NℓP(ℓ),

where P(ℓ) is the frequency distribution of the lengths ℓ of the diagonal lines (i.e., it counts how many instances have length ℓ). This measure is called determinism and is related with the predictability of the dynamical system, because white noise has a recurrence plot with almost only single dots and very few diagonal lines, whereas a deterministic process has a recurrence plot with very few single dots but many long diagonal lines.

The number of recurrence points which form vertical lines can be quantified in the same way:[6]

LAM=∑v=vminNvP(v)∑v=1NvP(v),

where P(v) is the frequency distribution of the lengths v of the vertical lines, which have at least a length of vmin. This measure is called laminarity and is related with the amount of laminar phases in the system (intermittency).

The lengths of the diagonal and vertical lines can be measured as well. The averaged diagonal line length[5]

L=∑ℓ=ℓminNℓP(ℓ)∑ℓ=ℓminNP(ℓ)

is related with the predictability time of the dynamical system and the trapping time, measuring the average length of the vertical lines,[6]

TT=∑v=vminNvP(v)∑v=vminNP(v)

is related with the laminarity time of the dynamical system, i.e. how long the system remains in a specific state.[6]

Because the length of the diagonal lines is related on the time how long segments of the phase space trajectory run parallel, i.e. on the divergence behaviour of the trajectories, it was sometimes stated that the reciprocal of the maximal length of the diagonal lines (without LOI) would be an estimator for the positive maximal Lyapunov exponent of the dynamical system. Therefore, the maximal diagonal line length Lmax or the divergence:[1]

DIV=1Lmax

are also measures of the RQA. However, the relationship between these measures with the positive maximal Lyapunov exponent is not as easy as stated, but even more complex (to calculate the Lyapunov exponent from an RP, the whole frequency distribution of the diagonal lines has to be considered). The divergence can have the trend of the positive maximal Lyapunov exponent, but not more. Moreover, also RPs of white noise processes can have a really long diagonal line, although very seldom, just by a finite probability. Therefore, the divergence cannot reflect the maximal Lyapunov exponent.

The probability p(ℓ) that a diagonal line has exactly length ℓ can be estimated from the frequency distribution P(ℓ) with p(ℓ)=P(ℓ)∑ℓ=lminNP(ℓ). The Shannon entropy of this probability,[5]

ENTR=−∑ℓ=ℓminNp(ℓ)ln⁡p(ℓ),

reflects the complexity of the deterministic structure in the system. However, this entropy depends sensitively on the bin number and, thus, may differ for different realisations of the same process, as well as for different data preparations.

The last measure of the RQA quantifies the thinning-out of the recurrence plot. The trend is the regression coefficient of a linear relationship between the density of recurrence points in a line parallel to the LOI and its distance to the LOI. More exactly, consider the recurrence rate in a diagonal line parallel to LOI of distance k (diagonal-wise recurrence rate or τ-recurrence rate):[1]

RRk=1N−k∑j−i=kN−kR(i,j),

then the trend is defined by[5]

TREND=∑i=1N~(i−N~/2)(RRi−⟨RRi⟩)∑i=1N~(i−N~/2)2,

with ⟨⋅⟩ as the average value and N~<N. This latter relation should ensure to avoid the edge effects of too low recurrence point densities in the edges of the recurrence plot. The measure trend provides information about the stationarity of the system.

Similar to the τ-recurrence rate, the other measures based on the diagonal lines (DET, L, ENTR) can be defined diagonal-wise. These definitions are useful to study interrelations or synchronisation between different systems (using recurrence plots or cross recurrence plots).[8]

## Time-dependent RQA

Instead of computing the RQA measures of the entire recurrence plot, they can be computed in small windows moving over the recurrence plot along the LOI. This provides time-dependent RQA measures which allow detecting, e.g., chaos-chaos transitions.[9][1] Note: the choice of the size of the window can strongly influence the measure trend.

## Example

Bifurcation diagram for the Logistic map. RQA measures of the logistic map for various setting of the control parameter a. The measures RR and DET exhibit maxima at chaos-order/ order-chaos transitions. The measure DIV has a similar trend as the maximal Lyapunov exponent (but it is not the same!). The measure LAM has maxima at chaos-chaos transitions (laminar phases, intermittency).

## See also

* Recurrence plot, a powerful visualisation tool of recurrences in dynamical (and other) systems.
* Recurrence period density entropy, an information-theoretic method for summarising the recurrence properties of both deterministic and stochastic dynamical systems.
* Approximate entropy

## References

1. ↑ 1.0 1.1 1.2 1.3 1.4 1.5 N. Marwan; M. C. Romano; M. Thiel; J. Kurths (2007). "Recurrence Plots for the Analysis of Complex Systems". Physics Reports 438 (5–6): 237. doi:10.1016/j.physrep.2006.11.001. Bibcode: 2007PhR...438..237M.
2. ↑ 2.0 2.1 N. Marwan (2008). "A historical review of recurrence plots". European Physical Journal ST 164 (1): 3–12. doi:10.1140/epjst/e2008-00829-1. Bibcode: 2008EPJST.164....3M. https://zenodo.org/record/996840.
3. ↑ J. P. Eckmann, S. O. Kamphorst, D. Ruelle (1987). "Recurrence Plots of Dynamical Systems". Europhysics Letters 5 (9): 973–977. doi:10.1209/0295-5075/4/9/004. Bibcode: 1987EL......4..973E.
4. ↑ J. P. Zbilut; C. L. Webber (1992). "Embeddings and delays as derived from quantification of recurrence plots". Physics Letters A 171 (3–4): 199–203. doi:10.1016/0375-9601(92)90426-M. Bibcode: 1992PhLA..171..199Z.
5. ↑ 5.0 5.1 5.2 5.3 5.4 C. L. Webber; J. P. Zbilut (1994). "Dynamical assessment of physiological systems and states using recurrence plot strategies". Journal of Applied Physiology 76 (2): 965–973. doi:10.1152/jappl.1994.76.2.965. PMID 8175612.
6. ↑ 6.0 6.1 6.2 6.3 N. Marwan; N. Wessel; U. Meyerfeldt; A. Schirdewan; J. Kurths (2002). "Recurrence Plot Based Measures of Complexity and its Application to Heart Rate Variability Data". Physical Review E 66 (2). doi:10.1103/PhysRevE.66.026702. PMID 12241313. Bibcode: 2002PhRvE..66b6702M. https://arxiv.org/pdf/physics/0201064.
7. ↑ N. Marwan; K. H. Kraemer (2023). "Trends in recurrence analysis of dynamical systems". European Physical Journal – Special Topics 232: 5–27. doi:10.1140/epjs/s11734-022-00739-8. Bibcode: 2023EPJST.232....5M. https://arxiv.org/pdf/2409.04110.
8. ↑ Marwan, N., Kurths, J. (2002). "Nonlinear analysis of bivariate data with cross recurrence plots". Physics Letters A 302 (5–6): 299–307. doi:10.1016/S0375-9601(02)01170-2. Bibcode: 2002PhLA..302..299M.
9. ↑ L. L. Trulla; A. Giuliani; J. P. Zbilut; C. L. Webber, Jr. (1996). "Recurrence quantification analysis of the logistic equation with transients". Physics Letters A 223 (4): 255–260. doi:10.1016/S0375-9601(96)00741-4.

## External links

* http://www.recurrence-plot.tk/

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Recurrence quantification analysis. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Recurrence_quantification_analysis&oldid=3982085"