English

Computing loop corrections by message passing

Statistical Mechanics 2015-06-12 v3 Disordered Systems and Neural Networks Data Structures and Algorithms

Abstract

Any spanning tree in a loopy interaction graph can be used for communicating the effect of the loopy interactions by introducing messages that are passed along the edges in the spanning tree. This defines an exact mapping of the problem on the loopy interaction graph onto an extended problem on a tree interaction graph, where the thermodynamic quantities can be computed by a message-passing algorithm based on the Bethe equations. We propose an approximation loop correction algorithm for the Ising model relying on the above representation of the problem. The algorithm deals at the same time with the short and long loops, and can be used to obtain upper and lower bounds for the free energy.

Keywords

Cite

@article{arxiv.1211.6969,
  title  = {Computing loop corrections by message passing},
  author = {A. Ramezanpour},
  journal= {arXiv preprint arXiv:1211.6969},
  year   = {2015}
}

Comments

12 pages, 4 figures, a bit expanded and typos corrected

R2 v1 2026-06-21T22:46:14.505Z