Generalisation of the Hammersley-Clifford theorem on bipartite graphs

DOI10.1090/TRAN/6899MaRDI QIDQ5348734zbMATH OpenOpenAlexFDO

Authors Nishant Chandgotia

Publication date 21 August 2017

Published in Transactions of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

dismantlablefoldingGibbs statesHammersley-CliffordMarkov random fieldsnearest neighbour interactionsymbolic dynamics

Mathematics Subject Classification ID

Symbolic dynamics (37B10) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Abstract: The Hammersley-Clifford theorem states that if the support of a Markov random field has a safe symbol then it is a Gibbs state with some nearest neighbour interaction. In this paper we generalise the theorem with an added condition that the underlying graph is bipartite. Taking inspiration from "Gibbs Measures and Dismantlable Graphs" by Brightwell and Winkler we introduce a notion of folding for configuration spaces called strong config-folding proving that if all Markov random fields supported on $X$ are Gibbs with some nearest neighbour interaction so are Markov random fields supported on the 'strong config-folds' and 'strong config-unfolds' of $X$.

Recommendations

• Markov random fields, Markov cocycles and the 3-colored chessboard
• New models for Markov random fields
• Gibbs measures and Markov random fields with association. I
• About Markov, Gibbs, \dots gauge theory \dots finance
• scientific article; zbMATH DE number 3994718

Cites work

• An Introduction to Symbolic Dynamics and Coding
• Four-cycle free graphs, height functions, the pivot property and entropy minimality
• Gibbs measures and dismantlable graphs
• Gibbs measures and phase transitions
• Gibbs States on Countable Sets
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• scientific article; zbMATH DE number 3294019 (Why is no real title available?)
• Markov random fields, Markov cocycles and the 3-colored chessboard
• On the toric algebra of graphical models
• One-dimensional Markov random fields, Markov chains and topological Markov fields
• Symmetric Gibbs measures
• Vertex-to-vertex pursuit in a graph

Cited in

(3)

• Gibbsian representations of continuous specifications: the theorems of Kozlov and Sullivan revisited
• Four-cycle free graphs, height functions, the pivot property and entropy minimality
• Markov random fields, Markov cocycles and the 3-colored chessboard

This page was built for publication: Generalisation of the Hammersley-Clifford theorem on bipartite graphs

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