Recurrence plot

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

Contents

• Background
• Detailed description
• Extensions
• Example
• See also
• References
• External links

${\displaystyle {\vec {x}}(i)\approx {\vec {x}}(j),}$

showing ${\displaystyle i}$ on a horizontal axis and ${\displaystyle j}$ on a vertical axis, where ${\displaystyle {\vec {x}}}$ is the state of the system (or its phase space trajectory).

Background

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

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 ${\displaystyle \varepsilon }$ . The recurrence plot represents the collection of pairs of times of such recurrences, i.e., the set of ${\displaystyle (i,j)}$ with ${\displaystyle {\vec {x}}(i)\approx {\vec {x}}(j)}$, with ${\displaystyle i}$ and ${\displaystyle j}$ discrete points of time and ${\displaystyle {\vec {x}}(i)}$ the state of the system at time ${\displaystyle i}$ (location of the trajectory at time ${\displaystyle i}$). Mathematically, this is expressed by the binary recurrence matrix

${\displaystyle R(i,j)={\begin{cases}1&{\text{if}}\quad \|{\vec {x}}(i)-{\vec {x}}(j)\|\leq \varepsilon \\0&{\text{otherwise}},\end{cases}}}$

where ${\displaystyle \|\cdot \|}$ is a norm and ${\displaystyle \varepsilon }$ the recurrence threshold. An alternative, more formal expression is using the Heaviside step function ${\displaystyle R(i,j)=\Theta (\varepsilon -D_{i,j})}$ with ${\displaystyle D_{i,j}=\|{\vec {x}}(i)-{\vec {x}}(j)\|}$ the norm of distance vector between ${\displaystyle {\vec {x}}(i)}$ and ${\displaystyle {\vec {x}}(j)}$. Alternative recurrence definitions consider different distances ${\displaystyle D_{i,j}}$, e.g., angular distance, fuzzy distance, or edit distance ^[2] .

The recurrence plot visualises ${\displaystyle \mathbf {R} }$ with coloured (mostly black) dot at coordinates ${\displaystyle (i,j)}$ if ${\displaystyle R(i,j)=1}$, with time at the ${\displaystyle x}$- and ${\displaystyle y}$-axes.

If only a time series ${\displaystyle u(i)}$ is available, the phase space can be reconstructed, e.g., by using a time delay embedding (see Takens' theorem):

${\displaystyle {\vec {x}}(i)=(u(i),u(i+\tau ),\ldots ,u(i+\tau (m-1)),}$

where ${\displaystyle u(i)}$ is the time series, ${\displaystyle m}$ the embedding dimension and ${\displaystyle \tau }$ the time delay. 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).

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 ${\displaystyle T}$, then all such pairs of times will be separated by a multiple of ${\displaystyle T}$ and visible as diagonal lines.

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 ${\displaystyle y}$-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

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] :

${\displaystyle \mathbf {CR} (i,j)=\Theta (\varepsilon -\|{\vec {x}}(i)-{\vec {y}}(j)\|),\quad {\vec {x}}(i),\,{\vec {y}}(i)\in \mathbb {R} ^{m},\quad i=1,\dots ,N_{x},\ j=1,\dots ,N_{y}.}$

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 ${\displaystyle {\vec {x}}}$ and ${\displaystyle {\vec {y}}}$ the joint recurrence plot is

${\displaystyle \mathbf {JR} (i,j)=\Theta (\varepsilon _{x}-\|{\vec {x}}(i)-{\vec {x}}(j)\|)\cdot \Theta (\varepsilon _{y}-\|{\vec {y}}(i)-{\vec {y}}(j)\|),\quad {\vec {x}}(i)\in \mathbb {R} ^{m},\quad {\vec {y}}(i)\in \mathbb {R} ^{n},\quad i,j=1,\dots ,N_{x,y}.}$

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

See also

• Poincaré plot
• Recurrence period density entropy, an information-theoretic method for summarising the recurrence properties of both deterministic and stochastic dynamical systems.
• Recurrence quantification analysis, a heuristic approach to quantify recurrence plots.
• Self-similarity matrix
• Dot plot (bioinformatics)

This article includes a list of general references, but it lacks sufficient corresponding inline citations . Please help to improve this article by introducing more precise citations.(December 2009) ( Learn how and when to remove this message )

Related Research Articles

In mathematical physics and mathematics, the Pauli matrices are a set of three 2 × 2 complex matrices that are traceless, Hermitian, involutory and unitary. Usually indicated by the Greek letter sigma, they are occasionally denoted by tau when used in connection with isospin symmetries.

In algebra, the dual numbers are a hypercomplex number system first introduced in the 19th century. They are expressions of the form a + bε, where a and b are real numbers, and ε is a symbol taken to satisfy with .

In mathematics, a quadric or quadric surface (quadric hypersurface in higher dimensions), is a generalization of conic sections (ellipses, parabolas, and hyperbolas). It is a hypersurface (of dimension D) in a (D + 1)-dimensional space, and it is defined as the zero set of an irreducible polynomial of degree two in D + 1 variables; for example, D = 1 in the case of conic sections. When the defining polynomial is not absolutely irreducible, the zero set is generally not considered a quadric, although it is often called a degenerate quadric or a reducible quadric.

