English

The Entropy of Conditional Markov Trajectories

Information Theory 2016-11-18 v2 math.IT Applications

Abstract

To quantify the randomness of Markov trajectories with fixed initial and final states, Ekroot and Cover proposed a closed-form expression for the entropy of trajectories of an irreducible finite state Markov chain. Numerous applications, including the study of random walks on graphs, require the computation of the entropy of Markov trajectories conditioned on a set of intermediate states. However, the expression of Ekroot and Cover does not allow for computing this quantity. In this paper, we propose a method to compute the entropy of conditional Markov trajectories through a transformation of the original Markov chain into a Markov chain that exhibits the desired conditional distribution of trajectories. Moreover, we express the entropy of Markov trajectories - a global quantity - as a linear combination of local entropies associated with the Markov chain states.

Keywords

Cite

@article{arxiv.1212.2831,
  title  = {The Entropy of Conditional Markov Trajectories},
  author = {Mohamed Kafsi and Matthias Grossglauser and Patrick Thiran},
  journal= {arXiv preprint arXiv:1212.2831},
  year   = {2016}
}

Comments

Accepted for publication in IEEE Transactions on Information Theory

R2 v1 2026-06-21T22:53:16.714Z