Time lagged ordinal partition networks for capturing dynamics of continuous dynamical systems
Michael McCullough, Michael Small, Thomas Stemler, and Herbert, Ho-Ching Iu

TL;DR
This paper introduces a time lagged ordinal partition network method that transforms continuous dynamical system time series into networks, capturing system dynamics and transitions effectively, including chaos and crises.
Contribution
The paper presents a novel network transformation algorithm incorporating time lag, enhancing the analysis of dynamical systems and their transitions.
Findings
Network structures reflect system dynamics (rings for periodic, bands for chaotic)
Network measures track dynamical changes similar to Lyapunov exponents
Method detects interior crises in experimental data
Abstract
We investigate a generalised version of the recently proposed ordinal partition time series to network transformation algorithm. Firstly 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\"ossler 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
