Elsevier

Physics Letters A

Volume 373, Issue 46, 9 November 2009, Pages 4246-4254
Physics Letters A

Complex network approach for recurrence analysis of time series

https://doi.org/10.1016/j.physleta.2009.09.042Get rights and content

Abstract

We propose a novel approach for analysing time series using complex network theory. We identify the recurrence matrix (calculated from time series) with the adjacency matrix of a complex network and apply measures for the characterisation of complex networks to this recurrence matrix. By using the logistic map, we illustrate the potential of these complex network measures for the detection of dynamical transitions. Finally, we apply the proposed approach to a marine palaeo-climate record and identify the subtle changes to the climate regime.

Introduction

In many scientific disciplines, such as engineering, astrophysics, life sciences and economics, modern data analysis techniques are becoming increasingly popular as a means of understanding the underlying complex dynamics of the system. Methods for estimating fractal or correlation dimensions, Lyapunov exponents, and mutual information have been widely used [1], [2], [3], [4]. However most of these methods require long data series and in particular their uncritical application, especially to real-world data, may often lead to pitfalls.

In the last two decades, the method of recurrence plots has been developed as another approach to describe complex dynamics [5]. A recurrence plot (RP) is the graphical representation of a binary symmetric square matrix which encodes the times when two states are in close proximity (i.e. neighbours in phase space). Based on such a recurrence matrix, a large and diverse amount of information on the dynamics of the system can be extracted and statistically quantified (using recurrence quantification analysis, dynamical invariants, etc.). Meanwhile this technique has been the subject of much interest from various disciplines [6] and it has been successfully applied to a number of areas: the detection of dynamical transitions [7], [8] and synchronisation [9], the study of protein structures [10], [11] and in cardiac and bone health conditions [12], [13], in ecological regimes [14], [15], economical dynamics [16], [17], in chemical reactions [18] and to monitor mechanical behaviour and damages in engineering [19], [20], to name a few. It is important to emphasise that recurrence plot based techniques are even useful for the analysis of short and non-stationary data, which often presents a critical issue when studying real world data. The last few years have witnessed great progress in the development of RP-based approaches for the analysis of complex systems [5], [21], [22], [23], [24].

During the last decade, complex networks have become rather popular for the analysis of complex and, in particular, spatially extended systems [25], [26], [27], [28]. Local and global properties (statistical measures) of complex networks are helpful to understand complex interrelations and information flow between different components in extended systems, such as social, computer or neural networks [25], food webs, transportation networks, power grids [29], or even in the global climate system [30]. The basis of complex network analysis is the adjacency matrix, representing the links between the nodes of the network. Like the recurrence matrix, the adjacency matrix is also square, binary, and symmetric (in the case of an unweighted and undirected network).

In fact, the recurrence matrix and the adjacency matrix exhibit a strong analogy: a recurrence matrix represents neighbours in phase space and an adjacency matrix represents links in a network; both matrices embody a pair-wise test of all components (phase space vectors resp. nodes). Therefore, we might well proceed to explore further analogies even in the statistical analysis of both the recurrence and the adjacency matrix.

Quantitative descriptors of RPs have been first introduced in a heuristic way in order to distinguish different appearances of RPs [6]. We may also consider to apply measures of complex network theory to a RP in order to quantify the RP's structure and the corresponding topology of the underlying phase space trajectory. In this (more heuristic) sense, it is actually not necessary to consider the phase space trajectory as a network.

Recently, the very first steps in the direction of bridging complex network theory and recurrence analysis have been reported [31], [32]. In these works, the local properties of phase space trajectories have been studied using complex network measures. Zhang et al. suggested using cycles of the phase space trajectory as nodes and considering a link when two cycles are rather similar [32], [33]. The resulting adjacency matrix can be in fact interpreted as a special recurrence matrix. The recurrence criterion here is the matching of two cycles. A complementary approach was suggested by Xu et al. who studied the structural shape of the direct neighbourhood of the phase space trajectory by a motif classification [31]. The adjacency matrix of the underlying network corresponds to the recurrence matrix, using the recurrence criterion of a fixed number of neighbours (instead of the more often used fixed size of the neighbourhood [5]).

Other approaches for the study of time series by a complex network analysis suggested using linear correlations [34] or another certain condition on the time series amplitudes (“visibility”) [35].

