The random 2-SAT partition function
classification
🧮 math.PR
cs.DMmath.CO
keywords
randomprobabilitysatisfyingalgorithmassignmentassignmentsbeliefcavity
read the original abstract
We show that throughout the satisfiable phase the normalised 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.