SearcharxivSearch

arXiv · 2606.05685

Empirical One-Step Conditional Entropy in Infinite Ergodic Systems: Vanishing Entropy Rate, Sparse-Transition Scaling, and Mittag-Leffler Fluctuations

Abstract

Empirical entropy rates are widely used to quantify unpredictability from symbolic or time-series data, yet their interpretation is subtle in weakly chaotic dynamics, where ordinary Lyapunov exponents vanish and invariant measures are infinite. We address this issue by studying the empirical one-step conditional entropy for the fixed finite partitions considered below in one-dimensional intermittent maps with infinite invariant measures. For the modified Bernoulli map and the Boole transformation in the infinite-measure weak-chaos regime, we prove that this per-step empirical entropy converges to zero. Thus, the usual entropy-rate normalization becomes asymptotically blind to subexponential instability. The finite-time information sum, however, remains informative. Rare transitions between long laminar phases occur on the return-sequence scale, and their empirical self-information contributes an additional logarithmic factor. Under the stated regularity and moment assumptions, this mechanism yields a two-term estimate for the ensemble mean decay, supported by numerical simulations. Although the raw entropy rate vanishes, self-normalized fluctuations remain nontrivial and are numerically consistent with normalized Mittag-Leffler laws. A comparison with generalized Lyapunov sums shows that the corresponding information sum is not a Krengel entropy estimator, but a computable, partition-dependent finite-time measure of sparse symbolic transitions. These results clarify what empirical Markov entropy can, and cannot, measure in infinite-measure weak chaos.

Explore related subjects

Keep this discovery

BibTeXRIS

Ken-ichi Okubo. 2026-06-04. Empirical One-Step Conditional Entropy in Infinite Ergodic Systems: Vanishing Entropy Rate, Sparse-Transition Scaling, and Mittag-Leffler Fluctuations. https://arxiv.org/abs/2606.05685

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