Belief propagation for weighted b-matchings on arbitrary graphs and its relation to linear programs with integer solutions

SIAM Journal on Discrete Mathematics

Volumn 25, Issue 2, 2011, Pages 989-1011

  Bayati, Mohsen ^a   Borgs, Christian ^b   Chayes, Jennifer ^b   Zecchina, Riccardo ^c  

^a STANFORD UNIVERSITY   (United States)

^b MICROSOFT RESEARCH   (United Kingdom)

^c POLITECNICO DI TORINO   (Italy)

Author keywords

Belief propagation; Cavity method; Graph cover; Linear program; Matching

Indexed keywords

BELIEF PROPAGATION; CAVITY METHOD; GRAPH COVER; LINEAR PROGRAMS; MATCHING;

ARTIFICIAL INTELLIGENCE; BACKPROPAGATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; CONVERGENCE OF NUMERICAL METHODS; INFORMATION THEORY; LINEAR PROGRAMMING;

INTEGER PROGRAMMING;

EID: 79960613860     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/090753115     Document Type: Article

References (63)

1. D. ACHLIOPTAS AND F. RICCI-TERSENGHI, On the solution-space geometry of random constraint satisfaction problems, in Proceedings of the 38th ACM Symposium on Theory of Computing, 2006.
2. D. ALDOUS, The zeta (2) limit in the random assignment problem, Random Structures Algorithms, 18 (2001), pp. 381-418.
3. S. M. AJI, G. B. HORN, AND R. J. MCELIECE, On the convergence of iterative decoding on graphs with a single cycle, in Proceedings of the IEEE Int. Symp. Information Theory, 1998, p. 276.
4. M. BAYATI AND C. NAIR, A rigorous proof of the cavity method for counting matchings, in Proceedings of the Allerton Conference on Communication, Control and Computing, 2006.
5. M. BAYATI, D. SHAH, AND M. SHARMA, Maximum weight matching via max-product belief propagation, in Proceedings of the IEEE Int. Symp. Information Theory, 2005.
6. M. BAYATI, D. SHAH, AND M. SHARMA, Max-product for maximum weight matching: Convergence, correctness and LP duality, in Proceedings of the IEEE Int. Symp. Information Theory, 2006.
7. M. BAYATI, C. BORGS, J. CHAYES, AND R. ZECCHINA, Belief-propagation for weighted b-matchings on arbitrary graphs and its relation to linear programs with integer solutions, arXiv: 0709.1190, 2007.
8. M. BAYATI, C. BORGS, J. CHAYES, AND R. ZECCHINA, On the exactness of the cavity method for weighted b-matchings on arbitrary graphs and its relation to linear programs, J. Stat. Mech. Theory Exp. (2008), L06001.
9. D. P. BERTSEKAS, The auction algorithm: A distributed relaxation method for the assignment problem, Ann. Oper. Res., 14 (1988), pp. 105-123.
10. S. BOYD AND L. VANDENBERGHE, Convex Optimization, Cambridge University Press, London, 2004.
11. A. BRAUNSTEIN AND R. ZECCHINA, Survey Propagation as local equilibrium equations, J. Stat. Mech. Theory Exp. (2004), 06007.
12. A. BRAUNSTEIN, M. MÉZARD, AND R. ZECCHINA, Survey propagation: An algorithm for satisfiability, Random Structures Algorithms, 27 (2005), pp. 201-226. (Pubitemid 41482546)
13. A. BRAUNSTEIN, R. MULET, A. PAGNANI, M. WEIGT, AND R. ZECCHINA, Polynomial iterative algorithms for coloring and analyzing random graphs, Phys. Rev. E, 68 (2003), 036702.
14. V. CHVATAL, On certain polytopes associated with graphs, J. Combin. Theory Ser. B, 18 (1975), pp. 138-154.
15. J. EDMONDS AND E. JOHNSON, Matching: A well-solved class of integer linear programms, in Combinatorial Structures and their Applications, Calgary International Conference, Gordon and Breach, 1970, pp. 89-92.
16. J. EDMONDS AND R. KARP, Theoretical improvements in algorithmic efficiency for network flow problems, J. ACM, 18 (1972), pp. 264-284.
17. U. FEIGE, E. MOSSEL, AND D. VILENCHIK, Complete convergence of message passing algorithms for some satisfiability problems, in Proceedings of Random 2006, Lect. Notes Comput. Sci. (4110), Springer, Berlin, 2006, pp. 339-350. (Pubitemid 44577543)
18. J. FELDMAN, M. WAINWRIGHT, AND D. KARGER, Using linear programming to decode binary linear codes, IEEE Trans. Inform. Theory, 51 (2005), pp. 954-972. (Pubitemid 40377560)
19. B. FREY AND D. DUECK, Clustering by passing messages between data points, Science, 315 (2007), pp. 972-976. (Pubitemid 46281181)
20. B. J. FREY AND R. KOETTER, Exact inference using the attenuated max-product algorithm, in Adv. Mean Field Methods: Theory and Practice, M. Opper and D. Saad, eds., MIT Press, Cambridge, MA, 2000.
21. N. FRIEDMAN, Inferring cellular networks using probabilistic graphical models, Science, 303 (2004), pp. 799-805. (Pubitemid 38174650)
22. R. G. GALLAGER, Low Density Parity Check Codes, MIT Press, Cambridge, MA, 1963.
23. D. GAMARNIK, T. NOWICKI, AND G. SWIRSCSZ, Maximum weight independent sets and matchings in sparse random graphs: Exact results using the local weak convergence method, Random Structures Algorithms, 28 (2005), pp. 76-106. (Pubitemid 43468942)
24. D. GAMARNIK, D. SHAH, AND W. WEI, Belief propagation for min-cost network flow: Convergence & correctness, in Proceedings of the ACM SIAM Symposium on Discrete Algorithms, 2010.
25. I. GAT-VIKS, A. TANAY, D. RAIJMAN, AND R. SHAMIR, Factor graph network models for biological systems, in Proceedings of the RECOMB 2005, Lecture Notes in Bioinformatics 3500, Springer, Berlin, 2005, pp. 31-47. (Pubitemid 41420652)
26. A. GERARDS, Matching. Handbook of Operation Research and Management Science, Vol. 7, North-Holland, Amsterdam, 1995, pp. 135-224.
27. B. HUANG AND T. JEBARA, Loopy belief propagation for bipartite maximum weight b-matching, in Proceedings of the Eleventh International Conference on Artificial Intelligence and Statistics, 2007.
28. T. JEBARA, MAP estimation, message passing, and perfect graphs, Uncertainty in Artif. Intell., 2009.
29. L. Lovász, Normal hypergraphs and the weak perfect graph conjecture, Discrete Math., 2 (1972), pp. 253-267.
30. E. MANEVA, E. MOSSEL, AND M. J. WAINWRIGHT, A new look at survey propagation and its generalizations, in Proceedings of the ACM SIAM Symposium on Discrete Algorithms, 2005.
31. E. MARINARI, G. SEMERJIAN, AND V. VAN KERREBROECK, Finding long cycles in graphs, Phys. Rev., 75 (2007), 066708.
32. M. MÉZARD AND G. PARISI, Mean-field equations for the matching and travelling salesman problems, Europhys. Lett., 2 (1986), pp. 913-918. (Pubitemid 17509096)
33. M. MÉZARD AND R. ZECCHINA, Random K-satisfiability: From an analytic solution to a new efficient algorithm, Phys. Rev. EI, 66 (2002), 056126.
34. C. MOALLEMI AND B. VAN ROY, Consensus propagation, IEEE Trans. Inform. Theory, 52 (2006), pp. 4753-4766. (Pubitemid 44680572)
35. C. MOALLEMI AND B. VAN ROY, Resource allocation via message passing, INFORMS J. Comput., published online in Articles in Advance, 2010.
36. C. C. MOALLEMI AND B. VAN ROY, Convergence of min-sum message passing for convex optimization, IEEE Trans. Inform. Theory, 56 (2010), pp. 2041-2050.
37. A. MONTANARI, B. PRABHAKAR, AND D. TSE., Belief Propagation Based Multi-User Detection, in Proceedings of the Allerton Conference on Communication, Control, and Computing, 2006.
38. J. PEARL, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, Morgan Kaufmann, San Francisco, CA, 1988.
39. W. PULLEYBLANK, Matchings and Extensions. Handbook of Combinatorics, Vol. 1, North Holland, Amsterdam, 1995, pp. 179-232.
40. M. PRETTI AND M. WEIGT, Sudden emergence of q-regular subgraphs in random graphs, Europhys. Lett., 75 (2006), pp. 8-14. (Pubitemid 44022069)
41. T. RICHARDSON AND R. URBANKE, The capacity of low-density parity check codes under message-passing decoding, IEEE Trans. Inform. Theory, 47 (2001), pp. 599-618. (Pubitemid 32318092)
42. P. RUSMEVICHIENTONG AND B. VAN ROY, An analysis of belief propagation on the turbo decoding graph with gaussian densities, IEEE Trans. Inform. Theory, 47 (2001), pp. 745-765. (Pubitemid 32318101)
43. S. SANGHAVI, Equivalence of LP relaxation and max-product for weighted matching in general graphs, in Proceedings of the IEEE Information Theory Workshop, 2007.
44. S. SANGHAVI, D. MALIOUTOV, AND A. WILLSKY, Linear programming analysis of loopy belief propagation for weighted matching, in Advances in Neural Information Processing Systems 20, J. C. Platt et al., eds., MIT Press, Cambridge, MA, 2008, pp. 1273-1280.
45. S. SANGHAVI, D. SHAH, AND A. WILLSKY, Message passing for max-weight independent set, in Advances in Neural Information Processing Systems 20, J. C. Platt et al., eds., MIT Press, Cambridge, MA, 2008, pp. 1281-1288.
46. A. SCHRIJVER, Combinatorial Optimization, Springer-Verlag, Berlin, 2003.
47. J. SALEZ AND D. SHAH, Optimality of belief propagation for random assignment problem, in Proceedings of the ACM SIAM Symposium on Discrete Algorithms, 2009.
48. M. TAPPEN AND W. FREEMAND, Graph cuts and belief propagation for stereo, using identical MRF parameters, in Proceedings of the 9th IEEE International Conference on Computer Vision, 2003.
49. S. TATIKONDA AND M. I. JORDAN, Loopy belief propagation and Gibbs measures, in Uncertainty in Artificial Intelligence (UAI), Proceedings of the Eighteenth Conference, D. Koller and A. Darwiche, eds., 2002.
50. P. O. VONTOBEL AND R. KOETTER, Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes, arXiv:cs/0512078, 2005.
51. P. O. VONTOBEL AND R. KOETTER, On the relationship between linear programming decoding and min-sum algorithm decoding, in Proceedings of ISITA 2004, Parma, Italy, 2004, pp. 991-996.
52. J. WASTLUND, The traveling salesman problem in the stochastic mean field model, http://www.mai.liu.se/~jowas (2006).
53. M. WAINWRIGHT, T. JAAKKOLA, AND A. WILLSKY, Tree consistency and bounds on the performance of the max-product algorithm and its generalizations, Stat. Comput., 14 (2004), pp. 143-166. (Pubitemid 39051297)
54. M. WAINWRIGHT, T. JAAKKOLA, AND A. WILLSKY, A new class of upper bounds on the log partition function, IEEE Trans. Inform. Theory, 51 (2005), pp. 2313-2335. (Pubitemid 41136395)
55. M. WAINWRIGHT, T. JAAKKOLA, AND A. WILLSKY, MAP estimation via agreement on trees: Message-passing and linear programming, IEEE Trans. Inform. Theory, 51 (2005), pp. 3697-3711.
56. Y. WEISS, Correctness of local probability propagation in graphical models with loops, Neural Comput., 12 (2000), pp. 1-42.
57. Y. WEISS AND W. FREEMAN, Correctness of belief propagation in Gaussian graphical models of arbitrary topology, Neural Comput., 13 (2001), pp. 2173-2200. (Pubitemid 33676880)
58. Y. WEISS AND W. T. FREEMAN, On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs, IEEE Trans. Inform. Theory, 47 (2001), p. 2.
59. Y. WEISS, C. YANOVER, AND T. MELTZER, MAP Estimation, Linear Programming and Belief Propagation with Convex Free Energies, in Proceedings of the UAI, 2007.
60. N. WIBERG, Codes and Decoding on General Graphs, Ph.D. thesis, Linkoping University, Sweden, 1996.
61. C. YANOVER AND Y. WEISS, Approximate inference and protein folding, Adv. Neural Process. Syst., 2002.
62. J. YEDIDIA, W. FREEMAN, AND Y. WEISS, Understanding Belief Propagation and its Generalizations, TR-2001-22, Mitsubishi Elect. Res. Lab., 2000.
63. L. ZDEBOROVÁ AND M. MÉZARD, The number of matchings in random graphs, J. Stat. Mech. Theory Exp. (2006), P05003.