Satisfying assignments of Random Boolean CSP: Clusters and Overlaps
Gabriel Istrate

TL;DR
This paper investigates the geometric structure of solutions in random Boolean CSPs, proving threshold behaviors and clustering properties that align with predictions from Statistical Physics, especially focusing on 2-SAT and general constraints.
Contribution
It establishes sharp threshold results for solution overlaps and demonstrates that 2-SAT solutions form a single cluster, confirming some physics-based predictions.
Findings
Solution overlaps exhibit sharp thresholds in certain CSPs.
2-SAT solutions typically form a single cluster.
For 2-SAT, two solutions with a specific overlap exist w.h.p.
Abstract
The distribution of overlaps of solutions of a random CSP is an indicator of the overall geometry of its solution space. For random -SAT, nonrigorous methods from Statistical Physics support the validity of the ``one step replica symmetry breaking'' approach. Some of these predictions were rigorously confirmed in \cite{cond-mat/0504070/prl} \cite{cond-mat/0506053}. There it is proved that the overlap distribution of random -SAT, , has discontinuous support. Furthermore, Achlioptas and Ricci-Tersenghi proved that, for random -SAT, . and constraint densities close enough to the phase transition there exists an exponential number of clusters of satisfying assignments; moreover, the distance between satisfying assignments in different clusters is linear. We aim to understand the structural properties of random CSP that lead to solution clustering. To this end,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · Advanced Graph Theory Research · Computational Geometry and Mesh Generation
