SearcharxivSearch

arXiv · 2506.17498

Deep learning for classifying dynamical states from time series via recurrence plots

Abstract

Recurrence Quantification Analysis (RQA) is a widely used method for capturing the dynamical structure embedded in time series data, relying on the analysis of recurrence patterns in the reconstructed phase space via recurrence plots (RPs). Although RQA proves effective across a range of applications, it typically requires the computation of multiple quantitative measures, making it both computationally intensive and sensitive to parameter choices. In this study, we adopt an alternative approach that bypasses computation of recurrence measures by directly using images of RP as input to a deep learning model. We propose a new dual-branch deep learning model named DBResNet-50 built on the ResNet-50 architecture. We compare its performance with standard ResNet-50 and MobileNetV2. Our DBResNet-50 model, trained exclusively on simulated time series, accurately classifies seven dynamical regimes: periodic, quasi-periodic, chaotic, hyperchaotic, white noise, pink noise, and red noise. Further, to assess its generalizability, we test the trained model on RP images generated from standard dynamical systems not included in the training set, as well as experimental datasets from a Chua circuit, X-ray light curves from the black-hole system GRS 1915+105, and observational light curves of the variable stars AC Her, SX Her, and Chi Cygni. In all cases, DBResNet-50 outperforms the baselines and correctly predicts the known dynamics of these systems. The model further used to infers the relative contributions of deterministic and stochastic components within a signal, as observed in temperature data from Ladakh and Ranchi. These results demonstrate the robustness and versatility of our deep learning framework and underscore the potential of RP image-based models as fast, accurate, and scalable tools for classifying dynamical states in both synthetic and real-world time series data.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Athul Mohan, G. Ambika, Chandrakala Meena. 2025-06-20. Deep learning for classifying dynamical states from time series via recurrence plots. https://arxiv.org/abs/2506.17498

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Linear Response Predicts Cusp-Pair Births in Networks with a Localized Cubic

Linear response is cheap to measure; the bistability boundaries it organizes are not. For a passive network with one localized cubic, the driving-point receptance $G$ fixes the period-one cusp set at fundamental-harmonic order: cusps lie on a fixed phase contour of $G$, a tangency of that contour under parameter variation creates a pair, and its curvature separates a gap opening from an isolated loop. For a two-mode absorber the linear prediction locates a benchmark birth coupling to $0.3\%$, and to $0.03\%$ once a third-harmonic correction of scale $|G(3\Omega)/G(\Omega)|$ is included.

nlin.CD

Dynamics Creation through Neural Dynamical Transfer Learning

Data-driven machine learning has established a robust foundation for reconstructing nonlinear dynamical systems from observations, primarily for the purposes of forecasting and control. However, most existing efforts focus on recovering specific observed dynamics rather than the generative synthesis of new ones. Inspired by image fusion and style transfer, we introduce a neural network framework termed Neural Dynamical Transfer Learning (NDTL) to create new systems with prescribed dynamics from pairs of parent nonlinear dynamical systems. By computing fundamental dynamical signatures, including the intrinsic dimension, the Kaplan-Yorke dimension, the invariant measure statistics, and the Lyapunov spectrum, we demonstrate that NDTL preserves key features inherited from the parent models while simultaneously generating novel dynamics. Beyond these validation examples, NDTL induces a criterion for dynamics classification, creates stable oscillatory coexistence in the Hastings-Powell food chain model, produces interpretable epidemiological models, and provides a chaotic source for image encryption.

nlin.CD

The Spectral Skeleton of Chaos: Koopman Wave Packets on Poincar\'e Sections

A Poincar\'e section replaces a flow by a return map, but for a chaotic system this map is usually known only from sampled crossings. We show that coarse transport can be read directly from Koopman spectral data, without fitting the map. Measure-preserving EDMD retains the isometric structure; riggedDMD then approximates spectral measures and constructs finite regularized wave packets. Packet phase supplies a finite-resolution transport coordinate; low modulus marks a singular skeleton where the phase becomes ill-conditioned. We demonstrate the idea on the R\"ossler system, a 32-mode Kuramoto--Sivashinsky Galerkin system, and the forced Duffing oscillator. The packets yield coarse symbolic models on sections ranging from an almost one-dimensional curve to a visibly thick set. Their graphs organize observed low-period orbits and guide targeted searches for others. In Duffing Regime~II, a seven-region rule accounts for $91\%$--$94\%$ of filtered one-step transitions, while failures in the lowest retained modulus decile occur at $5.08$--$5.20$ times the overall rate. The packets are not Koopman eigenfunctions, nor are the regions exact Markov partitions. Together these computations show how spectral information beyond isolated eigenpairs can expose chaotic transport directly from trajectories.

nlin.CD