Hubbry Logo
search
logo
Recurrence plot avatar
Recurrence plot
Recurrence plot
current hub
R

Recurrence plot

logo
Community Hub0 Subscribers
Read side by side
Recurrence plot
View on Wikipedia
from Wikipedia

In descriptive statistics and chaos theory, a recurrence plot (RP) is a plot showing, for each moment in time, the times at which the state of a dynamical system returns to the previous state at , i.e., when the phase space trajectory visits roughly the same area in the phase space as at time . In other words, it is a plot of

showing on a horizontal axis and on a vertical axis, where is the state of the system (or its phase space trajectory).

Background

[edit]

Natural processes can have a distinct recurrent behaviour, e.g. periodicities (as seasonal or Milankovich cycles), but also irregular cyclicities (as El Niño Southern Oscillation, heart beat intervals). Moreover, the recurrence of states, in the meaning that states are again arbitrarily close after some time of divergence, is a fundamental property of deterministic dynamical systems and is typical for nonlinear or chaotic systems (cf. Poincaré recurrence theorem). The recurrence of states in nature has been known for a long time and has also been discussed in early work (e.g. Henri Poincaré 1890).

Detailed description

[edit]

One way to visualize the recurring nature of states by their trajectory through a phase space is the recurrence plot, introduced by Eckmann et al. (1987).[1] Often, the phase space does not have a low enough dimension (two or three) to be pictured, since higher-dimensional phase spaces can only be visualized by projection into the two or three-dimensional sub-spaces. One frequently used tool to study the behaviour of such phase space trajectories is then the Poincaré map. Another tool is the recurrence plot, which enables us to investigate many aspects of the m-dimensional phase space trajectory through a two-dimensional representation.

At a recurrence the trajectory returns to a location (state) in phase space it has visited before up to a small error . The recurrence plot represents the collection of pairs of times of such recurrences, i.e., the set of with , with and discrete points of time and the state of the system at time (location of the trajectory at time ). Mathematically, this is expressed by the binary recurrence matrix

where is a norm and the recurrence threshold. An alternative, more formal expression is using the Heaviside step function with the norm of distance vector between and . Alternative recurrence definitions consider different distances , e.g., angular distance, fuzzy distance, or edit distance.[2]

The recurrence plot visualises with coloured (mostly black) dot at coordinates if , with time at the - and -axes.

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

