Gibbs Random Fields and Markov Random Fields with Constraints
Levent Onural

TL;DR
This paper provides a simpler proof of the equivalence between Gibbs and Markov random fields, extending it to cases with constraints and infinite fields, simplifying understanding of their relationship.
Contribution
It introduces a straightforward proof of the Gibbs-Markov equivalence that includes constrained and infinite random fields, broadening the theoretical framework.
Findings
Simplified proof of Gibbs-Markov equivalence
Extension to constrained random fields with zero probabilities
Applicability to infinite random fields
Abstract
It was shown many times in the literature that a Markov random field is equivalent to a Gibbs random field when all realizations of the field have non-zero probabilities; the proofs are rather complicated. A simpler proof, which is based directly on simple probability theory, is presented. Furthermore, it is shown that the equivalence is still valid when there are constraints (zero probability realizations) of any type. The equivalence extends to infinite size random fields, as well.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Gaussian Processes and Bayesian Inference · Financial Risk and Volatility Modeling
