Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems
- Cite this paper as:
- Feige U., Mossel E., Vilenchik D. (2006) Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems. In: Díaz J., Jansen K., Rolim J.D.P., Zwick U. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Lecture Notes in Computer Science, vol 4110. Springer, Berlin, Heidelberg
Experimental results show that certain message passing algorithms, namely, survey propagation, are very effective in finding satisfying assignments in random satisfiable 3CNF formulas. In this paper we make a modest step towards providing rigorous analysis that proves the effectiveness of message passing algorithms for random 3SAT. We analyze the performance of Warning Propagation, a popular message passing algorithm that is simpler than survey propagation. We show that for 3CNF formulas generated under the planted assignment distribution, running warning propagation in the standard way works when the clause-to-variable ratio is a sufficiently large constant. We are not aware of previous rigorous analysis of message passing algorithms for satisfiability instances, though such analysis was performed for decoding of Low Density Parity Check (LDPC) Codes. We discuss some of the differences between results for the LDPC setting and our results.
Unable to display preview. Download preview PDF.