Search arXivSearch

arXiv · 2605.29780

Entropic and algebraic transcript-based tools in time series analysis

Abstract

Algebraic representations of time series are symbolic representations whose symbols belong to a finite group. Precisely, the framework of the present paper is the analysis of coupled time series in algebraic representations and, more generally, group-valued time series. The prototype of an algebraic representation is an ordinal representation, whose symbols are permutations, also called ordinal patterns in the context of time series analysis. In fact, permutations, endowed with function composition, build a group called a symmetric group. A simple way to harness the algebraic structure of the alphabet in such cases is the concept of transcript from one group element to another. Since transcripts involve two group elements, they are very suitable for studying couplings between time series in the same algebraic representation. In this paper, we outline several existing entropic and algebraic transcript-based tools for analyzing coupled time series and systems. In addition to entropy, the entropic tools include divergence, statistical complexity and mutual information. The algebraic tools comprise order classes and, most recently, the Cayley and Kendall distances. We use the detection of generalized synchronization in a well-studied coupled system to compare the performances of some of those tools. To this end, we also provide an alternative tool called the similarity distance between times series, which is a mean Kendall distance. We found that the novel similarity distance outperforms the other tools tested.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

José M. Amigó, Roberto Dale. 2026-05-28. Entropic and algebraic transcript-based tools in time series analysis. https://doi.org/10.1063/5.0323611

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS