A decomposition theorem for binary Markov random fields

DOI10.1214/AOP/1176992084MaRDI QIDQ580816zbMATH OpenOpenAlexFDO

Authors Bruce Hajek, Toby Berger

Publication date 1987

Published in The Annals of Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1214/aop/1176992084

zbMATH Keywords

communication theoryGibbs random fieldIsing modelMarkov random fieldrate-distortion functionstatistical physics

Mathematics Subject Classification ID

Random fields (60G60) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Rate-distortion theory in information and communication theory (94A34)

Review text

Consider a binary Markov random field whose neighbor structure is specified by a countable graph with nodes of uniformly bounded degree. Under a minimal assumption we prove a decomposition theorem to the effect that such a Markov random field can be represented as the nodewise modulo 2 sum of two independent binary random fields, one of which is white binary noise of positive weight. Said decomposition provides the information theorist with an exact expression for the per-site rate-distortion function of the random field over an interval of distortions not exceeding this weight. We mention possible implications for communication theory, probability theory and statistical physics.

Recommendations

• scientific article; zbMATH DE number 4102210
• Decomposition of binary random fields and zeros of partition functions
• The Decomposition-Separation Theorem for Finite Nonhomogeneous Markov Chains and Related Problems
• Estimating a separably Markov random field from binary observations
• A martingale decomposition of discrete Markov chains
• Markov bases for decomposable graphical models
• scientific article; zbMATH DE number 2141145
• Approximate computations for binary Markov random fields and their use in Bayesian models
• The Complexity of Distinguishing Markov Random Fields

Cited in

(4)

• Decomposition of binary random fields and zeros of partition functions
• On the matrix apparatus for elementary Markov fields
• Refinements of stochastic domination
• scientific article; zbMATH DE number 4102210 (Why is no real title available?)

This page was built for publication: A decomposition theorem for binary Markov random fields

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