Typical random 3-SAT formulae and the satisfiability threshold
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The Probabilistic Analysis of a Greedy Satisfiability Algorithm
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Understanding belief propagation and its generalizations
Exploring artificial intelligence in the new millennium
The threshold for random k-SAT is 2k (ln 2 - O(k))
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Loopy belief propagation and Gibbs measures
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory
On the solution-space geometry of random constraint satisfaction problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Computing pure nash equilibria in graphical games via markov random fields
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
A new look at survey propagation and its generalizations
Journal of the ACM (JACM)
Survey Propagation as “Probabilistic Token Passing”
IEICE - Transactions on Information and Systems
A spectral approach to analysing belief propagation for 3-colouring
Combinatorics, Probability and Computing
Boolean satisfiability on a graphics processor
Proceedings of the 20th symposium on Great lakes symposium on VLSI
IEEE Transactions on Information Theory
Achieving the rate-distortion bound with low-density generator matrix codes
IEEE Transactions on Communications
Resource Allocation via Message Passing
INFORMS Journal on Computing
The connectivity of boolean satisfiability: computational and structural dichotomies
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Resource Allocation via Message Passing
INFORMS Journal on Computing
Hi-index | 0.06 |
We study the survey propagation algorithm [19, 5, 4], which is an iterative technique that appears to be very effective in solving random k-SAT problems even with densities close to threshold. We first describe how any SAT formula can be associated with a novel family of Markov random fields (MRFs), parameterized by a real number ρ. We then show that applying belief propagation---a well-known "message-passing technique---to this family of MRFs recovers various algorithms, ranging from pure survey propagation at one extreme (ρ = 1) to standard belief propagation on the uniform distribution over SAT assignments at the other extreme (ρ = 0). Configurations in these MRFs have a natural interpretation as generalized satisfiability assignments, on which a partial order can be defined. We isolate cores as minimal elements in this partial ordering, and prove that any core is a fixed point of survey propagation. We investigate the associated lattice structure, and prove a weight-preserving identity that shows how any MRF with p 0 can be viewed as a "smoothed" version of the naive factor graph representation of the k-SAT problem (p = 0). Our experimental results show that message-passing on our family of MRFs is most effective for values of ρ ≠ 1 (i.e., distinct from survey propagation); moreover, they suggest that random formulas may not typically possess non-trivial cores. Finally, we isolate properties of Gibbs sampling and message-passing algorithms that are typical for an ensemble of k-SAT problems. We prove that the space of cores for random formulas is highly disconnected, and show that for values of p sufficiently close to one, either the associated MRF is highly concentrated around the all-star assignment, or it has exponentially small conductance. Similarly, we prove that for p sufficiently close to one, the all-star assignment is attractive for message-passing when analyzed in the density-evolution setting.