Back to Search
Start Over
On Functions of Markov Random Fields
- Source :
- Proc. IEEE Information Theory Workshop, pp. 316-320, 2021. (c) IEEE
- Publication Year :
- 2020
-
Abstract
- We derive two sufficient conditions for a function of a Markov random field (MRF) on a given graph to be a MRF on the same graph. The first condition is information-theoretic and parallels a recent information-theoretic characterization of lumpability of Markov chains. The second condition, which is easier to check, is based on the potential functions of the corresponding Gibbs field. We illustrate our sufficient conditions at the hand of several examples and discuss implications for practical applications of MRFs. As a side result, we give a partial characterization of functions of MRFs that are information-preserving.<br />Comment: 7 pages, submitted to IEEE Information Theory Workshop
- Subjects :
- Computer Science - Information Theory
Subjects
Details
- Database :
- arXiv
- Journal :
- Proc. IEEE Information Theory Workshop, pp. 316-320, 2021. (c) IEEE
- Publication Type :
- Report
- Accession number :
- edsarx.2005.13908
- Document Type :
- Working Paper
- Full Text :
- https://doi.org/10.1109/ITW46852.2021.9457677