Generalisation of the Hammersley-Clifford theorem on bipartite graphs

DOI10.1090/tran/6899zbMath1374.60191arXiv1406.1849OpenAlexW2963156446MaRDI QIDQ5348734

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

symbolic dynamicsGibbs statesfoldingMarkov random fieldsdismantlableHammersley-Cliffordnearest neighbour interaction

Mathematics Subject Classification ID

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) Symbolic dynamics (37B10)

Related Items (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

Cites Work

• Unnamed Item
• Unnamed Item
• Markov random fields, Markov cocycles and the 3-colored chessboard
• Gibbs measures and phase transitions
• Gibbs measures and dismantlable graphs
• Vertex-to-vertex pursuit in a graph
• On the toric algebra of graphical models
• One-dimensional Markov random fields, Markov chains and topological Markov fields
• Four-cycle free graphs, height functions, the pivot property and entropy minimality
• Gibbs States on Countable Sets
• Symmetric Gibbs measures
• An Introduction to Symbolic Dynamics and Coding

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