One-step replica symmetry breaking of random regular NAE-SAT

  title={One-step replica symmetry breaking of random regular NAE-SAT},
  author={Danny Nam and Allan Sly and Youngtak Sohn},
  journal={2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)},
In a broad class of sparse random constraint satisfaction problems (CSP), deep heuristics from statistical physics predict that there is a condensation phase transition before the satisfiability threshold, governed by one-step replica symmetry breaking (1RSB). In fact, in random regular k-NAE-SAT, which is one of such random CSPS, it was verified [1] that its free energy is well-defined and the explicit value follows the 1RSB prediction. However, for any model of sparse random CSP, it has been… 

Figures from this paper

Fast sampling of satisfying assignments from random k-SAT

A novel approach to bound the sum of influences in the k -SAT model which turns out to be robust against the presence of high-degree variables and allows for fast mixing results of a uniform-block Glauber dynamics on a carefully selected subset of the variables.

The Algorithmic Phase Transition of Random k-SAT for Low Degree Polynomials

  • Guy BreslerBrice Huang
  • Computer Science
    2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
  • 2022
It is proved that the class of low degree polynomial algorithms cannot find a satisfying assignment at clause density within a constant factor of that achieved by Fix, the first hardness result for any class of algorithms at clause densities within a constants factor.

Free Energy Subadditivity for Symmetric Random Hamiltonians

We consider a random Hamiltonian H : Σ → R defined on a compact space Σ that admits a transitive action by a compact group G . When the law of H is G -invariant, we show its expected free energy



The Number of Solutions for Random Regular NAE-SAT

It is proved here that random regular NAE-SAT solutions have a well-defined free energy (limiting exponential growth rate), with explicit value matching the one-step replica symmetry breaking prediction.

The asymptotic k-SAT threshold

This proof directly employs ideas from the 1RSB cavity method, such as the notion of covers (relaxed satisfying assignments) and bits of the Survey Propagation calculations, to prove that rk--SAT = 2k ln 2--1/2 (1 + ln2) + ok(1), which matches the 1 RSB prediction up to the ok( 1) error term.

Breaking of 1RSB in random MAX-NAE-SAT

In the random regular $k$-NAE-SAT model, the 1RSB description breaks down already above $\alpha \asymp 4^k/k^3$.

Clusters of solutions and replica symmetry breaking in random k-satisfiability

A simplified version of the cavity formalism for special values of the Parisi replica symmetry breaking parameter m (in particular for m = 1 via a correspondence with the tree reconstruction problem) and new large-k expansions are made.

Random k-SAT: Two Moments Suffice to Cross a Sharp Threshold

It is proved that the threshold for both random hypergraph 2-colorability and random Not-All-Equal $k$-SAT is $2^{k-1}\ln 2 -O(1)$, resolving a long-standing open problem.

Rigorous location of phase transitions in hard optimization problems

The results prove that the heuristic predictions of statistical physics in this context are essentially correct and establish that random instances of constraint satisfaction problems have solutions well beyond the reach of any analysed algorithm.

The phase transition in 1-in-k SAT and NAE 3-SAT

This paper studies random instances of two other canonical variations of satisfiability, 1-in-k SAT and Not-All-Equal 3-SAT, and focuses on "threshold phenomena" occurring in these models and how they might relate to computational hardness.

The condensation phase transition in the regular k-SAT model

This paper proposes a novel method for harnessing Belief Propagation directly to obtain a rigorous proof of such a prediction, namely the existence and location of a condensation phase transition in the random regular $k$-SAT model.

The Condensation Phase Transition in Random Graph Coloring

This paper proves the conjecture that in addition to the k-colorability phase transition studied intensively in combinatorics, there exists a second phase transition called the condensation phase transition, which is located in terms of a certain distributional fixed point problem.

The condensation transition in random hypergraph 2-coloring

This paper proves for the first time that a condensation transition exists in a natural random CSP, namely in random hypergraph 2-coloring, and finds that the second moment method applied to the number of 2-colorings breaks down strictly before the condensation Transition.