Research Briefing
math.DS 2605.29780v1 worth_reading

Entropic and algebraic transcript-based tools in time series analysis

José M. Amigó, Roberto Dale

Published 2026-05-28 11:28:45 相关性 1.0000 价值 0.7400 math.DS cs.IT
arXiv PDF HTML

摘要

选中正文可添加批注

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.

相关性判断

high
相关方向
information_theory mutual_information divergence time_series_analysis group_theory
判断依据

The paper is explicitly tagged cs.IT and focuses on entropic tools, mutual information, divergence, and algebraic/group-based distances for coupled time series, which are adjacent to information theory and coding-related methods. It is relevant for later review despite the primary math.DS framing.

价值判断

High relevance to cs.IT-adjacent information theory through entropy, divergence, mutual information, and transcript-based coupling measures. Structure analysis indicates a coherent unifying framework for finite-group-valued and ordinal time series, with multiple concrete technical tools. The proposed mean Kendall similarity distance has a clear empirical claim of outperforming tested alternatives for generalized-synchronization detection.

核心问题与主要方法

核心问题

analyze coupling and generalized synchronization in algebraic/group-valued time series using transcript-based measures

场景：ordinal and more general finite-group-valued time series, evaluated on unidirectionally coupled Hénon maps under weak and strong generalized synchronization

主要方法

A transcript T(a,b)=b*a^{-1} maps a source and target group element to the group element transforming one symbol into the other, enabling pairwise coupling summaries for group-valued series. For ordinal representations, transcripts connect directly to permutation distances: Cayley and Kendall distances can be computed as norms or functions of the transcript between two ordinal patterns. The proposed similarity distance averages normalized Kendall distances d_K(r_t,s_t) over time between source and target ordinal-pattern sequences, preserving symbol-level geometric information instead of reducing immediately to a transcript probability distribution. Order-class analysis groups transcripts by algebraic order, exposing forbidden transcript classes under weak or strong generalized synchronization. Cayley embedding transports Cayley/Kendall-style distances from symmetric groups to general finite groups, but the payload notes this is mainly practical for small cardinalities and can introduce admissible-distance gaps.

关键贡献与后续阅读

关键贡献

Defines and positions the mean Kendall similarity distance as a transcript-based algebraic measure between two ordinal-pattern time series. Unifies entropic and algebraic transcript-based tools for coupled finite-group-valued time series, including entropy, divergence, statistical complexity, mutual information, order classes, Cayley distance, and Kendall distance. Shows how transcripts relate to Cayley and Kendall distances in symmetric groups and how Cayley embedding can extend these distances to general finite groups. Benchmarks representative transcript-based tools on weak and strong generalized synchronization in unidirectionally coupled non-identical Hénon maps. Interprets synchronization regimes through forbidden transcripts, forbidden short or long Kendall distances, and transcript order-class restrictions.

研究启发

How robust is the mean Kendall similarity distance to observational noise, short samples, ties in ordinal patterns, and nonstationarity? Does the reported advantage persist for other dynamical systems, real-world coupled processes, larger ordinal pattern lengths, and non-permutation finite groups? How sensitive are the conclusions to the choice of delay time T, embedding dimension L, coupling delay, and normalization of Kendall distance? Are confidence intervals, repeated seeds, or statistical tests provided for the separation between weak, near-weak, and strong synchronization regimes?

限制与不确定性

Primary category is math.DS, so the contribution may be more dynamical-systems methodology than core information theory. Evidence appears limited to numerical tests on a coupled Henon benchmark, reducing urgency for deep review. Novelty may be incremental if much of the transcript-based entropy and algebraic tooling is surveyed from existing work.

原文信息

正文记录 1
参考文献 74
最近更新 2026-05-30 13:21
查看正文预览 
Abstract

Content selection saved. Describe the issue below:

