Local Geometry of NAE-SAT Solutions in the Condensation Regime
Allan Sly, Youngtak Sohn
Abstract
The local behavior of typical solutions of random constraint satisfaction problems (csp) describes many important phenomena including clustering thresholds, decay of correlations, and the behavior of message passing algorithms. When the constraint density is low, studying the planted model is a powerful technique for determining this local behavior which in many examples has a simple Markovian structure. The work of Coja-Oghlan, Kapetanopoulos, Müller (2020) showed that for a wide class of models, this description applies up to the so-called condensation threshold.
Understanding the local behavior after the condensation threshold is more complex due to long-range correlations. In this work, we revisit the random regular nae-sat model in the condensation regime and determine the local weak limit which describes a random solution around a typical variable. This limit exhibits a complicated non-Markovian structure arising from the space of solutions being dominated by a small number of large clusters. This is the first description of the local weak limit in the condensation regime for any sparse random csps in the one-step replica symmetry breaking (1rsb) class. Our result is non-asymptotic and characterizes the tight fluctuation O(n -1/2 ) around the limit. Our proof is based on coupling the local neighborhoods of an infinite spin system, which encodes the structure of the clusters, to a broadcast model on trees whose channel is given by the 1rsb belief-propagation fixed point. We believe that our proof technique has broad applicability to random csps in the 1rsb class.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on1
Related papers
- One-step replica symmetry breaking of random regular NAE-SATDanny Nam, Allan Sly, Youngtak SohnFOCS 2021 · 8 citations
- Counting Random k-SAT near the Satisfiability ThresholdZongchen Chen, Aditya Lonkar, Chunyang Wang, Kuan Yang et al.STOC 2025 · 2 citations
- Uniformly Random Colourings of Sparse GraphsEoin Hurley, François PirotSTOC 2023 · 1 citation
- Frozen 1-RSB structure of the symmetric Ising perceptronWill Perkins, Changji XuSTOC 2021 · 31 citations
- Efficient Algorithms for Semirandom Planted CSPs at the Refutation ThresholdVenkatesan Guruswami, Jun-Ting Hsieh, Pravesh K. Kothari, Peter ManoharFOCS 2023 · 3 citations
