arXiv Open Access 2023

Shared Information for a Markov Chain on a Tree

Sagnik Bhattacharya Prakash Narayan

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.IT

Penulis (2)

Sagnik Bhattacharya

Prakash Narayan

Format Sitasi

APA MLA BibTeX

Bhattacharya, S., Narayan, P. (2023). Shared Information for a Markov Chain on a Tree. https://arxiv.org/abs/2307.15844

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2023
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