The DOI matches its Crossref record; 87 of the 87 references it cites were found in a registry or an index.
Recurrence networks—a novel paradigm for nonlinear time series analysis
Open accessAbstract
This paper presents a new approach for analysing the structural properties of time series from complex systems. Starting from the concept of recurrences in phase space, the recurrence matrix of a time series is interpreted as the adjacency matrix of an associated complex network, which links different points in time if the considered states are closely neighboured in phase space. In comparison with similar network-based techniques the new approach has important conceptual advantages, and can be considered as a unifying framework for transforming time series into complex networks that also includes other existing methods as special cases. It has been demonstrated here that there are fundamental relationships between many topological properties of recurrence networks and different nontrivial statistical properties of the phase space density of the underlying dynamical system. Hence, this novel interpretation of the recurrence matrix yields new quantitative characteristics (such as average path length, clustering coefficient, or centrality measures of the recurrence network) related to the dynamical complexity of a time series, most of which are not yet provided by other existing methods of nonlinear time series analysis.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Centrality in social networks conceptual clarification
Freeman, L. C. (1978) · Social Networks · doi:10.1016/0378-8733(78)90021-7 · Cited by 17,062
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Detecting strange attractors in turbulence
Takens, F. (1981) · Lecture Notes in Mathematics · doi:10.1007/bfb0091924 · Cited by 10,459 · cited 1×
“, N), one may use a suitable m-dimensional time delay embedding of x(t) with delay τ [11], x(t) = (x(t), x(t+ τ), .”
MethodA Set of Measures of Centrality Based on Betweenness
Freeman, L. C. (1977) · Sociometry · doi:10.2307/3033543 · Cited by 10,295
The igraph software package for complex network research
Csárdi, G., & Nepusz, T. (2006) · Medical Entomology and Zoology · Cited by 10,078
Assortative Mixing in Networks
Newman, M. E. J. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.208701 · Cited by 4,988
Characterization of Strange Attractors
Grassberger, P., & Procaccia, I. (1983) · Physical Review Letters · doi:10.1103/physrevlett.50.346 · Cited by 4,857
Recurrence plots for the analysis of complex systems
MARWAN, N., CARMENROMANO, M., THIEL, M., & KURTHS, J. (2007) · Physics Reports · doi:10.1016/j.physrep.2006.11.001 · Cited by 3,814
Self-citation
Cited by
Recurrence based time series analysis by means of complex network methods
DONNER, R. V., SMALL, M., DONGES, J. F., MARWAN, N., ZOU, Y., XIANG, R., & KURTHS, J. (2011) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127411029021 · Cited by 423
Self-citationRen, W., & Jin, N. (2019) · Nonlinear Dynamics · doi:10.1007/s11071-019-05147-7 · Cited by 30
Metadata
- Authors
- Donner, R. V., Zou, Y., Donges, J. F., Marwan, N., & Kurths, J.
- Venue
- New Journal of Physics
- Publisher
- IOP Publishing
- Published
- 2010-03-15
- Volume
- 12
- Issue
- 3
- Pages
- 033025
- ISSN
- 1367-2630 (ISSN-L)
- OpenAlex
- W1981510969
- Cited by
- 619
- References
- 87
- FWCI
- 23.80
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Recurrence networks—a novel paradigm for nonlinear time series analysis. https://app.cochat.ai/papers/10.1088/1367-2630/12/3/033025
- The paper
- Donner, R. V., Zou, Y., Donges, J. F., Marwan, N., & Kurths, J. (2010). Recurrence networks—a novel paradigm for nonlinear time series analysis. New Journal of Physics. https://doi.org/10.1088/1367-2630/12/3/033025
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.