SearcharxivSearch

arXiv · 2512.16186

For how long time evolution of chaotic or random systems can be predicted

Abstract

Traditionally, Probability theory was dealing with limit theorems where 'limit" means that time tends to infinity. Questions about finite time dynamics (evolution) were always considered as, although important for practical applications, but untreatable rigorously (mathematically). The same attitude was in the theory of strongly chaotic dynamical systems, which evolve similarly to stochastic processes. However, a natural question on dependence of the process of escape on a position of a "hole" in the state (phase) space, which was never asked in mathematical theory of open dynamical systems, opened up a new direction of research, which was dealing with finite time predictions of evolutions of such systems. It turned out, that transport of orbits in the phase space of the "most strongly chaotic" dynamical systems has three different stages. In the first stage there is a hierarchy of the first hitting probabilities, that shows which parts of the phase space the orbits of a system, which is an equilibrium state, will be more likely to visit the first. A principal (and the most important for applications) question was how the length of this interval changes with more refinement observations of the positions of the orbits in the phase space. Surprisingly, it turned out that the length of the time interval, where finite time predictions are possible, increases (rather to be shrinking), which, at the first sight, seems to be natural. However, this increase of the length of the time interval, where finite time predictions are possible, was rather slow (just linear) with respect to the growth of precision (partition of the phase space) of observations. In the present paper it is proved (by totally different technique) that this growth is actually exponential.

Explore related subjects

Keep this discovery

BibTeXRIS

Leonid Bunimovich, Kirill Kovalenko. 2025-12-18. For how long time evolution of chaotic or random systems can be predicted. https://arxiv.org/abs/2512.16186

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