Pith. sign in

REVIEW 2 minor 81 references

Entropic and algebraic transcript-based tools in time series analysis

T0 review · 0 major / 2 minor · reviewed 2026-06-29 · grok-4.3

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read A mean Kendall distance between ordinal patterns of two time series outperforms other transcript-based entropic and algebraic tools at detecting generalized synchronization.

desk verdict The paper adds a mean Kendall distance as a new similarity measure on transcripts and reports it beats several existing tools on generalized synchronization in one standard coupled system. read the letter →

arxiv 2605.29780 v1 pith:AWCN2AJF submitted 2026-05-28 math.DS cs.ITmath.IT

José M. Amigó , Roberto Dale This is my paper · ORCID
classification math.DScs.ITmath.IT
keywords timeseriesanalysisordinalpatternsgeneralizedsynchronizationKendalldistancealgebraicrepresentationstranscriptscoupledsystems
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper examines tools for studying couplings between time series that take values in a finite group, with permutations from ordinal patterns serving as the main example. It reviews entropic measures such as divergence and mutual information alongside algebraic ones such as order classes and Cayley and Kendall distances, all built on the notion of a transcript between group elements. A new similarity distance is introduced as the average Kendall distance across the patterns of the two series. When applied to the detection of generalized synchronization in one standard coupled dynamical system, the similarity distance yields better results than the other tools examined.

What carries the argument

Transcript between two group elements in the symmetric group, used to compare algebraic representations of coupled time series; the similarity distance is the average Kendall distance computed from these transcripts.

What would settle it

A different coupled dynamical system in which the similarity distance does not outperform the other listed tools when detecting generalized synchronization.

Watch

Extended reading notes

Core claim

The similarity distance, defined as the mean Kendall distance on the ordinal patterns of two time series, outperforms entropy, divergence, statistical complexity, mutual information, order classes, Cayley distance, and Kendall distance when used to detect generalized synchronization in the tested coupled system.

Load-bearing premise

Performance results obtained on a single well-studied coupled system are representative of the similarity distance's behavior on coupled time series in general.

Editorial extensions

If this is right

  • The similarity distance supplies a concrete algebraic alternative that can be added to existing entropic measures for synchronization analysis.
  • Kendall distance on transcripts captures ordering relations between patterns that are not directly measured by entropy or divergence alone.
  • The transcript framework applies to any time series taking values in a finite group, not only to ordinal patterns.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Repeating the comparison on several additional coupled systems would test whether the reported advantage is system-specific.
  • The similarity distance could be applied to empirical recordings such as physiological or financial series where ordinal patterns are already in use.
  • Analytical expressions for the expected value of the similarity distance under independent or fully synchronized regimes might be derivable from the group structure.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

0 major / 2 minor

Summary. The manuscript outlines entropic and algebraic transcript-based tools for analyzing coupled group-valued time series, with a focus on ordinal patterns from the symmetric group. It reviews tools including entropy, divergence, statistical complexity, mutual information, order classes, Cayley distance, and Kendall distance; introduces a new similarity distance defined as the mean Kendall distance on transcripts; and compares their performance in detecting generalized synchronization in a well-studied coupled system, concluding that the similarity distance outperforms the others tested.

Significance. If the reported outperformance is confirmed by the quantitative comparison in the full manuscript, the similarity distance provides a simple, algebraically grounded addition to the toolkit for synchronization detection in dynamical systems, building directly on the group structure of transcripts without introducing new parameters.

minor comments (2)
  1. [Abstract] Abstract: the claim that the similarity distance 'outperforms the other tools tested' is stated without any numerical results, error bars, or description of the coupled system, which limits immediate assessment even though the full text presumably contains the comparison.
  2. The manuscript would benefit from a table or figure summarizing the performance metrics (e.g., detection rates or distances) across the tools for the chosen system to make the empirical claim fully reproducible.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary of the manuscript, recognition of the significance of the mean Kendall distance similarity measure, and recommendation of minor revision. No specific major comments were provided in the report.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity identified

full rationale

The paper defines the similarity distance explicitly as the mean Kendall distance on transcripts and evaluates its performance via direct empirical comparison against other tools on generalized synchronization detection in one specified coupled system. No equations, derivations, or parameter-fitting steps are described that would reduce the claimed outperformance to a self-referential construction, fitted input, or load-bearing self-citation. The central result is an external test outcome rather than an internal identity or renamed ansatz, rendering the derivation chain self-contained against the provided description.

