<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=Recurrence_quantification_analysis</id>
	<title>Recurrence quantification analysis - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=Recurrence_quantification_analysis"/>
	<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=Recurrence_quantification_analysis&amp;action=history"/>
	<updated>2026-05-04T19:15:36Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.1</generator>
	<entry>
		<id>http://debianws.lexgopc.com/wiki143/index.php?title=Recurrence_quantification_analysis&amp;diff=1567416&amp;oldid=prev</id>
		<title>imported&gt;OAbot: Open access bot: arxiv updated in citation with #oabot.</title>
		<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=Recurrence_quantification_analysis&amp;diff=1567416&amp;oldid=prev"/>
		<updated>2025-02-03T03:15:18Z</updated>

		<summary type="html">&lt;p&gt;&lt;a href=&quot;https://en.wikipedia.org/wiki/OABOT&quot; class=&quot;extiw&quot; title=&quot;wikipedia:OABOT&quot;&gt;Open access bot&lt;/a&gt;: arxiv updated in citation with #oabot.&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&amp;#039;&amp;#039;&amp;#039;Recurrence quantification analysis&amp;#039;&amp;#039;&amp;#039; (&amp;#039;&amp;#039;&amp;#039;RQA&amp;#039;&amp;#039;&amp;#039;) 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.&amp;lt;ref name=&amp;quot;marwan2007&amp;quot;&amp;gt;{{cite journal&lt;br /&gt;
    |author1=N. Marwan |author2=M. C. Romano |author3=M. Thiel |author4=J. Kurths | title=Recurrence Plots for the Analysis of Complex Systems&lt;br /&gt;
    | journal=Physics Reports&lt;br /&gt;
    | volume=438&lt;br /&gt;
    | issue=5–6&lt;br /&gt;
    | year=2007&lt;br /&gt;
    | doi=10.1016/j.physrep.2006.11.001&lt;br /&gt;
    | pages=237&lt;br /&gt;
