Shared Information for a Markov Chain on a Tree
Lists
Only you see this
Abstract
Shared information is a measure of mutual dependence among multiple jointly distributed random variables with finite alphabets. For a Markov chain on a tree with a given joint distribution, we give a new proof of an explicit characterization of shared information. The Markov chain on a tree is shown to possess a global Markov property based on graph separation; this property plays a key role in our proofs. When the underlying joint distribution is not known, we exploit the special form of this characterization to provide a multiarmed bandit algorithm for estimating shared information, and analyze its error performance.
BibTeX
@article{bhattacharya2024shared,
author = {Sagnik Bhattacharya and Prakash Narayan},
title = {{Shared Information for a Markov Chain on a Tree}},
journal = {IEEE Trans. Information Theory},
year = {2024},
doi = {10.1109/tit.2024.3353769},
}Loading related content...