Assumptions & free parameters 0 free parameters · 0 assumptions · 0 invented entities

Abstract-only review supplies no information on free parameters, axioms, or invented entities; all fields left empty.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Entropic and algebraic transcript-based tools in time series analysis." pith.science (2026). https://pith.science/paper/AWCN2AJF

@misc{pith2026260529780,
  author       = {Pith},
  title        = {Pith review of: Entropic and algebraic transcript-based tools in time series analysis},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/AWCN2AJF}},
  note         = {Machine review of arXiv:2605.29780}
}
read the original 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.

Figures

Figures reproduced from arXiv: 2605.29780 by the authors.

Figure 1
Figure 1. FIG. 1. Adjacency graph of Sym [PITH_FULL_IMAGE:figures/full_fig_p010_1.png] view at source ↗
Figure 2
Figure 2. FIG. 2. Entropy-complexity plane [PITH_FULL_IMAGE:figures/full_fig_p013_2.png] view at source ↗
Figure 3
Figure 3. FIG. 3. Symbolic transfer entropy TE [PITH_FULL_IMAGE:figures/full_fig_p013_3.png] view at source ↗
Figures from the paper (2 more)
Figure 4
Figure 4. Figure 4: FIG. 4. (a) Probabilities of the transcript order classes (see inset) as function of the coupling strength [PITH_FULL_IMAGE:figures/full_fig_p014_4.png]
Figure 5
Figure 5. Figure 5: FIG. 5. The transcript-based similarity distance [PITH_FULL_IMAGE:figures/full_fig_p015_5.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

81 extracted references · 2 canonical work pages

  1. [1]

    merlin.mbs aapmrev4-1.bst 2010-07-25 4.21a (PWD, AO, DPC) hacked

    FUNCTION id.bst "merlin.mbs aapmrev4-1.bst 2010-07-25 4.21a (PWD, AO, DPC) hacked" ENTRY address archive archivePrefix author bookaddress booktitle chapter collaboration doi edition editor eid eprint howpublished institution isbn issn journal key language month note number organization pages primaryClass publisher school SLACcitation series title translat...

    2010

  2. [2]

    merlin.mbs aipauth4-1.bst 2010-07-25 4.21a (PWD, AO, DPC) hacked

    FUNCTION id.bst "merlin.mbs aipauth4-1.bst 2010-07-25 4.21a (PWD, AO, DPC) hacked" ENTRY address archive archivePrefix author bookaddress booktitle chapter collaboration doi edition editor eid eprint howpublished institution isbn issn journal key language month note number organization pages primaryClass publisher school SLACcitation series title translat...

    2010

  3. [3]

    merlin.mbs aipnum4-1.bst 2010-07-25 4.21a (PWD, AO, DPC) hacked

    FUNCTION id.bst "merlin.mbs aipnum4-1.bst 2010-07-25 4.21a (PWD, AO, DPC) hacked" ENTRY address archive archivePrefix author bookaddress booktitle chapter collaboration doi edition editor eid eprint howpublished institution isbn issn journal key language month note number organization pages primaryClass publisher school SLACcitation series title translati...

    2010

  4. [4]

    merlin.mbs apsrev4-1.bst 2010-07-25 4.21a (PWD, AO, DPC) hacked

    FUNCTION id.bst "merlin.mbs apsrev4-1.bst 2010-07-25 4.21a (PWD, AO, DPC) hacked" ENTRY address archive archivePrefix author bookaddress booktitle chapter collaboration doi edition editor eid eprint howpublished institution isbn issn journal key language month note number organization pages primaryClass publisher school SLACcitation series title translati...

    2010

  5. [5]

    merlin.mbs apsrmp4-1.bst 2010-07-25 4.21a (PWD, AO, DPC) hacked

    FUNCTION id.bst "merlin.mbs apsrmp4-1.bst 2010-07-25 4.21a (PWD, AO, DPC) hacked" ENTRY address archive archivePrefix author bookaddress booktitle chapter collaboration doi edition editor eid eprint howpublished institution isbn issn journal key language month note number organization pages primaryClass publisher school SLACcitation series title translati...

    2010

  6. [6]

    Kantz and T

    H. Kantz and T. Schreiber, Nonlinear Time Series Analysis. Cambridge University Press, Cambridge, 1997

    1997

  7. [7]

    Hirata and J.M

    Y. Hirata and J.M. Amig\' o , A review of symbolic dynamics and symbolic reconstruction of dynamical systems, \ Chaos 33, 052101 (2023)

    2023

  8. [8]

    Zhang and M

    J. Zhang and M. Small, Complex network from pseudoperiodic time series: Topology versus dynamics, \ Phys. Rev. Lett. 96, 238701 (2006)

    2006

Show all 81 references
  1. [9]

    Small, Complex networks from time series: Capturing dynamics, \ in 2013 IEEE International Symposium on Circuits and Systems (ISCAS) (IEEE, 2013), pp

    M. Small, Complex networks from time series: Capturing dynamics, \ in 2013 IEEE International Symposium on Circuits and Systems (ISCAS) (IEEE, 2013), pp. 2509--2512

    2013

  2. [10]

    Zou, R.V

    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)

    2019

  3. [11]

    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)

    2013

  4. [12]

    Perea, Topological time series analysis, \ Notices of the American Mathematical Society 66, 686-694 (2019)

    J.A. Perea, Topological time series analysis, \ Notices of the American Mathematical Society 66, 686-694 (2019)

    2019

  5. [13]

    Haruna, Complexity of couplings in multivariate time series via ordinal persistent homology, \ Chaos 33, 043115 (2023)

    T. Haruna, Complexity of couplings in multivariate time series via ordinal persistent homology, \ Chaos 33, 043115 (2023)

    2023

  6. [14]

    Amig\' o , R

    J.M. Amig\' o , R. Monetti, B. Graff, and G. Graff, Computing algebraic transfer entropy and coupling directions via transcripts, \ Chaos 26, 113115 (2016)

    2016

  7. [15]

    Bandt and B

    C. Bandt and B. Pompe, Permutation Entropy: A Natural Complexity Measure for Time Series, \ Physical Review Letters 88, 174102 (2002)

    2002

  8. [16]

    M. Mohr, F. Wilhelm, M. Hartwig, R. M\" o 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 M...

    2020

  9. [17]

    Herstein, Abstract Algebra, Wiley 1996

    I.N. Herstein, Abstract Algebra, Wiley 1996. ISBN 978-0471368793

    1996

  10. [18]

    Lang, Undergraduate Algebra (3rd edition)

    S. Lang, Undergraduate Algebra (3rd edition). Undergraduate Texts in Mathematics, Springer, New York, 2005. ISBN 978-0387220253

    2005

  11. [19]

    Monetti, W

    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)

    2009

  12. [20]

    Amig\' o , R

    J.M. Amig\' o , R. Monetti, T. Aschenbrenner, and W. Bunk, Transcripts: An algebraic approach to coupled time series, \ Chaos 22, 013105 (2012)

    2012

  13. [21]

    Amig\' o and R

    J.M. Amig\' o and R. Dale, Permutation-based distances for groups and group-valued time series, \ Entropy 27, 913 (2025)

    2025

  14. [22]

    Myers and F

    A. Myers and F. A. Khasawneh, On the automatic parameter selection for permutation entropy, \ Chaos 30, 033130 (2020)

    2020

  15. [23]

    C. Bian, C. Qin, Q.D.Y. Ma, and Q. Shen, Modified Permutation Entropy Analysis of Heartbeat Dynamics, \ Physical Review E 85, 021906 (2012)

    2012

  16. [24]

    Unakafova and K

    V.A. Unakafova and K. Keller, Efficiently measuring complexity on the basis of real-world data, \ Entropy 15, 4392-4415 (2013)

    2013

  17. [25]

    Schnurr and S

    A. Schnurr and S. Fischer, Generalized Ordinal Patterns Allowing for Ties and Their Applications in Hydrology, \ Computational Statistics and Data Analysis 171, 107472 (2022)

    2022

  18. [26]

    Selecting embedding delays: An overview of embedding techniques and a new method using persistent homology,

    E. Tan, S. Algar, D. Corrêa, M. Small, T. Stemler, D. Walker, "Selecting embedding delays: An overview of embedding techniques and a new method using persistent homology," Chaos 33, 032101 (2023)

    2023

  19. [27]

    Bunk, J.M

    W. Bunk, J.M. Amig\' o , T. Aschenbrenner and R. Monetti, A new perspective on transcripts by means of their matrix representation: Some properties and applications to coupled systems, \ European Physical Journal Special Topics 222, 363--382 (2013)

    2013

  20. [28]

    Haruna, Partially ordered permutation complexity of coupled time series, \ Physica D 388, 40--44 (2019)

    T. Haruna, Partially ordered permutation complexity of coupled time series, \ Physica D 388, 40--44 (2019)

    2019

  21. [29]

    Rios de Sousa, and J.Hlinka, Assessing serial dependence in ordinal patterns processes using chi-squared tests with application to EEG data analysis, \ Chaos 32, 073126 (2022)

    A.M.Y. Rios de Sousa, and J.Hlinka, Assessing serial dependence in ordinal patterns processes using chi-squared tests with application to EEG data analysis, \ Chaos 32, 073126 (2022)

    2022

  22. [30]

    Haruna and K

    T. Haruna and K. Nakajima, Permutation complexity via duality between values and orderings, \ Physica D 240, 1370--1377 (2011)

    2011

  23. [31]

    Keller and H

    K. Keller and H. Lauffer, Symbolic analysis of high dimensional time series, \ International Journal of Bifurcation and Chaos 13, 2657--2668 (2003)

    2003

  24. [32]

    Parlitz, S

    U. Parlitz, S. Berg, S. Luther, A. Schirdewan, J.Kurths, and N. Wessel, Classifying cardiac biosignals using ordinal pattern statistics and symbolic dynamics, \ Computers in Biology and Medicine 42, 319--327 (2012)

    2012

  25. [33]

    Amig\' o , L

    J.M. Amig\' o , L. Kocarev, and J. Szczepanski,

  26. [34]

    Amig\' o and M.B

    J.M. Amig\' o and M.B. Kennel,

  27. [35]

    Parlitz, H

    U. Parlitz, H. Suetani, S. Luther, Identification of equivalent dynamics using ordinal pattern distribution, \ The European Physical Journal Special Topics 222, 553--568 (2013)

    2013

  28. [36]

    C\' a novas, A

    J.S. C\' a novas, A. Guillam\' o n, and M. del Carmen Ruiz, Using permutations to detect dependence between time series, \ Physica D 240, 1199-1204 (2011)

    2011

  29. [37]

    Wei , Non-parametric tests for serial dependence in time series based on asymptotic implementations of ordinal-pattern statistics, \ Chaos 32, 093107 (2022)

    C.H. Wei , Non-parametric tests for serial dependence in time series based on asymptotic implementations of ordinal-pattern statistics, \ Chaos 32, 093107 (2022)

    2022

  30. [38]

    C.H. Wei , M. Ruiz Mar\' n, K. Keller, and M. Matilla-Garc\' a, Non-parametric analysis of serial dependence in time series using ordinal patterns, \ Comput. Stat. Data Anal. 168, 107381 (2022)

    2022

  31. [39]

    Arroyo, G

    D. Arroyo, G. \' A lvarez, and J.M. Amig\' o , Estimation of control parameters from symbolic sequences: unimodal maps with variable critical point, \ Chaos 19, 023125 (2009)

    2009

  32. [40]

    Fraleigh, A First Course in Abstract Algebra

    J.B. Fraleigh, A First Course in Abstract Algebra. Pearson New International Edition, 2013. ISBN 978-1292024967

    2013

  33. [41]

    Bandt, Small order patterns in big time series: A practical guide, \ Entropy 21, 613 (2019)

    C. Bandt, Small order patterns in big time series: A practical guide, \ Entropy 21, 613 (2019)

    2019

  34. [42]

    Bandt and F

    C. Bandt and F. Shiha, Order patterns in time series, \ Journal of Time series 28, 646-665 (2007)

    2007

  35. [43]

    Kitchens, Symbolic Dynamics

    B.P. Kitchens, Symbolic Dynamics. Springer Verlag, Berlin, 1998

    1998

  36. [44]

    Lind and B

    D. Lind and B. Marcus, Symbolic Dynamics and Coding. Cambridge University Press, Cambridge, 2003

    2003

  37. [45]

    Hao and W.M

    B.L. Hao and W.M. Zheng, Applied Symbolic Dynamics and Chaos. World Scientific, Singapore, 1998

    1998

  38. [46]

    J. P. Eckmann and D. Ruelle, Ergodic theory of chaos and strange attractors, \ Rev. Mod. Phys. 57, 617--656 (1985)

    1985

  39. [47]

    Johnson, Minimal Permutation Representations of Finite Groups, \ American Journal of Mathematics 93, 857--866 (1971)

    D.L. Johnson, Minimal Permutation Representations of Finite Groups, \ American Journal of Mathematics 93, 857--866 (1971). JSTOR 2373739

    1971

  40. [48]

    Grechkoseeva, On Minimal Permutation Representations of Classical Simple Groups, \ Siberian Mathematical Journal 44, 443--462 (2003)

    M.A. Grechkoseeva, On Minimal Permutation Representations of Classical Simple Groups, \ Siberian Mathematical Journal 44, 443--462 (2003)

    2003

  41. [49]

    Permutation entropy and its main biomedical and econophysics applications: A review,

    M. Zanin, L. Zunino, O.A. Rosso, and D. Papo, "Permutation entropy and its main biomedical and econophysics applications: A review," Entropy 14, 1553--1577 (2012)

    2012

  42. [50]

    Amig\' o , K

    J.M. Amig\' o , K. Keller, and V. Unakafova, Ordinal symbolic analysis and its applications to biomedical recordings, \ Philosophical Transactions of the Royal Society A 373, 20140091 (2015)

    2015

  43. [51]

    Adams and K

    M. Adams and K. Lehnertz, Noise robustness of transcript-based estimators for properties of interactions, \ Entropy 27, 1067 (2025)

    2025

  44. [52]

    Cover and J.A

    T.M. Cover and J.A. Thomas, Elements of Information Theory, 2nd edition. New York, John Wiley & Sons, 2006

    2006

  45. [53]

    Amig\' o and K

    J.M. Amig\' o and K. Keller, Permutation entropy: One concept, two approaches, \ European Physical Journal Special Topics 222, 263--274 (2013)

    2013

  46. [54]

    R\' e nyi, On measures of entropy and information

    A. R\' e nyi, On measures of entropy and information. In Proceedings of the 4th Berkeley Symposium on Mathematics, Statistics and Probability; J. Neyman, Ed.; University of California Press: Berkeley, CA, USA, 1961; pp. 547--561

    1961

  47. [55]

    Tsallis, Possible generalization of Boltzmann--Gibbs statistics, \ J

    C. Tsallis, Possible generalization of Boltzmann--Gibbs statistics, \ J. Stat. Phys. 52 , 479--487 (1988)

    1988

  48. [56]

    Pilarczyk, G

    P. Pilarczyk, G. Graff, J.M. Amig\' o , K. Tessmer, K. Narkiewicz, and B. Graff, Differentiating patients with obstructive sleep apnea from healthy controls based on heart rate-blood pressure coupling quantified by entropy-based indices, \ Chaos 33, 103140 (2023)

    2023

  49. [57]

    Paninski, Estimation of entropy and mutual information, \ Neural Computation 15, 1191--1253 (2003)

    L. Paninski, Estimation of entropy and mutual information, \ Neural Computation 15, 1191--1253 (2003)

    2003

  50. [58]

    Riedl, A

    M. Riedl, A. M\" u ller, and N. Wessel, Practical considerations of permutation entropy, \ Eur. Phys. J. Spec. Top. 222, 249--262 (2013)

    2013

  51. [59]

    Chagas, A.C

    E.T.C. Chagas, A.C. Frery, J. Gambini, M.M. Lucini, H.S. Ramos, and A.A. Rey, Statistical properties of the entropy from ordinal patterns, \ Chaos 32, 113118 (2022)

    2022

  52. [60]

    Lin, Divergence measures based on the Shannon entropy, \ IEEE Trans

    J. Lin, Divergence measures based on the Shannon entropy, \ IEEE Trans. Inf. Theory 37, 145--151 (1991)

    1991

  53. [61]

    Endres and J

    D. Endres and J. Schindelin, A new metric for probability distributions, \ IEEE Trans. Inf. Theory 49, 1858--1860 (2003)

    2003

  54. [62]

    O. A. Rosso, H. A. Larrondo, M. T. Mart\' n, A. Plastino, and M. A. Fuentes, Distinguishing noise from chaos, \ Phys. Rev. Lett. 99, 154102 (2007)

    2007

  55. [63]

    Monetti, J.M

    R. Monetti, J.M. Amig\' o , T. Aschenbrenner and W. Bunk, Permutation complexity of interacting dynamical systems, \ European Physical Journal Special Topics 222, 421--436 (2013)

    2013

  56. [64]

    Monetti, W

    R. Monetti, W. Bunk, T. Aschenbrenner, S. Springer, and J.M. Amig\' o , Information directionality in coupled time series using transcripts, \ Phys. Rev. E 88, 022911 (2013)

    2013

  57. [65]

    Staniek and K

    M. Staniek and K. Lehnertz, Symbolic transfer entropy, \ Physical Review Letters 100, 158101 (2008)

    2008

  58. [66]

    Amig\' o , R

    J.M. Amig\' o , R. Monetti, N. Tort-Colet, and M.V. Sanchez-Vives, Infragranular layers lead information flow during slow oscillations according to information directionality indicators, \ J. Comp. Neuros. 39, 53--62 (2015)

    2015

  59. [67]

    Hirata, J.M

    Y. Hirata, J.M. Amig\' o , Y. Matsuzaka, R. Yokota, H. Mushiake, and K. Aihara, Detecting causality by combined use of multiple methods: Climate and brain examples, \ PLoS ONE 11, e0158572 (2016)

    2016

  60. [68]

    Adams, J.M

    M. Adams, J.M. Amig\' o , and K. Lehnertz, Transcript-based estimators for characterizing interactions, \ Chaos 36, 013104 (2026)

    2026

  61. [69]

    S\" o rensen, Distance measures based on the edit distance for permutation-type representations, \ Journal of Heuristics 13, 35--47 (2007)

    K. S\" o rensen, Distance measures based on the edit distance for permutation-type representations, \ Journal of Heuristics 13, 35--47 (2007)

    2007

  62. [70]

    Nguyen, Improving the Gilbert-Varshamov bound for permutation Codes in the Cayley metric and Kendall -Metric, \ arXiv:2404.15126v2 (2024)

    T. Nguyen, Improving the Gilbert-Varshamov bound for permutation Codes in the Cayley metric and Kendall -Metric, \ arXiv:2404.15126v2 (2024)

    2024

  63. [71]

    Kendall, A new measure of rank correlation, \ Biometrika 30, 81-93 (1938)

    M.G. Kendall, A new measure of rank correlation, \ Biometrika 30, 81-93 (1938)

    1938

  64. [72]

    https://en.wikipedia.org/wiki/Permutohedron

    Permutohedron. https://en.wikipedia.org/wiki/Permutohedron

  65. [73]

    Schiff, P

    S.J. Schiff, P. So, T. Chang, R.E. Burke, and T. Sauer, Detecting dynamical interdependence and generalized synchrony through mutual prediction in a neural ensemble, \ Physical Review E 54, 6708-6724 (1996)

    1996

  66. [74]

    Rulkov, M.M

    N.F. Rulkov, M.M. Sushchik, L.S. Tsimring, and H.D.I. Abarbanel, Generalized synchronization of chaos in directionally coupled chaotic systems, \ Physical Review E 51, 980-994 (1995)

    1995

  67. [75]

    Rosenblum, A.S

    M.G. Rosenblum, A.S. Pikovsky, and J. Kurths, From phase to lag synchronization in coupled chaotic oscillators, \ Physical Review Letters 78, 4193-4196 (1997)

    1997

  68. [76]

    Pikovsky, M

    A. Pikovsky, M. Rosenblum, and J. Kurths, Synchronization: A Universal Concept in Nonlinear Sciences, Cambridge University Press, Cambridge, UK, 2001

    2001

  69. [77]

    Amig\' o , R

    J.M. Amig\' o , R. Dale, J.C. King, and K. Lehnertz, Generalized synchronization in the presence of dynamical noise and its detection via recurrent neural networks, \ Chaos 34, 123156 (2024)

    2024

  70. [78]

    Berger, A

    S. Berger, A. Kravtsiv, G. Schneider, and D. Jordan, Teaching ordinal patterns to a computer: Efficient encoding algorithms based on the Lehmer code, \ Entropy 21, 1023 (2019)

    2019

  71. [79]

    Pessa and H.V

    A.A.B. Pessa and H.V. Ribeiro, ordpy: A Python package for data analysis with permutation entropy and ordinal network methods, \ Chaos 31, 063110 (2021)

    2021

  72. [80]

    Silbernagel and C.H

    A. Silbernagel and C.H. Wei , The joint asymptotic distribution of entropy and complexity, Chaos 36, 023145 (2026)

    2026

  73. [81]

    Cicirello, Kendall tau sequence distance: Extending Kendall tau from ranks to sequences

    V.A. Cicirello, Kendall tau sequence distance: Extending Kendall tau from ranks to sequences. \ arXiv:1905.02752v3, 2019

    1905

Pith tools

Reviewed June 29, 2026 · model on record in the stance chip above.