A generalized permutation entropy for noisy dynamics and random processes

Permutation entropy measures the complexity of a deterministic time series via a data symbolic quantization consisting of rank vectors called ordinal patterns or simply permutations. Reasons for the increasing popularity of this entropy in time series analysis include that (i) it converges to the Kolmogorov-Sinai entropy of the underlying dynamics in the limit of ever longer permutations and (ii) its computation dispenses with generating and ad hoc partitions. However, permutation entropy diverges when the number of allowed permutations grows super-exponentially with their length, as happens when time series are output by dynamical systems with observational or dynamical noise or purely random processes. In this paper, we propose a generalized permutation entropy, belonging to the class of group entropies, that is finite in that situation, which is actually the one found in practice. The theoretical results are illustrated numerically by random processes with short- and long-term dependencies, as well as by noisy deterministic signals.

Automated summary

Permutation entropy is a method to measure the complexity of deterministic time series through data symbolic quantization, and is increasingly popular due to its convergence properties and computational efficiency. However, it may diverge in certain scenarios, but a generalized permutation entropy proposed in this paper addresses this issue and has been shown to be practical and effective in numerical simulations.