Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
On the greedy algorithm for satisfiability
Information Processing Letters
Algorithmic theory of random graphs
Random Structures & Algorithms - Special issue: average-case analysis of algorithms
A Spectral Technique for Coloring Random 3-Colorable Graphs
SIAM Journal on Computing
Analysis of low density codes and improved designs using irregular graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On the satisfiability and maximum satisfiability of random 3-CNF formulas
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Typical random 3-SAT formulae and the satisfiability threshold
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Finding and certifying a large hidden clique in a semirandom graph
Random Structures & Algorithms
Some optimal inapproximability results
Journal of the ACM (JACM)
A spectral technique for random satisfiable 3CNF formulas
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Coloring Bipartite Hypergraphs
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
The Probabilistic Analysis of a Greedy Satisfiability Algorithm
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Linear Upper Bounds for Random Walk on Small Density Random 3-CNF
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Survey propagation: An algorithm for satisfiability
Random Structures & Algorithms
Factor graphs and the sum-product algorithm
IEEE Transactions on Information Theory
Efficient erasure correcting codes
IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
Loopy Substructural Local Search for the Bayesian Optimization Algorithm
SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
A spectral approach to analysing belief propagation for 3-colouring
Combinatorics, Probability and Computing
On the random satisfiable process
Combinatorics, Probability and Computing
Why almost all k-colorable graphs are easy
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
A spectral method for MAX2SAT in the planted solution model
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
On belief propagation guided decimation for random k-SAT
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Catching the k-NAESAT threshold
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
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.