In this Letter, we demonstrate that the recurrence matrix (analogously to [31]) can be considered as the adjacency matrix of an undirected, unweighted network, allowing us to study time series using a complex network approach. This ansatz on creating complex network is more natural and simple than the various suggested approaches [33], [34], [35]. Complex network statistics is helpful to characterise the local and global properties of a network. We propose using these complex network measures for a quantitative description of recurrence matrices. By applying these measures, we obtain additional information from the recurrence plots, which can be used for characterising the dynamics of the underlying process. We give an interpretation of this approach in the context of the dynamics of a phase space trajectory. Nevertheless, many of these measures neither have an analogue in traditional RQA nor in nonlinear time series analysis in a wider sense, and hence, open up new perspectives for the quantitative analysis of dynamical systems. We illustrate our approach with a prototypical model system and a real-world example from the Earth sciences.

Section snippets

Recurrence plots and complex networks

A recurrence plot is a representation of recurrent states of a dynamical system in its m-dimensional phase space. It is a pair-wise test of all phase space vectors xi (i=1,,N, xRm) among each other, whether or not they are close:Ri,j=Θ(εd(xi,xj)), with Θ() being the Heaviside function and ε a threshold for proximity [5]. The closeness d(xi,xj) can be measured in different ways, by using, e.g., spatial distance, string metric, or local rank order [5], [36]. Mostly, a spatial distance

Application to logistic map

We illustrate the potential of the proposed approach by an analysis of the logistic mapxi+1=axi(1xi), especially within the interesting range of the control parameter a[3.5,4] with a step size of Δa=0.0005. In the analysed range of a, various dynamic regimes and transitions between them can be found, e.g., accumulation points, periodic and chaotic states, band merging points, period doublings, inner and outer crises [41], [42], [43]. This system has been used to illustrate the capabilities of

Application to marine dust record

Long-term variations in aeolian dust deposits are related to changes in terrestrial vegetation and are often used as a proxy for changing climate regimes in the past. For example, marine terrigenous dust records can be used to infer epochs of arid continental climate. In particular, a marine record from the Ocean Drilling Programme (ODP) derived from a drilling in the Atlantic, ODP site 659, was used to infer changes in African climate during the last 4.5 Ma (Fig. 5A) [45]. This time series has

Conclusions

We have linked the recurrence matrix with the adjacency matrix of a complex network, and have proposed the direct application of the corresponding network measures to the recurrence matrix. We have discussed the link density, degree centrality, average path length and clustering coefficient in some detail. In particular, the latter two complex network measures have no direct counterpart in recurrence quantification analysis and give additional insights into the recurrence structure of dynamical

Acknowledgements

This work was partly supported by the German Research Foundation (DFG) project He 2789/8-2, SFB 555 project C1, and the Japanese Ministry for Science and Education.

References (55)

  • J. Kurths et al.

    Physica D

    (1987)
  • A. Wolf et al.

    Physica D

    (1985)
  • N. Marwan et al.

    Phys. Rep.

    (2007)
  • L.L. Trulla et al.

    Phys. Lett. A

    (1996)
  • N. Marwan et al.

    Phys. Lett. A

    (2007)
  • A. Facchini et al.

    Ecol. Model.

    (2007)
  • R. Proulx et al.

    Ecol. Complex.

    (2009)
  • N. Bigdeli et al.

    Physica A

    (2009)
  • H. Castellini et al.

    Physica A

    (2004)
  • J.M. Nichols et al.

    Mech. Sys. Signal Proc.

    (2006)
  • A.K. Sen et al.

    Mech. Syst. Signal Proc.

    (2008)
  • M. Thiel et al.

    Phys. Lett. A

    (2004)
  • N. Marwan et al.

    Phys. Lett. A

    (2005)
  • S. Boccaletti et al.

    Phys. Rep.

    (2006)
  • A. Arenas et al.

    Phys. Rep.

    (2008)
  • J. Zhang et al.

    Physica D

    (2008)
  • Y. Yang et al.

    Physica A

    (2008)
  • E.M. Oblow

    Phys. Lett. A

    (1988)
  • R. Wackerbauer et al.

    Chaos Solitons Fractals

    (1994)
  • M.H. Trauth et al.

    Quaternary Sci. Rev.

    (2009)
  • S. Schinkel et al.

    Phys. Lett. A

    (2009)
  • B.J. West et al.

    Phys. Rep.

    (2008)
  • H. Kantz et al.
    (1997)
  • B.B. Mandelbrot

    The Fractal Geometry of Nature

    (1982)
  • N. Marwan

    Eur. Phys. J. Special Topics

    (2008)
  • E.J. Ngamga et al.

    Phys. Rev. E

    (2007)
  • M.C. Romano et al.

    Europhys. Lett.

    (2005)
  • Cited by (514)

    • Phase space visibility graph

      2023, Chaos, Solitons and Fractals
    View all citing articles on Scopus
    View full text