Belief Propagation for Graph Partitioning
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F10%3A00170057" target="_blank" >RIV/68407700:21340/10:00170057 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Belief Propagation for Graph Partitioning
Original language description
We study the belief-propagation algorithm for the graph bi-partitioning problem, i.e. the ground state of the ferromagnetic Ising model at a fixed magnetization. Application of a message passing scheme to a model with a fixed global parameter is not banal and we show that the magnetization can in fact be fixed in a local way within the belief-propagation equations. Our method provides the full phase diagram of the bi-partitioning problem on random graphs, as well as an efficient heuristic solver that weanticipate to be useful in a wide range of application of the partitioning problem.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BE - Theoretical physics
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2010
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
Journal of Physics A: Mathematical and Theoretical
ISSN
1751-8113
e-ISSN
—
Volume of the periodical
43
Issue of the periodical within the volume
28
Country of publishing house
GB - UNITED KINGDOM
Number of pages
17
Pages from-to
—
UT code for WoS article
000279003200003
EID of the result in the Scopus database
—