Symbolic transfer entropy rate is equal to transfer entropy rate for bivariate finite-alphabet stationary ergodic Markov processes

DOI10.1140/epjb/e2013-30721-4zbMath1515.60081arXiv1112.2493OpenAlexW2044628814WikidataQ105584164 ScholiaQ105584164MaRDI QIDQ6176782

Taichi Haruna, Kohei Nakajima

Publication date: 26 July 2023

Published in: The European Physical Journal B. Condensed Matter and Complex Systems (Search for Journal in Brave)

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

zbMATH Keywords

statistical and nonlinear physics

Mathematics Subject Classification ID

Stationary stochastic processes (60G10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Statistical aspects of information-theoretic topics (62B10)

Related Items

Causation entropy from symbolic representations of dynamical systems, Partially ordered permutation entropies

Cites Work

• The equality of Kolmogorov-Sinai entropy and metric permutation entropy generalized
• Permutation complexity via duality between values and orderings
• Permutation complexity in dynamical systems. Ordinal patterns, permutation entropy and all that
• Kolmogorov-Sinai entropy from the ordinal viewpoint
• Toward a quantitative theory of self-generated complexity
• On the relation of KS entropy and permutation entropy
• Topological permutation entropy
• Information flow during the quantum-classical transition
• The permutation entropy rate equals the metric entropy rate for ergodic information sources and ergodic dynamical systems
• Predictability, Complexity, and Learning
• Order Patterns in Time Series
• Independent coordinates for strange attractors from mutual information
• Permutations and topological entropy for interval maps
• Entropy of interval maps via permutations
• Regularities unseen, randomness observed: Levels of entropy convergence
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item