Permutation complexity and coupling measures in hidden Markov models

DOI10.3390/E15093910MaRDI QIDQ280589zbMATH OpenOpenAlexFDO

Authors Taichi Haruna, Kohei Nakajima

Publication date 10 May 2016

Published in Entropy (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1204.1821

zbMATH Keywords

dualitypermutation entropydirected informationexcess entropytransfer entropy

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Measures of information, entropy (94A17) Stationary stochastic processes (60G10)

Abstract: In [Haruna, T. and Nakajima, K., 2011. Physica D 240, 1370-1377], the authors introduced the duality between values (words) and orderings (permutations) as a basis to discuss the relationship between information theoretic measures for finite-alphabet stationary stochastic processes and their permutation analogues. It has been used to give a simple proof of the equality between the entropy rate and the permutation entropy rate for any finite-alphabet stationary stochastic process and show some results on the excess entropy and the transfer entropy for finite-alphabet stationary ergodic Markov processes. In this paper, we extend our previous results to hidden Markov models and show the equalities between various information theoretic complexity and coupling measures and their permutation analogues. In particular, we show the following two results within the realm of hidden Markov models with ergodic internal processes: the two permutation analogues of the transfer entropy, the symbolic transfer entropy and the transfer entropy on rank vectors, are both equivalent to the transfer entropy if they are considered as the rates, and the directed information theory can be captured by the permutation entropy approach.

Recommendations

• Permutation complexity via duality between values and orderings
• Symbolic transfer entropy rate is equal to transfer entropy rate for bivariate finite-alphabet stationary ergodic Markov processes
• The permutation entropy rate equals the metric entropy rate for ergodic information sources and ergodic dynamical systems
• Partially ordered permutation entropies
• Partially ordered permutation complexity of coupled time series

Cites work

• scientific article; zbMATH DE number 3745547 (Why is no real title available?)
• scientific article; zbMATH DE number 1098622 (Why is no real title available?)
• scientific article; zbMATH DE number 821244 (Why is no real title available?)
• A standardized approach to the Kolmogorov–Sinai entropy
• Entropy of interval maps via permutations
• Information transfer in continuous processes
• Kolmogorov-Sinai entropy from the ordinal viewpoint
• On the relation of KS entropy and permutation entropy
• Permutation complexity via duality between values and orderings
• Permutations and the Kolmogorov-Sinai entropy
• Predictability, complexity, and learning
• Regularities unseen, randomness observed: Levels of entropy convergence
• The equality of Kolmogorov-Sinai entropy and metric permutation entropy generalized
• The permutation entropy rate equals the metric entropy rate for ergodic information sources and ergodic dynamical systems
• The realization problem for hidden Markov models
• Toward a quantitative theory of self-generated complexity

Cited in

(4)

• Partially ordered permutation entropies
• Assessing directionality and strength of coupling through symbolic analysis: an application to epilepsy patients
• Permutation complexity via duality between values and orderings
• Partially ordered permutation complexity of coupled time series

This page was built for publication: Permutation complexity and coupling measures in hidden Markov models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q280589)