Abstract
We show that throughout the satisfiable phase the normalized number of satisfying assignments of a random 2-SAT formula converges in probability to an expression predicted by the cavity method from statistical physics. The proof is based on showing that the Belief Propagation algorithm renders the correct marginal probability that a variable is set to “true” under a uniformly random satisfying assignment.
Original language | English |
---|---|
Pages (from-to) | 609-647 |
Number of pages | 39 |
Journal | Random Structures and Algorithms |
Volume | 58 |
Issue number | 4 |
DOIs | |
Publication status | Published - Jul 2021 |
Externally published | Yes |
Keywords
- 2-SAT
- Belief Propagation
- satisfiability problem