|bibcode = 2007PhR...438..237M | arxiv=2501.13933}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Background==&lt;br /&gt;
The recurrence quantification analysis (RQA) was developed in order to quantify differently appearing [[recurrence plot]]s (RPs), based on the small-scale structures therein.&amp;lt;ref name=&amp;quot;marwan2008&amp;quot;&amp;gt;{{cite journal&lt;br /&gt;
    | author=N. Marwan&lt;br /&gt;
    | title=A historical review of recurrence plots&lt;br /&gt;
    | journal=European Physical Journal ST&lt;br /&gt;
    | volume=164&lt;br /&gt;
    | issue=1&lt;br /&gt;
    | year=2008&lt;br /&gt;
    | pages=3–12&lt;br /&gt;
    | url= https://zenodo.org/record/996840&lt;br /&gt;
    | doi=10.1140/epjst/e2008-00829-1&lt;br /&gt;
    |bibcode = 2008EPJST.164....3M | arxiv=1709.09971&lt;br /&gt;
    | s2cid=119494395&lt;br /&gt;
 }}&amp;lt;/ref&amp;gt; [[Recurrence plot]]s are tools which visualise the recurrence behaviour of the [[phase space]] trajectory &amp;lt;math&amp;gt;\vec{x}(i)&amp;lt;/math&amp;gt; of [[dynamical systems]]:&amp;lt;ref&amp;gt;{{cite journal&lt;br /&gt;
    | author=J. P. Eckmann, S. O. Kamphorst, [[David Ruelle|D. Ruelle]]&lt;br /&gt;
    | title=Recurrence Plots of Dynamical Systems&lt;br /&gt;
    | journal=Europhysics Letters&lt;br /&gt;
    | volume=5&lt;br /&gt;
    | issue=9&lt;br /&gt;
    | pages=973–977&lt;br /&gt;
    | year=1987&lt;br /&gt;
    | doi=10.1209/0295-5075/4/9/004&lt;br /&gt;
    | bibcode=1987EL......4..973E&lt;br /&gt;
    | s2cid=250847435&lt;br /&gt;
}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;{R}(i,j) = \Theta(\varepsilon - \| \vec{x}(i) - \vec{x}(j)\|)&amp;lt;/math&amp;gt;,&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;\Theta: \mathbf{R} \rightarrow \{0, 1\}&amp;lt;/math&amp;gt; is the [[Heaviside function]] and &amp;lt;math&amp;gt;\varepsilon&amp;lt;/math&amp;gt; a predefined tolerance.&lt;br /&gt;
&lt;br /&gt;
Recurrence plots mostly contain single dots and lines which are parallel to the mean diagonal (&amp;#039;&amp;#039;line of identity&amp;#039;&amp;#039;, LOI) or which are vertical/horizontal. Lines parallel to the LOI are referred to as &amp;#039;&amp;#039;diagonal lines&amp;#039;&amp;#039; and the vertical structures as &amp;#039;&amp;#039;vertical lines&amp;#039;&amp;#039;. 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.&amp;lt;ref name=&amp;quot;marwan2007&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
If only a univariate [[time series]] &amp;lt;math&amp;gt;u(t)&amp;lt;/math&amp;gt; is available, the phase space can be reconstructed by using a time delay embedding (see [[Takens&amp;#039; theorem]]):&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\vec{x}(i) = (u(i), u(i+\tau), \ldots, u(i+\tau(m-1)),&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;u(i)&amp;lt;/math&amp;gt; is the time series (with &amp;lt;math&amp;gt;t = i \Delta t&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;\Delta t&amp;lt;/math&amp;gt; the sampling time), &amp;lt;math&amp;gt;m&amp;lt;/math&amp;gt; the embedding dimension, and &amp;lt;math&amp;gt;\tau&amp;lt;/math&amp;gt; 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&amp;#039;s variables directly (e.g., from the three variables of the [[Lorenz system]]) or from multivariate data.&lt;br /&gt;
&lt;br /&gt;
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.&amp;lt;ref name=&amp;quot;zbilut1992&amp;quot;&amp;gt;{{cite journal&lt;br /&gt;
    | author1=J. P. Zbilut | author2=C. L. Webber &lt;br /&gt;
    | title=Embeddings and delays as derived from quantification of recurrence plots&lt;br /&gt;
    | journal=Physics Letters A&lt;br /&gt;
    | volume=171&lt;br /&gt;
    | issue=3–4&lt;br /&gt;
    | year=1992&lt;br /&gt;
    | pages=199–203&lt;br /&gt;
    | doi=10.1016/0375-9601(92)90426-M&lt;br /&gt;
    | bibcode = 1992PhLA..171..199Z&lt;br /&gt;
    | s2cid=122890777&lt;br /&gt;
 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;webber1994&amp;quot;&amp;gt;{{cite journal&lt;br /&gt;
    | author1=C. L. Webber | author2=J. P. Zbilut&lt;br /&gt;
    | title=Dynamical assessment of physiological systems and states using recurrence plot strategies&lt;br /&gt;
    | journal=Journal of Applied Physiology&lt;br /&gt;
    | volume=76&lt;br /&gt;
    | issue=2&lt;br /&gt;
    | year=1994&lt;br /&gt;
    | pages=965–973&lt;br /&gt;
    | doi=10.1152/jappl.1994.76.2.965&lt;br /&gt;
    | pmid=8175612&lt;br /&gt;
 | s2cid=23854540&lt;br /&gt;
 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;marwan2002&amp;quot;&amp;gt;{{cite journal&lt;br /&gt;
    | author1=N. Marwan | author2=N. Wessel | author3=U. Meyerfeldt | author4=A. Schirdewan | author5=J. Kurths&lt;br /&gt;
    | title=Recurrence Plot Based Measures of Complexity and its Application to Heart Rate Variability Data&lt;br /&gt;
    | journal=Physical Review E&lt;br /&gt;
    | volume=66&lt;br /&gt;
    | issue=2&lt;br /&gt;
    | year=2002&lt;br /&gt;
    | pages=026702&lt;br /&gt;
    | url= https://arxiv.org/pdf/physics/0201064&lt;br /&gt;
    | doi=10.1103/PhysRevE.66.026702&lt;br /&gt;
    | arxiv = physics/0201064 &lt;br /&gt;
    | bibcode = 2002PhRvE..66b6702M&lt;br /&gt;
    | pmid=12241313 &lt;br /&gt;
    | s2cid=14803032&lt;br /&gt;
}}&amp;lt;/ref&amp;gt; They are actually [[Complexity|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.&lt;br /&gt;
&lt;br /&gt;
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.&amp;lt;ref name=&amp;quot;marwan2008&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt; &lt;br /&gt;
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.&amp;lt;ref name=&amp;quot;marwan2023&amp;quot;&amp;gt;{{cite journal&lt;br /&gt;
    | author1=N. Marwan | author2=K. H. Kraemer&lt;br /&gt;
    | title=Trends in recurrence analysis of dynamical systems&lt;br /&gt;
    | journal=European Physical Journal – Special Topics&lt;br /&gt;
    | volume=232&lt;br /&gt;
    | year=2023&lt;br /&gt;
    | pages=5–27&lt;br /&gt;
    | url=https://arxiv.org/pdf/2409.04110&lt;br /&gt;
    | doi=10.1140/epjs/s11734-022-00739-8&lt;br /&gt;
    | doi-access=free&lt;br /&gt;
    | arxiv = 2409.04110 &lt;br /&gt;
    | bibcode = 2023EPJST.232....5M &lt;br /&gt;
    | s2cid=255630484&lt;br /&gt;
}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==RQA measures==&lt;br /&gt;
The simplest measure is the &amp;#039;&amp;#039;&amp;#039;recurrence rate&amp;#039;&amp;#039;&amp;#039;, which is the density of recurrence points in a recurrence plot:&amp;lt;ref name=&amp;quot;marwan2007&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt; &lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\text{RR} =  \frac{1}{N^2} \sum_{i,j=1}^N {R}(i,j).&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
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.&lt;br /&gt;
&lt;br /&gt;
The next measure is the percentage of recurrence points which form diagonal lines in the recurrence plot of minimal length &amp;lt;math&amp;gt;\ell_\min&amp;lt;/math&amp;gt;:&amp;lt;ref name=&amp;quot;webber1994&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\text{DET} = \frac{\sum_{\ell=\ell_\min}^N \ell\, P(\ell)}{\sum_{\ell=1}^{N}\ell P(\ell)},&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;P(\ell)&amp;lt;/math&amp;gt; is the [[frequency distribution]] of the lengths &amp;lt;math&amp;gt;\ell&amp;lt;/math&amp;gt; of the diagonal lines (i.e., it counts how many instances have length &amp;lt;math&amp;gt;\ell&amp;lt;/math&amp;gt;). This measure is called &amp;#039;&amp;#039;&amp;#039;determinism&amp;#039;&amp;#039;&amp;#039; 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.&lt;br /&gt;
&lt;br /&gt;
The number of recurrence points which form vertical lines can be quantified in the same way:&amp;lt;ref name=&amp;quot;marwan2002&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt; \text{LAM} = \frac{\sum_{v=v_\min}^{N}vP(v)}{\sum_{v=1}^{N}vP(v)},&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;lt;math&amp;gt;P(v)&amp;lt;/math&amp;gt; is the frequency distribution of the lengths &amp;lt;math&amp;gt;v&amp;lt;/math&amp;gt; of the vertical lines, which have at least a length of &amp;lt;math&amp;gt;v_\min&amp;lt;/math&amp;gt;. This measure is called &amp;#039;&amp;#039;&amp;#039;laminarity&amp;#039;&amp;#039;&amp;#039; and is related with the amount of [[laminar phase]]s in the system ([[intermittency]]).&lt;br /&gt;
&lt;br /&gt;
The lengths of the diagonal and vertical lines can be measured as well. The &amp;#039;&amp;#039;&amp;#039;averaged diagonal line length&amp;#039;&amp;#039;&amp;#039;&amp;lt;ref name=&amp;quot;webber1994&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\text{L} = \frac{\sum_{\ell=\ell_\min}^N \ell\, P(\ell)}{\sum_{\ell=\ell_\min}^N P(\ell)}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
is related with the &amp;#039;&amp;#039;predictability time&amp;#039;&amp;#039; of the dynamical system&lt;br /&gt;
and the &amp;#039;&amp;#039;&amp;#039;trapping time&amp;#039;&amp;#039;&amp;#039;, measuring the average length&lt;br /&gt;
of the vertical lines,&amp;lt;ref name=&amp;quot;marwan2002&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\text{TT} = \frac{\sum_{v=v_\min}^{N} v P(v)} {\sum_{v=v_\min}^{N} P(v)}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
is related with the &amp;#039;&amp;#039;laminarity time&amp;#039;&amp;#039; of the dynamical system, i.e. how long the system remains in a specific state.&amp;lt;ref name=&amp;quot;marwan2002&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
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 [[Multiplicative inverse|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 &amp;#039;&amp;#039;&amp;#039;maximal diagonal line length&amp;#039;&amp;#039;&amp;#039; &amp;lt;math&amp;gt;L_\max&amp;lt;/math&amp;gt; or the &amp;#039;&amp;#039;&amp;#039;divergence&amp;#039;&amp;#039;&amp;#039;:&amp;lt;ref name=&amp;quot;marwan2007&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\text{DIV} = \frac{1}{L_\max}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
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.&lt;br /&gt;
&lt;br /&gt;
The [[probability]] &amp;lt;math&amp;gt;p(\ell)&amp;lt;/math&amp;gt; that a diagonal line has exactly length &amp;lt;math&amp;gt;\ell&amp;lt;/math&amp;gt; can be estimated from the frequency distribution &amp;lt;math&amp;gt;P(\ell)&amp;lt;/math&amp;gt; with &amp;lt;math&amp;gt;p(\ell) = \frac{P(\ell)}{\sum_{\ell=l_\min}^N P(\ell)}&amp;lt;/math&amp;gt;. The [[Shannon entropy]] of this probability,&amp;lt;ref name=&amp;quot;webber1994&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\text{ENTR} = - \sum_{\ell=\ell_\min}^N p(\ell) \ln p(\ell),&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
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.&lt;br /&gt;
&lt;br /&gt;
The last measure of the RQA quantifies the thinning-out of the recurrence plot. The &amp;#039;&amp;#039;&amp;#039;trend&amp;#039;&amp;#039;&amp;#039; 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 &amp;#039;&amp;#039;k&amp;#039;&amp;#039; (&amp;#039;&amp;#039;diagonal-wise recurrence rate&amp;#039;&amp;#039; or &amp;#039;&amp;#039;τ-recurrence rate&amp;#039;&amp;#039;):&amp;lt;ref name=&amp;quot;marwan2007&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\text{RR}_k =  \frac{1}{N-k} \sum_{j-i=k}^{N-k} {R}(i,j),&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
then the trend is defined by&amp;lt;ref name=&amp;quot;webber1994&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\text{TREND} = \frac{\sum_{i=1}^\tilde{N} (i-\tilde{N}/2)(RR_i - \langle RR_i \rangle)}{\sum_{i=1}^\tilde{N} (i-\tilde{N}/2)^2},&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
with &amp;lt;math&amp;gt;\langle \cdot \rangle&amp;lt;/math&amp;gt; as the average value and &amp;lt;math&amp;gt;\tilde{N} &amp;lt; N&amp;lt;/math&amp;gt;. 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 &amp;#039;&amp;#039;trend&amp;#039;&amp;#039; provides information about the stationarity of the system.&lt;br /&gt;
&lt;br /&gt;
Similar to the &amp;lt;math&amp;gt;\tau&amp;lt;/math&amp;gt;-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 plot]]s or [[recurrence plot#Extensions|cross recurrence plots]]).&amp;lt;ref&amp;gt;{{Cite journal| author=Marwan, N., Kurths, J. | year=2002 | title=Nonlinear analysis of bivariate data with cross recurrence plots | journal=Physics Letters A | volume=302 | pages=299–307 | doi=10.1016/S0375-9601(02)01170-2|arxiv = physics/0201061 |bibcode = 2002PhLA..302..299M| issue=5–6 | s2cid=8020903 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Time-dependent RQA==&lt;br /&gt;
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.&amp;lt;ref&amp;gt;{{Cite journal| author1=L. L. Trulla | author2=A. Giuliani | author3=J. P. Zbilut | author4=C. L. Webber, Jr. | year=1996 | title=Recurrence quantification analysis of the logistic equation with transients | journal=Physics Letters A | volume=223 | issue=4 | pages=255–260 | doi=10.1016/S0375-9601(96)00741-4 }}&amp;lt;/ref&amp;gt;&amp;lt;ref name=&amp;quot;marwan2007&amp;quot;&amp;gt;&amp;lt;/ref&amp;gt; &amp;#039;&amp;#039;&amp;#039;Note:&amp;#039;&amp;#039;&amp;#039; the choice of the size of the window can strongly influence the measure &amp;#039;&amp;#039;trend&amp;#039;&amp;#039;.&lt;br /&gt;
&lt;br /&gt;
==Example==&lt;br /&gt;
[[Image:LogisticMap BifurcationDiagram.png|thumb|left|512px|Bifurcation diagram for the Logistic map.]]&lt;br /&gt;
&lt;br /&gt;
[[Image:Logistic map rqa.svg|thumb|left|820px|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 phase]]s, [[intermittency]]).]]&lt;br /&gt;
{{Clear}}&lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
* [[Recurrence plot]], a powerful visualisation tool of recurrences in dynamical (and other) systems.&lt;br /&gt;
* [[Recurrence period density entropy]], an information-theoretic method for summarising the recurrence properties of both deterministic and stochastic dynamical systems.&lt;br /&gt;
*[[Approximate entropy]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
{{reflist}}&lt;br /&gt;
&lt;br /&gt;
==External links==&lt;br /&gt;
* http://www.recurrence-plot.tk/&lt;br /&gt;
&lt;br /&gt;
{{DEFAULTSORT:Recurrence Quantification Analysis}}&lt;br /&gt;
[[Category:Signal processing]]&lt;br /&gt;
[[Category:Dynamical systems]]&lt;br /&gt;
[[Category:Chaos theory]]&lt;br /&gt;
[[Category:Nonlinear time series analysis]]&lt;/div&gt;</summary>
		<author><name>imported&gt;OAbot</name></author>
	</entry>
</feed>