where is the time series (with and the sampling time), the embedding dimension and the time delay. However, phase space reconstruction is not essential part of the recurrence plot (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 visual appearance of a recurrence plot gives hints about the dynamics of the system. Caused by characteristic behaviour of the phase space trajectory, a recurrence plot contains typical small-scale structures, as single dots, diagonal lines and vertical/horizontal lines (or a mixture of the latter, which combines to extended clusters). The large-scale structure, also called texture, can be visually characterised by homogenous, periodic, drift or disrupted. For example, the plot can show if the trajectory is strictly periodic with period , then all such pairs of times will be separated by a multiple of and visible as diagonal lines.

Typical examples of recurrence plots (top row: time series (plotted over time); bottom row: corresponding recurrence plots). From left to right: uncorrelated stochastic data (white noise), harmonic oscillation with two frequencies, chaotic data (logistic map) with linear trend, and data from an auto-regressive process.

The small-scale structures in recurrence plots contain information about certain characteristics of the dynamics of the underlying system. For example, the length of the diagonal lines visible in the recurrence plot are related to the divergence of phase space trajectories, thus, can represent information about the chaoticity.[3] Therefore, the recurrence quantification analysis quantifies the distribution of these small-scale structures.[4][5][6] This quantification can be used to describe the recurrence plots in a quantitative way. Applications are classification, predictions, nonlinear parameter estimation, and transition analysis. In contrast to the heuristic approach of the recurrence quantification analysis, which depends on the choice of the embedding parameters, some dynamical invariants as correlation dimension, K2 entropy or mutual information, which are independent on the embedding, can also be derived from recurrence plots. The base for these dynamical invariants are the recurrence rate and the distribution of the lengths of the diagonal lines.[3] More recent applications use recurrence plots as a tool for time series imaging in machine learning approaches and studying spatio-temporal recurrences.[2]

Close returns plots are similar to recurrence plots. The difference is that the relative time between recurrences is used for the -axis (instead of absolute time).[6]

The main advantage of recurrence plots is that they provide useful information even for short and non-stationary data, where other methods fail.

Extensions

[edit]

Multivariate extensions of recurrence plots were developed as cross recurrence plots and joint recurrence plots.

Cross recurrence plots consider the phase space trajectories of two different systems in the same phase space:[7]

The dimension of both systems must be the same, but the number of considered states (i.e. data length) can be different. Cross recurrence plots compare the occurrences of similar states of two systems. They can be used in order to analyse the similarity of the dynamical evolution between two different systems, to look for similar matching patterns in two systems, or to study the time-relationship of two similar systems, whose time-scale differ.[8]

Joint recurrence plots are the Hadamard product of the recurrence plots of the considered sub-systems,[9] e.g. for two systems and the joint recurrence plot is

In contrast to cross recurrence plots, joint recurrence plots compare the simultaneous occurrence of recurrences in two (or more) systems. Moreover, the dimension of the considered phase spaces can be different, but the number of the considered states has to be the same for all the sub-systems. Joint recurrence plots can be used in order to detect phase synchronisation.

Example

[edit]
Recurrence plot of the Southern Oscillation index.

See also

[edit]

References

[edit]
[edit]
Revisions and contributorsEdit on WikipediaRead on Wikipedia

Recurrence plot

View on Grokipedia
from Grokipedia
A recurrence plot (RP) is a visualization tool for analyzing the recurrent behavior of states in the phase space trajectory of a dynamical system, represented as a binary matrix where entries indicate when states at different times are sufficiently close within a predefined distance threshold.[1] Introduced by Jean-Pierre Eckmann, Sylvie Oliffson Kamphorst, and David Ruelle in 1987, it serves as a graphical method to detect periodicities, structural changes, and the time constancy of dynamical systems from time series data.[1] Recurrence plots display characteristic patterns that reflect the underlying dynamics, including diagonal lines signifying parallel evolutions of states (indicative of determinism), vertical and horizontal lines denoting laminar states where the system remains close to a previous state for an extended period, and scattered points or clusters revealing periodic, quasi-periodic, or chaotic behaviors.[2] These visual structures arise from the fundamental property of recurrence in dynamical systems, first conceptualized by Henri Poincaré in 1890, and enable qualitative assessment of system complexity without assuming stationarity or linearity.[2] To enable quantitative analysis, recurrence quantification analysis (RQA) extends RPs by measuring features such as the recurrence rate (proportion of recurrent points), determinism (fraction of points forming diagonal lines), average diagonal line length (indicating predictability), and entropy (assessing complexity of line lengths).[2] Originating in physics, RPs have been applied across diverse fields, including physiology for heart rate variability analysis, neuroscience for EEG synchronization studies, earth sciences for climate transition detection, engineering for fault identification in structures, and economics for market regime shifts.[2] Advances in computational tools have further expanded their utility to noisy, short, or non-stationary data, making them a versatile method for investigating nonlinear dynamics in complex systems.[2]

Fundamentals

Definition and Purpose

A recurrence plot (RP) is a graphical representation of the recurrences in a dynamical system, depicted as a binary matrix where the axes correspond to time indices, and dots mark instances when the system's states in phase space are sufficiently close to one another within a predefined threshold distance.[3][2] Formally, for a trajectory xi\mathbf{x}_i in the reconstructed phase space, the matrix element Ri,j=Θ(ε−∥xi−xj∥)R_{i,j} = \Theta(\varepsilon - \|\mathbf{x}_i - \mathbf{x}_j\|) is 1 (plotted as a dot) if the distance between states xi\mathbf{x}_i and xj\mathbf{x}_j is less than ε\varepsilon, and 0 otherwise, with Θ\Theta denoting the Heaviside step function.[2] This visualization highlights the recurrent nature of the system's evolution, transforming a one-dimensional time series into a two-dimensional plot that reveals temporal correlations not apparent in the raw data.[3] The primary purpose of a recurrence plot is to detect and quantify recurrent behavior in deterministic dynamical systems, thereby uncovering hidden patterns such as periodicity, quasi-periodicity, chaos, or abrupt structural changes that remain obscured in the original time series.[3][2] By exploiting the fundamental property of recurrence in phase space—where trajectories periodically revisit similar regions—RPs provide a means to assess the time constancy of systems and identify deviations from assumed autonomy, offering insights into predictability, complexity, and synchronization.[3][2] To construct an RP, the phase space must first be reconstructed from a scalar time series using time delay embedding, where a vector xi=(xi,xi+τ,…,xi+(m−1)τ)\mathbf{x}_i = (x_i, x_{i+\tau}, \dots, x_{i+(m-1)\tau}) is formed with embedding dimension mm and delay τ\tau, enabling the analysis of higher-dimensional dynamics from limited observations.[2] This approach is justified by Takens' theorem, which ensures that such an embedding preserves the topological structure of the original attractor under appropriate conditions.[2] Key advantages of RPs include their non-parametric formulation, which imposes no prior assumptions on the underlying dynamics, making them suitable for a broad range of systems.[2] They are particularly effective for short or noisy datasets, as they remain robust with suitable threshold selection, and excel at visualizing non-stationarities like trends or disruptions that indicate regime shifts.[2]

Historical Development

Recurrence plots were first introduced by J.-P. Eckmann, S. O. Kamphorst, and D. Ruelle in 1987 as a graphical tool to visualize recurrences in the phase space trajectories of dynamical systems.[1] This method emerged from the need to study the time constancy and recurrent behavior in chaotic attractors, extending earlier concepts in nonlinear dynamics such as Poincaré sections—which capture intersections of trajectories with a hypersurface—and return maps that analyze successive returns to those sections.[4] The original motivation was to provide a simple yet powerful visualization for identifying periodicities, structural changes, and non-stationarities in complex systems without requiring extensive computational resources at the time.[5] During the 1990s, recurrence plots saw increased adoption for practical analyses, particularly in noise reduction techniques for time series data and tests for determinism in dynamical systems. Researchers like J. P. Zbilut and C. L. Webber Jr. advanced the field by developing initial quantification methods in 1992, enabling the extraction of embedding dimensions and time delays from recurrence structures to assess nonlinear determinism.[6] These developments built on the visual diagnostic capabilities of recurrence plots, allowing for the identification of deterministic versus stochastic components in noisy signals, which proved valuable in fields like physiology and engineering.[7] A significant milestone occurred in 2002 when N. Marwan, M. C. Romano, M. Thiel, and J. Kurths extended recurrence quantification analysis (RQA) by introducing additional measures such as laminarity and recurrence entropy, further enhancing the systematic framework for deriving quantitative measures from recurrence plots.[8] This quantification approach formalized the study of recurrence structures, facilitating comparisons across systems and applications in diverse domains. In the 2010s, the evolution of recurrence plots integrated with advanced computational tools to handle larger datasets, exemplified by the release of the pyRQA Python package in 2018, which leverages OpenCL for massively parallel recurrence quantification analysis on time series exceeding one million points.[9] Early efforts in GPU acceleration, dating back to 2010 implementations for efficient plot computation, paved the way for expansions to big data processing in the post-2020 era, enabling scalable analyses of complex, high-dimensional systems through parallel computing frameworks.[10]

Construction and Computation

Basic Algorithm

The construction of a standard recurrence plot begins with phase space reconstruction of the observed time series $ x(t) $, which allows the embedding of the one-dimensional data into a higher-dimensional space to approximate the system's dynamics. According to Takens' embedding theorem, a suitable reconstruction can be achieved by forming delay coordinate vectors $ \mathbf{x}(i) = (x(i), x(i + \tau), \dots, x(i + (d-1)\tau)) $ for $ i = 1, \dots, N $, where $ \tau $ is the time delay, $ d $ is the embedding dimension, and $ N $ is the length of the time series minus the embedding window size. This yields a trajectory matrix $ \mathbf{X} = [\mathbf{x}(i)]_{i=1}^N $, representing the reconstructed state space trajectory.[11] Next, the recurrence matrix $ \mathbf{R} $ is computed as a binary $ N \times N $ matrix, where each entry indicates whether two states are sufficiently close. Specifically, $ R_{i,j} = \Theta(\epsilon - |\mathbf{x}(i) - \mathbf{x}(j)|) $, with $ \Theta(\cdot) $ denoting the Heaviside step function (equal to 1 if the argument is non-negative and 0 otherwise), $ \epsilon > 0 $ as the recurrence threshold, and $ |\cdot| $ as a distance norm, typically the Euclidean norm. This formulation identifies recurrences when the distance between states $ \mathbf{x}(i) $ and $ \mathbf{x}(j) $ falls below $ \epsilon $, capturing instances where the system's trajectory revisits similar regions in phase space.[11] The recurrence plot is then visualized by representing the matrix $ \mathbf{R} $ in a two-dimensional grid, where the axes correspond to time indices $ i $ and $ j $ (both ranging from 1 to $ N $), and points where $ R_{i,j} = 1 $ are marked as black dots against a white background, while $ R_{i,j} = 0 $ remains unmarked. This graphical representation highlights the temporal structure of recurrences in the dynamics.[11] Computationally, the finite length $ N $ of the time series limits the resolution of the plot, as the matrix size grows quadratically with $ N $, potentially requiring efficient algorithms for large datasets to avoid excessive memory and processing demands. Additionally, selecting an appropriate embedding dimension $ d $ is crucial for accurate reconstruction; the false nearest neighbors method addresses this by iteratively increasing $ d $ and identifying "false" neighbors—pairs of points that are close in lower dimensions but separate in higher ones due to projection effects—until the fraction of such false neighbors drops below a threshold, indicating sufficient embedding.[11]

Parameter Selection

The selection of parameters in the construction of recurrence plots (RPs) is essential to ensure an accurate reconstruction of the phase space and to reveal meaningful dynamical structures without introducing artifacts. Key parameters include the embedding dimension dd, the time delay τ\tau, the threshold ϵ\epsilon, and the Theiler window ww. These choices depend on the underlying system's dimensionality, noise characteristics, and data length, with established methods providing systematic guidance for optimization. The embedding dimension dd determines the dimensionality of the reconstructed phase space and must be sufficiently high to unfold the attractor without projections. A common approach is the false nearest neighbors (FNN) method, which iteratively increases dd and identifies points that are neighbors in lower dimensions but separate in higher ones due to projections; the optimal dd is reached when the fraction of false neighbors drops below a threshold, typically 1-5%. Alternatively, correlation dimension estimation can inform dd, with a rule of thumb d≥2D2+1d \geq 2D_2 + 1, where D2D_2 is the correlation dimension. For low-dimensional systems, such as chaotic attractors, dd values between 3 and 10 are often sufficient, balancing computational feasibility and reconstruction fidelity. The time delay τ\tau governs the spacing between coordinates in the embedding vector, influencing how the trajectory is sampled in phase space. Overly small τ\tau leads to correlated coordinates and redundant information, while large τ\tau causes under-sampling and loss of dynamics. The average mutual information (AMI) function is widely used to select τ\tau, computing the mutual information between the time series and its delayed version; the first minimum of the AMI curve indicates the optimal τ\tau that maximizes independence while preserving structure. This method outperforms simple autocorrelation, as it accounts for nonlinear dependencies. The threshold ϵ\epsilon defines the neighborhood size for recurrence detection, directly affecting the plot's density and the balance between capturing true recurrences and avoiding spurious ones. Fixed ϵ\epsilon is typically set to 2-10% of the maximum phase space diameter, ensuring it does not exceed 10% to preserve fine structures, and aiming for a recurrence rate (RR) of 1-5% for reliable statistics without overcrowding. Adaptive methods, such as fixed-amount-of-nearest-neighbors (FAN) or fixed recurrence density (e.g., 1-2%), adjust ϵ\epsilon dynamically to maintain consistent sparsity across varying data scales. In noisy environments, ϵ\epsilon should exceed five times the noise standard deviation (σ\sigma) to suppress artifacts from observational errors. The Theiler window ww corrects for temporal correlations in the time series by excluding points within ww time steps from being considered recurrent, preventing trivial diagonal lines from tangential motion. It is often set to the autocorrelation time of the signal or (d−1)τ(d-1)\tau, with values ranging from 1 to 10 times the autocorrelation time providing robustness against short-term dependencies. This parameter enhances the detection of non-trivial recurrences, particularly in systems with periodic components. Sensitivity analysis evaluates how variations in these parameters alter RP texture, such as diagonal line length or white noise patterns, guiding practical choices. For clean data, stricter parameters (smaller ϵ\epsilon, minimal ww) preserve fine structures, while noisy data requires relaxation (larger ϵ>5σ\epsilon > 5\sigma, extended ww) to filter distortions and maintain interpretability; testing multiple values and monitoring metrics like RR ensures robustness. Rules of thumb include starting with FNN/AMI for dd and τ\tau, then tuning ϵ\epsilon for target RR, and verifying via surrogate data comparisons.

Properties and Interpretation

Visual Features

Recurrence plots reveal characteristic visual patterns that provide qualitative insights into the underlying dynamics of a system, allowing for the diagnosis of behaviors such as determinism, periodicity, chaos, and intermittency. These patterns emerge from the arrangement of recurrent points in the plot and are influenced by the choice of embedding dimension and threshold parameter during construction. Diagonal lines in a recurrence plot signify periods of similar evolutionary behavior between states at different times, indicating deterministic dynamics where nearby trajectories in phase space remain close for extended durations. Long, uninterrupted diagonal lines reflect stable, predictable evolution, often associated with periodic or quasi-periodic systems, while parallel diagonals spaced at regular intervals highlight the presence of periodic orbits. Shorter or interrupted diagonals suggest less stable dynamics, such as chaotic regimes where trajectories diverge more rapidly. Vertical and horizontal lines represent laminar states, where one or more state variables change slowly or remain nearly constant over time, pointing to phases of stability or trapping in the system's attractor. These lines are particularly prominent in systems exhibiting intermittency, alternating between laminar and chaotic phases, and their frequency can indicate transitions between different chaotic regimes or slow-fast dynamics in variables. Isolated points or small clusters of recurrent points indicate rare, short-lived recurrences or strong fluctuations, often suggestive of stochastic influences or noisy processes where states do not persist predictably. A predominance of such isolated features across the plot implies irregular, uncorrelated behavior, while localized clusters may highlight intermittent events or non-stationarities at specific times. White bands, appearing as gaps devoid of recurrent points, denote abrupt changes or divergences in the system's state, such as explosive growth, bifurcations, or shifts to rarely visited regions of phase space. These voids are diagnostic of non-stationary transitions, where the system's attractor structure alters significantly, leading to prolonged non-recurrence. The overall texture of a recurrence plot offers a global view of system complexity: a homogeneous distribution of points suggests stationary chaotic dynamics with uniform recurrence probabilities, whereas block-like or structured patterns indicate quasi-periodic or synchronized behaviors with distinct recurrent episodes. Disrupted or patchy textures further emphasize intermittency or the influence of external perturbations on the system's evolution.

Quantitative Measures

Recurrence quantification analysis (RQA) provides a set of quantitative measures derived from the recurrence plot (RP) matrix to characterize the underlying dynamics of a system objectively, beyond visual inspection. Developed initially by Zbilut and Webber in 1992,[12] RQA extracts metrics from the distribution of recurrent points and structural patterns in the RP, such as diagonal and vertical lines, enabling the assessment of determinism, complexity, and intermittency in time series data. These measures are computed using histograms of line lengths, where $ P(l) $ denotes the histogram of diagonal line lengths $ l $, and similar distributions for vertical structures, typically with a minimum line length threshold to filter noise.[11] The recurrence rate (RR) quantifies the density of recurrent states in the RP, defined as the fraction of points where the trajectory returns close to a previous state within the threshold $ \epsilon $:
RR=1N2∑i,j=1NRi,j RR = \frac{1}{N^2} \sum_{i,j=1}^N R_{i,j}
Here, $ N $ is the number of embedded points, and $ R_{i,j} = 1 $ if the distance between states $ i $ and $ j $ is less than $ \epsilon $, otherwise 0. RR serves as a basic indicator of the system's overall recurrence density, influenced by the embedding dimension and threshold parameters.[11] Determinism (DET) measures the proportion of recurrent points that lie on diagonal lines in the RP, reflecting the predictability and deterministic nature of the dynamics:
DET=∑l=lmin⁡Nl⋅P(l)∑l=1Nl⋅P(l) DET = \frac{\sum_{l=l_{\min}}^N l \cdot P(l)}{\sum_{l=1}^N l \cdot P(l)}
where $ l_{\min} $ is the minimum diagonal line length considered, and $ P(l) $ is the frequency distribution of these lengths. High DET values indicate periodic or quasi-periodic behavior, while low values suggest chaotic or stochastic processes. This measure, introduced in the foundational RQA framework, helps distinguish ordered from disordered systems.[12][11] Laminarity (LAM) and trapping time (TT) focus on vertical structures in the RP, which represent periods of slow motion or intermittency where the system remains in similar states. LAM is the fraction of recurrent points forming vertical lines:
LAM=∑v=vmin⁡Nv⋅P(v)∑v=1Nv⋅P(v) LAM = \frac{\sum_{v=v_{\min}}^N v \cdot P(v)}{\sum_{v=1}^N v \cdot P(v)}
with $ P(v) $ as the histogram of vertical line lengths $ v $ and $ v_{\min} $ the minimum length threshold. TT, the average duration of these vertical lines, is given by:
TT=∑v=vmin⁡Nv⋅P(v)∑v=vmin⁡NP(v) TT = \frac{\sum_{v=v_{\min}}^N v \cdot P(v)}{\sum_{v=v_{\min}}^N P(v)}
These measures, extended in subsequent RQA developments, quantify intermittent behavior, such as laminar phases in turbulent flows or pauses in physiological signals.[11] Entropy (ENT) assesses the complexity of the deterministic structures via the Shannon entropy of the diagonal line length distribution:
ENT=−∑l=lmin⁡Np(l)ln⁡p(l) ENT = -\sum_{l=l_{\min}}^N p(l) \ln p(l)
where $ p(l) = P(l) / \sum_{l=l_{\min}}^N P(l) $ is the normalized probability. Higher ENT values signify more uniform line length distributions, indicating greater structural complexity in the recurrence patterns.[12][11] Additional RQA measures include the recurrence period density entropy, which evaluates the entropy associated with the distribution of recurrence periods to probe periodicity and related complexities, and transitivity, which quantifies the interconnectedness of recurrent states across the RP. Both are computed from extensions of the line length histograms and have been integrated into advanced RQA toolboxes for broader dynamical analysis.[11]

Applications

In Nonlinear Dynamics

Recurrence plots serve as a key tool in nonlinear dynamics for detecting chaotic behavior by visualizing recurrences in phase space, where the presence of long, uninterrupted diagonal lines indicates deterministic structures typical of chaos, while isolated points or short, scattered diagonals suggest stochastic noise. This distinction arises because chaotic trajectories revisit neighborhoods in a structured yet irregular manner, unlike purely random processes that lack such patterns. Indirectly, recurrence plots aid in estimating Lyapunov exponents by identifying unstable periodic orbits through localized recurrences, which reflect the exponential divergence rates in chaotic systems. In bifurcation analysis, recurrence plots reveal transitions in nonlinear systems, such as routes to chaos via period-doubling, manifested as evolving textures in the plot where periodic regimes show equally spaced, parallel diagonal bands that fragment and multiply with each doubling, eventually dissolving into a complex, homogeneous structure indicative of chaos. Recurrence quantification analysis metrics, like determinism and mean diagonal line length, exhibit maxima at these bifurcation points, quantifying the shift from ordered to disordered dynamics. For coupled nonlinear systems, recurrence plots detect synchronization types: phase synchronization appears as aligned periodic structures in joint recurrence representations, while generalized synchronization is identified through shared recurrence patterns that transcend simple phase locking, often quantified by joint recurrence probabilities approaching unity in drive-response setups. These features enable differentiation between coherent phase alignment and more functional, nonlinear dependencies in chaotic oscillators. Recurrence quantification analysis links directly to invariant measures of chaotic attractors, with metrics such as the distribution of diagonal line lengths providing estimates of the correlation dimension, which quantifies the fractal geometry of the attractor, and the entropy of these lengths yielding approximations of the Kolmogorov-Sinai entropy, capturing the rate of information production in the system. In paradigmatic chaotic attractors like the Lorenz and Rössler systems, recurrence plots facilitate dimensionality reduction by highlighting recurrent structures that embed the high-dimensional dynamics into lower-dimensional visualizations, revealing scaling behaviors in line distributions that correspond to the attractor's intrinsic geometry without requiring full phase space reconstruction.

In Signal Processing and Other Fields

Recurrence plots (RPs) have found practical utility in signal processing for noise reduction, where they enable optimization of parameters for filtering techniques that preserve underlying dynamics. One approach uses RPs to select the neighborhood size for local projective noise reduction, which projects noisy points onto local linear approximations of the attractor using neighboring states in phase space, effectively denoising nonlinear time series without assuming linearity.[13] In medical signal analysis, RPs facilitate anomaly detection by highlighting deviations from periodic patterns in physiological time series. For electrocardiogram (ECG) signals, RP textures reveal structural changes indicative of arrhythmias, enabling classification of normal beats versus irregular events like ventricular fibrillation.[14] Similarly, in electroencephalogram (EEG) data, RPs detect epileptic seizures through alterations in recurrence patterns, where pre-seizure states show increased determinism and post-seizure transitions exhibit fragmented structures, supporting automated identification with high accuracy.[15] Applications in climate and geophysics leverage RPs to identify regime shifts in environmental time series, capturing abrupt transitions in complex systems. In paleoclimate proxy records, such as temperature or precipitation series, RPs quantify changes in recurrence rates to detect shifts like the Plio-Pleistocene transition, where increased laminarity signals stable regimes and disruptions mark tipping points. For seismic data, RPs characterize ground motion dynamics by analyzing recurrence structures, distinguishing between stochastic noise and deterministic precursors to earthquakes through measures like determinism and entropy.[16][17][18] In economics, RPs analyze transitions in stock market volatility by visualizing recurrences in financial time series, revealing shifts from low- to high-volatility regimes. Recurrence quantification measures, such as determinism and laminarity derived from RPs, detect endogenous crashes through patterns of increasing recurrence rates preceding market downturns, as observed in global indices during events like the 2008 financial crisis. This allows differentiation between internal dynamic instabilities and external shocks based on RP line structures.[19][20] Interdisciplinary uses extend RPs to genomics for detecting periodicity in DNA sequences, where nucleotide mappings to phase space produce RPs that highlight repetitive motifs and structural homologies, aiding in mutation identification and evolutionary analysis. In psychology, RPs examine behavioral recurrence in time series of actions or cognitive states, quantifying patterns of stability and change in group interactions or individual decision-making through cross-recurrence plots that reveal synchronization or divergence.[21][22] Recent advances as of 2025 have integrated RPs with deep learning for enhanced analysis in fields like neuroimaging and molecular simulations.[23][24]

Extensions and Variants

Cross Recurrence Plots

Cross recurrence plots (CRPs) represent a bivariate extension of recurrence plots, enabling the comparison of phase space trajectories from two distinct dynamical systems or time series, denoted as X=(xi)i=1N\mathbf{X} = (\mathbf{x}_i)_{i=1}^N and Y=(yj)j=1M\mathbf{Y} = (\mathbf{y}_j)_{j=1}^M. The CRP is defined by the recurrence matrix
Ri,jX,Y=Θ(ϵ−∥xi−yj∥), R_{i,j}^{X,Y} = \Theta(\epsilon - \|\mathbf{x}_i - \mathbf{y}_j\|),
where Θ\Theta is the Heaviside step function, ϵ>0\epsilon > 0 is a threshold distance, and ∥⋅∥\|\cdot\| denotes a suitable norm (e.g., Euclidean). This formulation identifies pairs of states (i,j)(i, j) where the states xi\mathbf{x}_i and yj\mathbf{y}_j are sufficiently close in phase space, visualized as a binary N×MN \times M matrix with black dots indicating recurrences. To construct a CRP, each time series undergoes separate phase space reconstruction via time-delay embedding, yielding vectors xi=(xi,xi+τ,…,xi+(m−1)τ)\mathbf{x}_i = (x_{i}, x_{i+\tau}, \dots, x_{i+(m-1)\tau}) and similarly for yj\mathbf{y}_j, where mm is the embedding dimension and τ\tau is the time delay. A joint distance matrix is then computed between all pairs of embedded points, with recurrences marked where distances fall below ϵ\epsilon. The threshold ϵ\epsilon can be fixed or adapted via a fixed amount of nearest neighbors to ensure a constant recurrence rate (e.g., 10–20%), and normalization of the series components is often applied to handle differing scales. This process allows CRPs to reveal structural similarities or divergences without assuming stationarity or specific underlying dynamics. In interpretation, CRPs exhibit asymmetry unless the systems are identical, with the main diagonal line of synchronization (LOS) potentially bowed or shifted, indicating time scale differences or directional coupling between the systems. For instance, a leading role of system Y over X is suggested by more recurrences above the diagonal, quantified via lag-dependent measures such as the asymmetry index q(τ)=(RR+(τ)−RR−(τ))/2q(\tau) = (RR_{+}(\tau) - RR_{-}(\tau))/2, where RR±(τ)RR_{\pm}(\tau) are recurrence rates for positive and negative lags τ\tau. Key quantitative measures include the cross-recurrence rate (RR), which estimates the probability of shared states, and cross-determinism (DET), the fraction of recurrence points forming diagonal lines longer than a minimum length lmin⁡l_{\min}, providing a proxy for synchronization strength and predictability in the coupling. These features enable detection of nonlinear interdependencies, such as phase synchronization in coupled oscillators. A primary advantage of CRPs lies in their ability to uncover nonlinear dependencies and directional influences that linear correlation methods, like Pearson's coefficient, fail to capture, especially in noisy or non-stationary data. This makes CRPs particularly suited for analyzing synchronization in complex systems, such as climate proxies or physiological signals, where traditional metrics may yield misleading results due to underlying nonlinearities.

Higher-Dimensional and Multivariate Variants

Higher-dimensional recurrence plots extend the standard recurrence plot framework to phase spaces with dimensionality d>3d > 3, where the recurrence matrix is defined as $ R_{i,j} = \Theta(\varepsilon - |\mathbf{x}_i - \mathbf{x}_j|) $ with xi∈Rd\mathbf{x}_i \in \mathbb{R}^d, allowing direct visualization of recurrences without additional embedding for observed high-dimensional data such as multivariate time series from physical systems. This approach reveals structural features like diagonal lines indicating parallel trajectories and isolated points highlighting transient behaviors, but visualization challenges arise due to the inability to project higher-dimensional matrices into 2D or 3D plots without loss of information, often necessitating quantitative measures over graphical inspection. For long time series in high dimensions, windowed recurrence plots segment the data into overlapping subsets to manage computational demands while preserving local dynamical information. Joint recurrence plots (JRPs) address multivariate systems by analyzing multiple time series simultaneously, constructing individual recurrence matrices $ R_{i,j}^{(k)} = \Theta(\varepsilon_k - |\mathbf{x}i^{(k)} - \mathbf{x}j^{(k)}|) $ for each component k=1,…,nk = 1, \dots, n, then combining them via a logical AND operation: $ \text{JR}{i,j} = \bigwedge{k=1}^n R_{i,j}^{(k)} $, or through a joint distance metric in the full phase space. This variant detects interdependencies and synchronization among subsystems, such as phase synchronization in coupled oscillators, where co-occurring recurrences signal aligned dynamics across variables. Alternatively, joint distance-based JRPs define recurrences using a single threshold on the multivariate norm $ |\mathbf{x}_i - \mathbf{x}_j| $, enabling quantification of generalized synchronization via measures like joint recurrence rate. Multidimensional extensions, such as spatial recurrence plots, adapt the framework for spatio-temporal data by incorporating spatial coordinates into the phase space, forming a recurrence matrix that captures both temporal recurrences and spatial correlations, often visualized as hyper-surfaces in higher dimensions. For complex spatio-temporal datasets like video sequences, tensor-based recurrence plots represent the data as multi-way arrays (tensors), where recurrences are computed across temporal, spatial, and feature dimensions, facilitating analysis of patterns in fields such as fluid dynamics or climate modeling. These methods preserve the multi-scale structure of the data, allowing separation of dynamical components at different resolutions. A primary challenge in higher-dimensional and multivariate recurrence plots is the computational complexity, scaling as O(N2)O(N^2) for NN data points due to pairwise distance calculations, which becomes prohibitive for large or high-dimensional datasets. This is mitigated by exploiting the sparsity of recurrence matrices—typically containing fewer than 10% non-zero entries—through sparse matrix storage and algorithms that compute only recurrent points, reducing memory and time requirements by orders of magnitude. Noise sensitivity and threshold selection further complicate analysis, as small perturbations can alter recurrence structures in high dimensions, necessitating robust parameter optimization techniques.

Examples and Case Studies

Synthetic Time Series

Recurrence plots (RPs) of synthetic time series serve as pedagogical tools to illustrate core patterns in dynamical systems, highlighting how embedding parameters influence visualization. For a periodic signal such as a sine wave generated by $ x(t) = \sin(2\pi t / T) $ with period $ T = 50 $ time steps, the RP exhibits perfect, uninterrupted diagonal lines spaced vertically by the period length, reflecting the deterministic recurrence of states without deviations.[2] These lines appear as sharp, parallel black stripes on a white background when parameters are set to embedding dimension $ m = 3 $, time delay $ \tau = 1 $, and threshold $ \epsilon = 0.1\sigma $ (where $ \sigma $ is the standard deviation of the signal), producing a highly structured image akin to a striped pattern that directly encodes the periodicity.[2] In contrast, a chaotic synthetic time series from the logistic map defined by $ x_{n+1} = r x_n (1 - x_n) $ with parameter $ r = 4 $ and initial condition $ x_0 = 0.1 $ yields an RP characterized by a homogeneous texture punctuated by short, irregularly oriented diagonal segments, indicative of the system's sensitivity to initial conditions and lack of long-term predictability.[2] Using the same embedding parameters ($ m = 3 $, $ \tau = 1 $, $ \epsilon = 0.1\sigma $), the resulting plot displays scattered black points forming brief diagonal lines rarely exceeding a few points in length, interspersed with isolated recurrences, creating a textured appearance without the ordered spacing seen in periodic cases.[2] To demonstrate robustness to perturbations, consider a noisy periodic signal obtained by adding Gaussian white noise with signal-to-noise ratio (SNR) of 10 dB to the aforementioned sine wave. The RP for this series shows disrupted diagonal lines with interruptions and fading segments due to noise-induced state deviations, alongside increased isolated points, underscoring the sensitivity of RP structures to the threshold parameter $ \epsilon $.[2] With $ m = 3 $, $ \tau = 1 $, and $ \epsilon = 5\sigma $ (adjusted higher to preserve underlying structure amid noise), the plot retains faint, broken diagonals spaced by the original period but with a salt-and-pepper texture from spurious recurrences, illustrating how larger $ \epsilon $ mitigates noise effects at the cost of detail resolution.[2]

Real-World Applications

Recurrence plots have been applied to physiological time series, particularly heart rate variability (HRV) signals, to detect transitions to atrial fibrillation (AF). In one study, recurrence quantification analysis (RQA) of HRV revealed structural changes in recurrence patterns, such as increased determinism and laminarity, prior to paroxysmal AF episodes, enabling predictive classification with high accuracy on clinical datasets. Another approach combined recurrence plots with deep learning models like ResNet to forecast AF onset from ECG-derived HRV, achieving superior performance over traditional methods by capturing nonlinear recurrences in pre-AF segments.[25][26] In environmental time series, recurrence plots analyze solar activity data to identify cycle irregularities. For sunspot numbers and solar irradiance records spanning multiple cycles, recurrence plots highlighted intermittent chaotic behaviors and deviations from periodic patterns, with RQA measures like trapping time indicating unstable phases during solar minima. This approach quantified dynamical complexity in solar wind parameters, revealing recurrent structures that correlate with geomagnetic disturbances and aid in forecasting cycle anomalies.[27][28] Engineering applications utilize recurrence plots for fault detection in machinery vibration signals. Analysis of ball bearing vibrations demonstrated that fault-induced changes in laminarity and determinism from RQA effectively distinguished healthy from defective states, even under noisy conditions, with recurrence plots visualizing periodic impulses from inner/outer race defects. Similar techniques applied to induction motor vibrations identified fault progression through shifts in recurrence structure, supporting real-time monitoring in industrial settings.[29][30] Recurrence plots provide early warnings for tipping points in climate data, such as Pacific sea surface temperature (SST) series. A 2015 analysis of ENSO-related Pacific SST anomalies used recurrence-based climate networks to detect stability changes preceding El Niño transitions, with network measures signaling increased vulnerability to abrupt shifts. These findings underscore RP's role in identifying precursors to regime changes in complex environmental systems.[31] In practice, recurrence plots face challenges with non-stationary data, where shifting dynamics can distort recurrence structures and inflate measures like recurrence rate. Short data lengths exacerbate this, leading to unreliable RQA quantifiers due to insufficient sampling of the phase space, necessitating adaptive embedding or windowed analysis for robust application.[32][33]

References

  1. Recurrence Plots of Dynamical Systems - IOPscience
  2. [PDF] Recurrence plots for the analysis of complex systems
  3. [PDF] Recurrence Plots of Dynamical Systems
  4. Recurrence plots for the analysis of complex systems - ScienceDirect
  5. Recurrence Plots of Dynamical Systems | Semantic Scholar
  6. Embeddings and delays as derived from quantification of recurrence ...
  7. Detecting determinism using recurrence quantification analysis
  8. Recurrence-plot-based measures of complexity and their application ...
  9. PyRQA—Conducting recurrence quantification analysis on very long ...
  10. [PDF] USING GPU TO IMPROVE PERFORMANCE OF CALCULATING ...
  11. https://doi.org/10.1016/j.physrep.2006.11.001
  12. [PDF] Optimizing of recurrence plots for noise reduction
  13. ECG Recurrence Plot-Based Arrhythmia Classification Using Two ...
  14. Analysis of epileptic seizures based on EEG using recurrence plot ...
  15. Characterization of regime shifts in environmental time series with ...
  16. Nonlinear time series analysis of palaeoclimate proxy records
  17. Characterization of ground motions using recurrence plots
  18. Recurrence measures and transitions in stock market dynamics
  19. Using recurrence plot analysis to distinguish between endogenous ...
  20. (PDF) Recurrence plot analysis of DNA sequences - ResearchGate
  21. Analyzing Multivariate Dynamics Using Cross-Recurrence ...
  22. Structures of the Recurrence Plot of Heart Rate Variability Signal as ...
  23. Atrial Fibrillation Prediction Based on Recurrence Plot and ResNet
  24. [PDF] Recurrence plots of sunspots, solar flux and irradiance - arXiv
  25. Recurrence‐Based Quantification of Dynamical Complexity in the ...
  26. Ball Bearing Fault Diagnosis Using Recurrence Analysis - PMC - NIH
  27. Fault Diagnosis of Induction Motors Using Recurrence Quantification ...
  28. Climate network stability measures of El Niño variability | Chaos
  29. RECURRENCE PLOTS::Pitfalls
  30. Non-stationary assessment of structural operational measurements ...
User Avatar
No comments yet.