Permutation group entropy: a new route to complexity for real-valued processes

Abstract

This is a review of group entropy and its application to permutation complexity. Specifically we revisit a new approach to the notion of complexity in time serie analysis, based on both permutation entropy and group entropy. As a result, the permutation entropy rate can be extended from deterministic dynamics to random processes. More generally, our approach provides a unified framework to discuss chaotic and random behaviours.

arXiv comment24 pages; 4 figures

References in corpus (14)

• A computable measure of entanglement
• Statistical mechanics in the context of special relativity
• Group entropies, correlation laws and zeta functions
• Theory of Cross Phenomena and Their Coefficients Beyond Onsager Theorem
• Maximum Entropy Principle in statistical inference: case for non-Shannonian entropies
• Uniqueness and characterization theorems for generalized entropies
• Formal Groups and $Z$-Entropies
• Generalized Shannon-Khinchin Axioms and Uniqueness Theorem for Pseudo-additive Entropies
• Forbidden ordinal patterns in higher dimensional dynamics
• Group entropies: from phase space geometry to entropy functionals via group theory
• On entropy, entropy-like quantities, and applications
• A generalized permutation entropy for random processes
• Multivariate Group Entropies, Super-exponentially Growing Complex Systems and Functional Equations
• A new class of entropic information measures, formal group theory and information geometry