Sufficient conditions for convergence of loopy belief propagation

  • Mooij J
  • Kappen H
  • 41


    Mendeley users who have this article in their library.
  • 0


    Citations of this article.


We derive novel sufficient conditions for convergence of Loopy Belief Propagation (also known as the Sum-Product algorithm) to a unique fixed point. Our results improve upon previously known conditions. For binary variables with (anti-)ferromagnetic interactions, our conditions seem to be sharp.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Joris Mooij

  • Hilbert J. Kappen

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free