SearcharxivSearch

arXiv · 2303.11868

Irreversibility of symbolic time series: a cautionary tale

Abstract

Many empirical time series are genuinely symbolic: examples range from link activation patterns in network science, DNA coding or firing patterns in neuroscience to cryptography or combinatorics on words. In some other contexts, the underlying time series is actually real-valued, and symbolization is applied subsequently, as in symbolic dynamics of chaotic systems. Among several time series quantifiers, time series irreversibility (the difference between forward and backward statistics in stationary time series) is of great relevance. However, the irreversible character of symbolized time series is not always equivalent to the one of the underlying real-valued signal, leading to some misconceptions and confusion on interpretability. Such confusion is even bigger for binary time series (a classical way to encode chaotic trajectories via symbolic dynamics). In this article we aim to clarify some usual misconceptions and provide theoretical grounding for the practical analysis -- and interpretation -- of time irreversibility in symbolic time series. We outline sources of irreversibility in stationary symbolic sequences coming from frequency asymmetries of non-palindromic pairs which we enumerate, and prove that binary time series cannot show any irreversibility based on words of length m < 4, thus discussing the implications and sources of confusion. We also study irreversibility in the context of symbolic dynamics, and clarify why these can be reversible even when the underlying dynamical system is not, such as the case of the fully chaotic logistic map.

Explore related subjects

Keep this discovery

BibTeXRIS

Lluis Arola-Fernandez, Lucas Lacasa. 2023-03-21. Irreversibility of symbolic time series: a cautionary tale. https://doi.org/10.1103/physreve.108.014201

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