Computer Science – Information Theory
Scientific paper
2007-09-08
SIAM J. Discrete Math. 2011, Vol 25, Issue 2, pp. 989-1011
Computer Science
Information Theory
28 pages, 2 figures. Submitted to SIAM journal on Discrete Mathematics on March 19, 2009; accepted for publication (in revised
Scientific paper
10.1137/090753115
We consider the general problem of finding the minimum weight $\bm$-matching on arbitrary graphs. We prove that, whenever the linear programming (LP) relaxation of the problem has no fractional solutions, then the belief propagation (BP) algorithm converges to the correct solution. We also show that when the LP relaxation has a fractional solution then the BP algorithm can be used to solve the LP relaxation. Our proof is based on the notion of graph covers and extends the analysis of (Bayati-Shah-Sharma 2005 and Huang-Jebara 2007}. These results are notable in the following regards: (1) It is one of a very small number of proofs showing correctness of BP without any constraint on the graph structure. (2) Variants of the proof work for both synchronous and asynchronous BP; it is the first proof of convergence and correctness of an asynchronous BP algorithm for a combinatorial optimization problem.
Bayati Mohsen
Borgs Christian
Chayes Jennifer
Zecchina Riccardo
No associations
LandOfFree
Belief-Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Belief-Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Belief-Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-44361