Topological Permutation Entropy
Permutation entropy, as conventional entropy, comes in the metric version (Chap. 6) and in the topological version (this chapter). Topological permutation entropy was also introduced by Bandt et al.  , together with metric permutation entropy. Let us stress once more that the concept of metric permutation entropy of a map introduced in the last chapter differs from the original one, the difference consisting basically in the order of an iterated limit (first the length of the orbit, then the precision of the measurement, as in the definition of the Kolmogorov–Sinai entropy). This technical change made possible to generalize one of the main results of , namely, the equality of metric entropy and metric permutation entropy for piecewise monotone maps on one-dimensional intervals to higher dimensions at the expense of requiring ergodicity (Theorem 10).
KeywordsTopological Entropy Symbolic Dynamic Oriented Graph Outgrowth Ratio Permutation Entropy
Unable to display preview. Download preview PDF.
- 49.A. Chao, Nonparametric estimation of the number of classes in a population, Scandinavian Journal of Statistics, Theory and Applications 9 (1984) 265–270.Google Scholar
- 115.S. Katok, p-adic Analysis compared with real. American Mathematical Society, Providence, 2007.Google Scholar
- 156.M. Misiurewicz, Strange attractors for the Lozi mappings. In: R.G. Helleman (Ed.), Nonlinear Dynamics, Vol. 357, pp. 348–358 The New York Academy of Science, New York 1980.Google Scholar
- 186.C.E. Shannon, A mathematical theory of communication, Bell System Technical Journal 27 (1948) 379–423, 623–653.Google Scholar
- 202.P. Walters, An Introduction to Ergodic Theory. Springer Verlag, New York, 2000.Google Scholar