Abstract
In the past decade, it has been shown through both theoretical and practical studies of permutation entropies that complexity of time series can be captured by order relations between numerical values. In this paper, we investigate a generalisation of permutation entropies in terms of the order structure for further understanding of their nature. To calculate conventional permutation entropies of time series, one needs to assume a total order on the alphabet. We generalise this to an arbitrary partial order; that is, the alphabet is assumed to be a partially ordered set, and we introduce partially ordered permutation entropies. The relationship between entropies and their partial-order analogues for discrete-time finite-alphabet stationary stochastic processes is theoretically studied. We will show that the entropy rate and its partial-order analogues are equal without restriction, whereas equalities between excess entropy and partial-order analogues depend on asymmetry of the order structure of the alphabet. As all finite totally ordered sets are asymmetric, our results explain one reason why conventional permutation entropies are so effective.
Graphical abstract
Similar content being viewed by others
References
C. Bandt, B. Pompe, Phys. Rev. Lett. 88, 174102 (2002)
J.M. Amigó, Permutation Complexity in Dynamical Systems (Springer-Verlag, Berlin, Heidelberg, 2010)
J.M. Amigó, K. Keller, Eur. Phys. J. Special Topics 222, 263 (2013)
M. Zanin, L. Zunino, O. Rosso, D. Papo, Entropy 14, 1553 (2012)
J.M. Amigó, K. Keller, V.A. Unakafova, Philos. Trans. R. Soc. A 373, 20140091 (2015)
K. Keller, T. Mangold, I. Stolz, J. Werner, Entropy 19, 134 (2017)
J.M. Amigó, M.B. Kennel, L. Kocarev, Physica D 210, 77 (2005)
J.M. Amigó, Physica D 241, 789 (2012)
J.P. Crutchfield, D.P. Feldman, Chaos 15, 25 (2003)
T. Schreiber, Phys. Rev. Lett. 85, 461 (2000)
M. Staniek, K. Lehnertz, Phys. Rev. Lett. 100, 158101 (2008)
T. Haruna, K. Nakajima, Physica D 240, 1370 (2011)
T. Haruna, K. Nakajima, Eur. Phys. J. B 86, 230 (2013)
T. Haruna, K. Nakajima, Entropy 15, 3910 (2013)
T. Haruna, K. Nakajima, Eur. Phys. J. Special Topics 222, 383 (2013)
T. Haruna, K. Nakajima, Int. J. Comput. Ant. Syst. 26, 197 (2014)
R. Monetti, W. Bunk, T. Aschenbernner, F. Jamitzky, Phys. Rev. E 79, 046207 (2009)
J.M. Amigó, R. Monetti, T. Aschenbernner, W. Bunk, Chaos 22, 013105 (2012)
R. Monetti, W. Bunk, T. Aschenbernner, S. Springer, J.M. Amigó, Phys. Rev. E 88, 022911 (2013)
J.M. Amigó, T. Aschenbernner, W. Bunk, R. Monetti, Inf. Sci. 278, 298 (2014)
C. Bian, C. Qin, Q.D.Y. Ma, Q. Shen, Phys. Rev. E 85, 021906 (2012)
T. Haruna, Physica D 388, 40 (2019)
T.M. Cover, J.A. Thomas, Elements of Information Theory (John Wiley & Sons, Inc., NY, 1991)
P. Grassberger, Int. J. Theor. Phys. 25, 907 (1986)
R. Shaw, The Dripping Faucet as a Model Chaotic System (Aerial Press, Santa Cruz, California, 1984)
W. Bialek, I. Nemenman, N. Tishby, Neural Comput. 13, 2409 (2001)
W. Li, Complex Syst. 5, 381 (1991)
D.V. Arnold, Complex Syst. 10, 143 (1996)
B.S.W. Schröder, Ordered Sets: An Introduction (Springer Science+Business Media, New York, 2003)
R.B. Ash, Information Theory (Interscience Publishers, NY, 1965)
B.D.O. Anderson, Math. Control Signals Syst. 12, 80 (1999)
P. Walters, An Introduction to Ergodic Theory (Springer-Verlag, New York, 1982)
D. Kugiumtzis, J. Nonlinear Syst. Appl. 3, 73 (2012)
B. Pompe, J. Runge, Phys. Rev. E 83, 051122 (2011)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Haruna, T. Partially ordered permutation entropies. Eur. Phys. J. B 92, 81 (2019). https://doi.org/10.1140/epjb/e2019-90422-6
Received:
Revised:
Published:
DOI: https://doi.org/10.1140/epjb/e2019-90422-6