It is demonstrated that the squared Pearson correlation coefficient provides a simple quantitative criterion for distinguishing chaos from noise directly from observed time-series data.
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.
This work uses error-free computation of two isomorphic chaotic systems, namely the Logistic map and the Tent map, to investigate the ability of Echo State Networks (ESNs) to learn and predict chaos, suggesting that ESNs exhibit significantly different predictive performance on the two isomorphic dynamical systems.
Alexandros K. Angelidis, Georgios C. Makris, E. Ioannidis et al.· Mathematics· 0 citations
Multi-step training of sparse, interpretable models of dynamical systems directly from time-series data yields models with accurate short-term dynamics and strong agreement in long-time statistical properties, including mean, variance, and Lyapunov exponents.
We study the reconstruction of an unknown dynamical system from a single noisy scalar time series. The goal is to recover the underlying dynamics for forecasting. We introduce a method that uses differential embedding coordinates to identify a rational closure of the embedding dynamics directly from data. The closure i...
Real-world systems, from climate models to power grids, often fluctuate due to sensor noise, drift, or environmental variability, yet standard chaos diagnostics assume fixed parameters and asymptotic horizons. We introduce a finite-time framework for two-dimensional maps under independent, identically distributed param...
Zubeyr Barre, M. Bashir, Martino Domenicali· 0 citations
Using ordinary least squares regression on high-degree polynomial features with 512-bit arithmetic, a system-agnostic method is introduced that matches the accuracy of standard 64-bit numerical ODE solvers using the systems’ governing equations, suggesting that forecasting low-dimensional chaotic systems from noise-fre...
The Bandt-Pompe permutation entropy framework, alongside the complexity-entropy causality plane, has become a standard tool for characterizing the dynamical properties of time series. However, observational noise distorts ordinal pattern probability distributions in ways that can systematically misplace time series wit...
Facundo Sapienza· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.