Permutation complexity

guillefix 4th November 2016 at 2:43pm

See Descriptional complexity

See Permutation complexity in dynamical systems

Permutation entropy was introduced in 2002 by C. Bandt and B. Pompe as a measure of complexity in time series. In a nutshell, permutation entropy replaces the probabilities of length-L symbol blocks in the definition of the Shannon entropy by the probabilities of length-L Ordinal patterns.

Permutation Complexity Related to the Letter Doubling Map