SearcharxivSearch

arXiv · 2608.07109

Learning a quantitative criterion for distinguishing chaos from noise

Abstract

Distinguishing chaos from noise using time-series data is fundamentally challenging because both exhibit irregular fluctuations and share many statistical and dynamical characteristics. Existing methods face two key limitations: temporally correlated noise can yield spurious signatures of chaos, and analyses of scalar time series often require explicit choices of embedding parameters. Here, we propose a purely data-driven method for distinguishing chaos and noise based on a reservoir-computing framework with a cross-prediction scheme. In the proposed approach, the model is trained to predict the future change of a variable from its current value, thereby combining a short-term predictability test with a test of the smoothness of deterministic flows. The recurrent structure of reservoir computing enables effective prediction of high-dimensional chaotic dynamics even from scalar time series without explicit delay-coordinate reconstruction, while the cross-prediction framework strongly suppresses spurious predictive correlations arising from noise. We apply the proposed method to diverse synthetic and empirical time series. Chaotic systems consistently yield strong correlations between the true and predicted future changes, whereas noise processes remain clearly separated in a low-correlation regime. The method also exhibits substantial robustness to practical limitations in empirical data, including measurement noise, limited data length, and increasing prediction lag. These results demonstrate that the squared Pearson correlation coefficient provides a simple quantitative criterion for distinguishing chaos from noise directly from observed time-series data.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jaesung Choi, Athokpam Langlen Chanu, Jong-Min Park. 2026-08-07. Learning a quantitative criterion for distinguishing chaos from noise. https://arxiv.org/abs/2608.07109

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