Permutation complexity via duality between values and orderings
From MaRDI portal
(Redirected from Publication:720701)
Abstract: We study the permutation complexity of finite-state stationary stochastic processes based on a duality between values and orderings between values. First, we establish a duality between the set of all words of a fixed length and the set of all permutations of the same length. Second, on this basis, we give an elementary alternative proof of the equality between the permutation entropy rate and the entropy rate for a finite-state stationary stochastic processes first proved in [Amigo, J.M., Kennel, M. B., Kocarev, L., 2005. Physica D 210, 77-95]. Third, we show that further information on the relationship between the structure of values and the structure of orderings for finite-state stationary stochastic processes beyond the entropy rate can be obtained from the established duality. In particular, we prove that the permutation excess entropy is equal to the excess entropy, which is a measure of global correlation present in a stationary stochastic process, for finite-state stationary ergodic Markov processes.
Recommendations
- Permutation complexity and coupling measures in hidden Markov models
- Partially ordered permutation entropies
- The permutation entropy rate equals the metric entropy rate for ergodic information sources and ergodic dynamical systems
- Permutation complexity in dynamical systems. Ordinal patterns, permutation entropy and all that
- Topological permutation entropy
Cites work
- scientific article; zbMATH DE number 3745547 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 1216133 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- Entropy of interval maps via permutations
- Kolmogorov-Sinai entropy from the ordinal viewpoint
- Permutation complexity in dynamical systems. Ordinal patterns, permutation entropy and all that
- Permutation complexity via duality between values and orderings
- Permutations and topological entropy for interval maps
- Regularities unseen, randomness observed: Levels of entropy convergence
- The number of permutations realized by a shift
- The permutation entropy rate equals the metric entropy rate for ergodic information sources and ergodic dynamical systems
- Topological permutation entropy
- Toward a quantitative theory of self-generated complexity
Cited in
(9)- Partially ordered permutation entropies
- Permutation complexity and coupling measures in hidden Markov models
- Symbolic transfer entropy rate is equal to transfer entropy rate for bivariate finite-alphabet stationary ergodic Markov processes
- Ordinal methods: concepts, applications, new developments, and challenges -- in memory of Karsten Keller (1961--2022)
- Complexity of couplings in multivariate time series via ordinal persistent homology
- Permutation complexity via duality between values and orderings
- The equality of Kolmogorov-Sinai entropy and metric permutation entropy generalized
- Partially ordered permutation complexity of coupled time series
- On the relation of KS entropy and permutation entropy
This page was built for publication: Permutation complexity via duality between values and orderings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q720701)