Entropic and algebraic transcript-based tools in time series analysis

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 mutu
查看参考文献
  1. (1) H. Kantz and T. Schreiber, Nonlinear Time Series Analysis . Cambridge University Press, Cambridge, 1997.
  2. (2) Y. Hirata and J.M. Amigó, “A review of symbolic dynamics and symbolic reconstruction of dynamical systems,” Chaos 33 , 052101 (2023).
  3. (3) J. Zhang and M. Small, “Complex network from pseudoperiodic time series: Topology versus dynamics,” Phys. Rev. Lett. 96 , 238701 (2006).
  4. (4) M. Small, “Complex networks from time series: Capturing dynamics,” in 2013 IEEE International Symposium on Circuits and Systems (ISCAS) (IEEE, 2013), pp. 2509–2512.
  5. (5) Y. Zou, R.V. Donner, N. Marwan, J.F. Donges, and J. Kurths, “Complex network approaches to nonlinear time series analysis,” Physics Reports 787 , 1–97 (2019).
  6. (6) P.Y. Lum, G. Singh, A. Lehman, T. Ishkanov, M. Vejdemo-Johansson, M. Alagappan, J. Carlsson, and G. Carlsson, “Extracting insights from the shape of complex data using topology,” Scientific Reports 3 , 1236 (2013).
  7. (7) J.A. Perea, “Topological time series analysis,” Notices of the American Mathematical Society 66 , 686-694 (2019).
  8. (8) T. Haruna, “Complexity of couplings in multivariate time series via ordinal persistent homology,” Chaos 33 , 043115 (2023).
  9. (9) J.M. Amigó, R. Monetti, B. Graff, and G. Graff, “Computing algebraic transfer entropy and coupling directions via transcripts,” Chaos 26 , 113115 (2016).
  10. (10) C. Bandt and B. Pompe, “Permutation Entropy: A Natural Complexity Measure for Time Series,” Physical Review Letters 88 , 174102 (2002).
  11. (11) M. Mohr, F. Wilhelm, M. Hartwig, R. Möller, and K. Keller, New Approaches in Ordinal Pattern Representations for Multivariate Time Series. Proceedings of the Thirty-Third International Artificial Intelligence Research Society Conference (FLAIRS 2020), pp. 124–129, North Miami Beach, Florida, 2020. https://aaai.org/papers/124-flairs-2020-18417.
  12. (12) I.N. Herstein, Abstract Algebra , Wiley 1996. ISBN 978-0471368793.
  13. (13) S. Lang, Undergraduate Algebra (3rd edition). Undergraduate Texts in Mathematics, Springer, New York, 2005. ISBN 978-0387220253.
  14. (14) R. Monetti, W. Bunk, T. Aschenbrenner, and F. Jamitzky, “Characterizing synchronization in time series using information measures extracted from symbolic representations,” Physical Review E 79 , 046207 (2009).
  15. (15) J.M. Amigó, R. Monetti, T. Aschenbrenner, and W. Bunk, “Transcripts: An algebraic approach to coupled time series,” Chaos 22 , 013105 (2012).
  16. (16) J.M. Amigó and R. Dale, “Permutation-based distances for groups and group-valued time series,” Entropy 27 , 913 (2025).
  17. (17) A. Myers and F. A. Khasawneh, “On the automatic parameter selection for permutation entropy,” Chaos 30 , 033130 (2020).
  18. (18) C. Bian, C. Qin, Q.D.Y. Ma, and Q. Shen, “Modified Permutation Entropy Analysis of Heartbeat Dynamics,” Physical Review E 85 , 021906 (2012).
  19. (19) V.A. Unakafova and K. Keller, “Efficiently measuring complexity on the basis of real-world data,” Entropy 15 , 4392-4415 (2013).
  20. (20) A. Schnurr and S. Fischer, “Generalized Ordinal Patterns Allowing for Ties and Their Applications in Hydrology,” Computational Statistics and Data Analysis 171 , 107472 (2022).