Catching the k-NAESAT Threshold
Amin Coja-Oghlan, Konstantinos Panagiotou

TL;DR
This paper rigorously determines the solution threshold for random k-NAESAT, confirming predictions from statistical mechanics by developing a new Survey Propagation inspired second moment method that overcomes previous barriers.
Contribution
It introduces a novel second moment method inspired by Survey Propagation to rigorously establish the k-NAESAT threshold, validating non-rigorous physics conjectures.
Findings
Threshold for k-NAESAT solutions is approximately 2^{k-1} ln 2 minus a small correction.
The method overcomes the condensation barrier in the second moment analysis.
Results match the conjectured thresholds from statistical mechanics.
Abstract
The best current estimates of the thresholds for the existence of solutions in random constraint satisfaction problems ('CSPs') mostly derive from the first and the second moment method. Yet apart from a very few exceptional cases these methods do not quite yield matching upper and lower bounds. According to deep but non-rigorous arguments from statistical mechanics, this discrepancy is due to a change in the geometry of the set of solutions called condensation that occurs shortly before the actual threshold for the existence of solutions (Krzakala, Montanari, Ricci-Tersenghi, Semerjian, Zdeborova: PNAS 2007). To cope with condensation, physicists have developed a sophisticated but non-rigorous formalism called Survey Propagation (Mezard, Parisi, Zecchina: Science 2002). This formalism yields precise conjectures on the threshold values of many random CSPs. Here we develop a new Survey…
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.
