A General Symbolic Approach to Kolmogorov-Sinai Entropy

It is popular to study a time-dependent nonlinear system by encoding outcomes of measurements into sequences of symbols following certain symbolization schemes. Mostly, symbolizations by threshold crossings or variants of it are applied, but also, the relatively new symbolic approach, which goes back to innovative works of Bandt and Pompe—ordinal symbolic dynamics—plays an increasing role. In this paper, we discuss both approaches novelly in one breath with respect to the theoretical determination of the Kolmogorov-Sinai entropy (KS entropy). For this purpose, we propose and investigate a unifying approach to formalize symbolizations. By doing so, we can emphasize the main advantage of the ordinal approach if no symbolization scheme can be found that characterizes KS entropy directly: the ordinal approach, as well as generalizations of it provide, under very natural conditions, a direct route to KS entropy by default.

[1]  C. Finney,et al.  A review of symbolic analysis of experimental data , 2003 .

[2]  Asok Ray,et al.  Unsupervised Symbolization of Signal Time Series for Extraction of the Embedded Information , 2017, Entropy.

[3]  Annette Witt,et al.  Measures of complexity in signal analysis , 1996 .

[4]  Inga Stolz,et al.  Permutation Entropy: New Ideas and Challenges , 2017, Entropy.

[5]  A. Cantón,et al.  Borel images and analytic functions , 2004 .

[6]  Jürgen Elstrodt,et al.  Maß-und Integrationstheorie , 1996 .

[7]  K. Keller,et al.  Kolmogorov-Sinai entropy via separation properties of order-generated $\sigma$-algebras , 2013, 1304.4450.

[8]  R. Steuer,et al.  Entropy and optimal partition for data analysis , 2001 .

[9]  Yonatan Gutman,et al.  Takens' embedding theorem with a continuous observable , 2015, 1510.05843.

[10]  Karsten Keller,et al.  Ordinal symbolic analysis and its application to biomedical recordings , 2015, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[11]  Y. Lai,et al.  What symbolic dynamics do we get with a misplaced partition? On the validity of threshold crossings analysis of chaotic time-series , 2001 .

[12]  Massimiliano Zanin,et al.  Permutation Entropy and Its Main Biomedical and Econophysics Applications: A Review , 2012, Entropy.

[13]  Karsten Keller,et al.  On the relation of KS entropy and permutation entropy , 2012, 1407.6473.

[14]  F. Takens.  Detecting strange attractors in turbulence , 1981 .

[15]  B. Pompe,et al.  Permutation entropy: a natural complexity measure for time series. , 2002, Physical review letters.

[16]  K. Keller,et al.  ENTROPY DETERMINATION BASED ON THE ORDINAL STRUCTURE OF A DYNAMICAL SYSTEM , 2015, 1502.01309.

[17]  N. Packard,et al.  Symbolic dynamics of noisy chaos , 1983 .

[18]  C. Letellier.  Symbolic sequence analysis using approximated partition , 2008 .

[19]  M. Mirzakhani,et al.  Introduction to Ergodic theory , 2010 .

[20]  Matthew B Kennel,et al.  Estimating good discrete partitions from observed data: symbolic false nearest neighbors. , 2003, Physical review letters.