Noether's theorem states that every continuous symmetry of the action of a physical system with conservative forces has a corresponding conservation law. This is the first of two theorems proven by mathematician Emmy Noether in 1915 and published in 1918. The action of a physical system is the integral over time of a Lagrangian function, from which the system's behavior can be determined by the principle of least action. This theorem only applies to continuous and smooth symmetries of physical space.

In mathematics, the Lyapunov exponent or Lyapunov characteristic exponent of a dynamical system is a quantity that characterizes the rate of separation of infinitesimally close trajectories. Quantitatively, two trajectories in phase space with initial separation vector diverge at a rate given by

In continuum mechanics, the infinitesimal strain theory is a mathematical approach to the description of the deformation of a solid body in which the displacements of the material particles are assumed to be much smaller than any relevant dimension of the body; so that its geometry and the constitutive properties of the material at each point of space can be assumed to be unchanged by the deformation.

In mathematics and classical mechanics, the Poisson bracket is an important binary operation in Hamiltonian mechanics, playing a central role in Hamilton's equations of motion, which govern the time evolution of a Hamiltonian dynamical system. The Poisson bracket also distinguishes a certain class of coordinate transformations, called canonical transformations, which map canonical coordinate systems into canonical coordinate systems. A "canonical coordinate system" consists of canonical position and momentum variables that satisfy canonical Poisson bracket relations. The set of possible canonical transformations is always very rich. For instance, it is often possible to choose the Hamiltonian itself as one of the new canonical momentum coordinates.

The path integral formulation is a description in quantum mechanics that generalizes the stationary action principle of classical mechanics. It replaces the classical notion of a single, unique classical trajectory for a system with a sum, or functional integral, over an infinity of quantum-mechanically possible trajectories to compute a quantum amplitude.

In quantum mechanics and quantum field theory, the propagator is a function that specifies the probability amplitude for a particle to travel from one place to another in a given period of time, or to travel with a certain energy and momentum. In Feynman diagrams, which serve to calculate the rate of collisions in quantum field theory, virtual particles contribute their propagator to the rate of the scattering event described by the respective diagram. Propagators may also be viewed as the inverse of the wave operator appropriate to the particle, and are, therefore, often called (causal) Green's functions.

In chaos theory, the correlation dimension is a measure of the dimensionality of the space occupied by a set of random points, often referred to as a type of fractal dimension.

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

In mathematics, more specifically in dynamical systems, the method of averaging exploits systems containing time-scales separation: a fast oscillationversus a slow drift. It suggests that we perform an averaging over a given amount of time in order to iron out the fast oscillations and observe the qualitative behavior from the resulting dynamics. The approximated solution holds under finite time inversely proportional to the parameter denoting the slow time scale. It turns out to be a customary problem where there exists the trade off between how good is the approximated solution balanced by how much time it holds to be close to the original solution.

In chaos theory, the correlation sum is the estimator of the correlation integral, which reflects the mean probability that the states at two different times are close:

In chaos theory, the correlation integral is the mean probability that the states at two different times are close:

Recurrence period density entropy (RPDE) is a method, in the fields of dynamical systems, stochastic processes, and time series analysis, for determining the periodicity, or repetitiveness of a signal.

In mathematics, the slow manifold of an equilibrium point of a dynamical system occurs as the most common example of a center manifold. One of the main methods of simplifying dynamical systems, is to reduce the dimension of the system to that of the slow manifold—center manifold theory rigorously justifies the modelling. For example, some global and regional models of the atmosphere or oceans resolve the so-called quasi-geostrophic flow dynamics on the slow manifold of the atmosphere/oceanic dynamics, and is thus crucial to forecasting with a climate model.

In the theory of dynamical systems, the shadowing lemma is a lemma describing the behaviour of pseudo-orbits near a hyperbolic invariant set. Informally, the theory states that every pseudo-orbit stays uniformly close to some true trajectory —in other words, a pseudo-trajectory is "shadowed" by a true one. This suggests that numerical solutions can be trusted to represent the orbits of the dynamical system. However, caution should be exercised as some shadowing trajectories may not always be physically realizable.

Biology Monte Carlo methods (BioMOCA) have been developed at the University of Illinois at Urbana-Champaign to simulate ion transport in an electrolyte environment through ion channels or nano-pores embedded in membranes. It is a 3-D particle-based Monte Carlo simulator for analyzing and studying the ion transport problem in ion channel systems or similar nanopores in wet/biological environments. The system simulated consists of a protein forming an ion channel (or an artificial nanopores like a Carbon Nano Tube, CNT), with a membrane (i.e. lipid bilayer) that separates two ion baths on either side. BioMOCA is based on two methodologies, namely the Boltzmann transport Monte Carlo (BTMC) and particle-particle-particle-mesh (P³M). The first one uses Monte Carlo method to solve the Boltzmann equation, while the later splits the electrostatic forces into short-range and long-range components.

The Harrow–Hassidim–Lloyd algorithm or HHL algorithm is a quantum algorithm for numerically solving a system of linear equations, designed by Aram Harrow, Avinatan Hassidim, and Seth Lloyd. The algorithm estimates the result of a scalar measurement on the solution vector to a given linear system of equations.

The Fradkin tensor, or Jauch-Hill-Fradkin tensor, named after Josef-Maria Jauch and Edward Lee Hill and David M. Fradkin, is a conservation law used in the treatment of the isotropic multidimensional harmonic oscillator in classical mechanics. For the treatment of the quantum harmonic oscillator in quantum mechanics, it is replaced by the tensor-valued Fradkin operator.

References

External links

• Recurrence Plot