A Class of Random Fields on Complete Graphs with Tractable Partition Function
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F13%3A00206477" target="_blank" >RIV/68407700:21230/13:00206477 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1109/TPAMI.2013.99" target="_blank" >http://dx.doi.org/10.1109/TPAMI.2013.99</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/TPAMI.2013.99" target="_blank" >10.1109/TPAMI.2013.99</a>
Alternative languages
Result language
angličtina
Original language name
A Class of Random Fields on Complete Graphs with Tractable Partition Function
Original language description
The aim of this short note is to draw attention to a method by which the partition function and marginal probabilities for a certain class of random fields on complete graphs can be computed in polynomial time. This class includes Ising models with homogeneous pairwise potentials but arbitrary (inhomogeneous) unary potentials. Similarly, the partition function and marginal probabilities can be computed in polynomial time for random fields on complete bipartite graphs, provided they have homogeneous pairwise potentials. We expect that these tractable classes of large scale random fields can be very useful for the evaluation of approximation algorithms by providing exact error estimates.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
JD - Use of computers, robotics and its application
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GAP202%2F12%2F2071" target="_blank" >GAP202/12/2071: Structured Statistical Models for Image Understanding</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
IEEE Transactions on Pattern Analysis and Machine Intelligence
ISSN
0162-8828
e-ISSN
—
Volume of the periodical
35
Issue of the periodical within the volume
9
Country of publishing house
US - UNITED STATES
Number of pages
3
Pages from-to
2304-2306
UT code for WoS article
000322029000019
EID of the result in the Scopus database
—