Time lagged ordinal partition networks for capturing dynamics of continuous dynamical systems
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
We investigate a generalised version of the recently proposed ordinal partition time series to network transformation algorithm. First, we introduce a fixed time lag for the elements of each partition that is selected using techniques from traditional time delay embedding. The resulting partitions define regions in the embedding phase space that are mapped to nodes in the network space. Edges are allocated between nodes based on temporal succession thus creating a Markov chain representation of the time series. We then apply this new transformation algorithm to time series generated by the Rössler system and find that periodic dynamics translate to ring structures whereas chaotic time series translate to band or tube-like structures—thereby indicating that our algorithm generates networks whose structure is sensitive to system dynamics. Furthermore, we demonstrate that simple network measures including the mean out degree and variance of out degrees can track changes in the dynamical behaviour in a manner comparable to the largest Lyapunov exponent. We also apply the same analysis to experimental time series generated by a diode resonator circuit and show that the network size, mean shortest path length, and network diameter are highly sensitive to the interior crisis captured in this particular data set.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
From time series to complex networks: the visibility graph
Lacasa, L., Luque, B., Ballesteros, F., Luque, J., & Nuño, J. C. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0709247105 · Cited by 1,826
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-citation
Cited by
Complex network approaches to nonlinear time series analysis
Zou, Y., Donner, R. V., Marwan, N., Donges, J. F., & Kurths, J. (2019) · Physics Reports · doi:10.1016/j.physrep.2018.10.005 · Cited by 634
Complex network analysis of time series
Gao, Z.-K., Small, M., & Kurths, J. (2016) · EPL (Europhysics Letters) · doi:10.1209/0295-5075/116/50001 · Cited by 301
Self-citation
Metadata
- Authors
- McCullough, M., Small, M., Stemler, T., & Iu, H. H.-C.
- Venue
- Chaos: An Interdisciplinary Journal of Nonlinear Science
- Publisher
- AIP Publishing
- Published
- 2015-05-01
- Volume
- 25
- Issue
- 5
- Pages
- 053101-053101
- ISSN
- 1054-1500 (ISSN-L)
- 1089-7682
- OpenAlex
- W1871076392
- Cited by
- 159
- References
- 2
- FWCI
- 5.56
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Time lagged ordinal partition networks for capturing dynamics of continuous dynamical systems. https://app.cochat.ai/papers/10.1063/1.4919075
- The paper
- McCullough, M., Small, M., Stemler, T., & Iu, H. H.-C. (2015). Time lagged ordinal partition networks for capturing dynamics of continuous dynamical systems. Chaos: An Interdisciplinary Journal of Nonlinear Science. https://doi.org/10.1063/1.4919075
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.