On Information-Theoretic Characterizations of Markov Random Fields and Subfields

DOI10.1109/TIT.2018.2866564MaRDI QIDQ4629911zbMATH OpenFDO

Authors

Publication date 28 March 2019

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Applications of graph theory (05C90) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Multivariate analysis (62H99) Information theory (general) (94A15) Measures of information, entropy (94A17)

Abstract: Let $X_i,iinV$ form a Markov random field (MRF) represented by an undirected graph $G=(V,E)$, and $V^{\prime }$ be a subset of $V$. We determine the smallest graph that can always represent the subfield $X_i,iin{V}^{\prime }$ as an MRF. Based on this result, we obtain a necessary and sufficient condition for a subfield of a Markov tree to be also a Markov tree. When $G$ is a path so that $X_i,iinV$ form a Markov chain, it is known that the $I$-Measure is always nonnegative and the information diagram assumes a very special structure Kawabata and Yeung (1992). We prove that Markov chain is essentially the only MRF such that the $I$-Measure is always nonnegative. By applying our characterization of the smallest graph representation of a subfield of an MRF, we develop a recursive approach for constructing information diagrams for MRFs. Our work is built on the set-theoretic characterization of an MRF in Yeung, Lee, and Ye (2002).

Cited in

(4)

• Information-theoretic characterizations of conditional mutual independence and Markov random fields
• Characterisation of conditional independence structures for polymatroids using vanishing sets.
• Estimation of average differential entropy for a stationary ergodic space-time random field on a bounded area
• The asymptotic equipartition property for a special Markov random field

This page was built for publication: On Information-Theoretic Characterizations of Markov Random Fields and Subfields

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