SearcharxivSearch

arXiv · 2408.15834

Characterization of dynamical systems with scanty data using Persistent Homology and Machine Learning

Abstract

Determination of the nature of the dynamical state of a system as a function of its parameters is an important problem in the study of dynamical systems. This problem becomes harder in experimental systems where the obtained data is inadequate (low-res) or has missing values. Recent developments in the field of topological data analysis have given a powerful methodology, viz. persistent homology, that is particularly suited for the study of dynamical systems. Earlier studies have mapped the dynamical features with the topological features of some systems. However, these mappings between the dynamical features and the topological features are notional and inadequate for accurate classification on two counts. First, the methodologies employed by the earlier studies heavily relied on human validation and intervention. Second, this mapping done on the chaotic dynamical regime makes little sense because essentially the topological summaries in this regime are too noisy to extract meaningful features from it. In this paper, we employ Machine Learning (ML) assisted methodology to minimize the human intervention and validation of extracting the topological summaries from the dynamical states of systems. Further, we employ a metric that counts in the noisy topological summaries, which are normally discarded, to characterize the state of the dynamical system as periodic or chaotic. This is surprisingly different from the conventional methodologies wherein only the persisting (long-lived) topological features are taken into consideration while the noisy (short-lived) topological features are neglected. We have demonstrated our ML-assisted method on well-known systems such as the Lorentz, Duffing, and Jerk systems. And we expect that our methodology will be of utility in characterizing other dynamical systems including experimental systems that are constrained with limited data.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rishab Antosh, Sanjit Das, N. Nirmal Thyagu. 2024-08-28. Characterization of dynamical systems with scanty data using Persistent Homology and Machine Learning. https://arxiv.org/abs/2408.15834

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