Conditional entropy of ordinal patterns

Citations of this article
Mendeley users who have this article in their library.
Get full text


In this paper we investigate a quantity called conditional entropy of ordinal patterns, akin to the permutation entropy. The conditional entropy of ordinal patterns describes the average diversity of the ordinal patterns succeeding a given ordinal pattern. We observe that this quantity provides a good estimation of the Kolmogorov-Sinai entropy in many cases. In particular, the conditional entropy of ordinal patterns of a finite order coincides with the Kolmogorov-Sinai entropy for periodic dynamics and for Markov shifts over a binary alphabet. Finally, the conditional entropy of ordinal patterns is computationally simple and thus can be well applied to real-world data.©2013 Elsevier B.V. All rights reserved.




Unakafov, A. M., & Keller, K. (2014). Conditional entropy of ordinal patterns. Physica D: Nonlinear Phenomena, 269, 94–102.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free