The permutation entropy rate equals the metric entropy rate for ergodic information sources and ergodic dynamical systems

Abstract

Permutation entropy quantifies the diversity of possible orderings of the values a random or deterministic system can take, as Shannon entropy quantifies the diversity of values. We show that the metric and permutation entropy rates--measures of new disorder per new observed value--are equal for ergodic finite-alphabet information sources (discrete-time stationary stochastic processes). With this result, we then prove that the same holds for deterministic dynamical systems defined by ergodic maps on $n$% -dimensional intervals. This result generalizes a previous one for piecewise monotone interval maps on the real line (Bandt, Keller and Pompe, "Entropy of interval maps via permutations",\textit{Nonlinearity} \textbf{15}, 1595-602, (2002)), at the expense of requiring ergodicity and using a definition of permutation entropy rate differing in the order of two limits. The case of non-ergodic finite-alphabet sources is also studied and an inequality developed. Finally, the equality of permutation and metric entropy rates is extended to ergodic non-discrete information sources when entropy is replaced by differential entropy in the usual way.

Cited by in corpus (22)

• Forbidden patterns in financial time series
• Partial Transfer Entropy on Rank Vectors
• Quantifying the dynamical complexity of time series
• Kolmogorov-Sinai entropy from the ordinal viewpoint
• Anomaly Detection in Paleoclimate Records using Permutation Entropy
• On the Relation of KS Entropy and Permutation Entropy
• Causation entropy from symbolic representations of dynamical systems
• Permutation Complexity via Duality between Values and Orderings
• Numerical and experimental study of the effects of noise on the permutation entropy
• Forbidden ordinal patterns in higher dimensional dynamics
• Measuring information transfer in a soft robotic arm
• An approach to comparing Kolmogorov-Sinai and permutation entropy
• Entropy determination based on the ordinal structure of a dynamical system
• Kolmogorov-Sinai entropy via separation properties of order-generated sigma-algebras
• Permutation Complexity and Coupling Measures in Hidden Markov Models
• Permutation Excess Entropy and Mutual Information between the Past and Future
• Time series classification based on triadic time series motifs
• Including the magnitude variability of a signal into the ordinal pattern analysis
• Input-Output Optics as a Causal Time Series Mapping: A Generative Machine Learning Solution
• Composition law of cardinal order permutations
• Forbidden patterns and shift systems
• Equality of Kolmogorov-Sinai and permutation entropy for one-dimensional maps consisting of countably many monotone parts