Local geometry of NAE-SAT solutions in the condensation regime

05/27/2023
by   Allan Sly, et al.
0

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. 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/04/2020

Belief Propagation on the random k-SAT model

Corroborating a prediction from statistical physics, we prove that the B...
research
02/01/2014

Performance of the Survey Propagation-guided decimation algorithm for the random NAE-K-SAT problem

We show that the Survey Propagation-guided decimation algorithm fails to...
research
02/25/2022

A residual-based message passing algorithm for constraint satisfaction problems

Message passing algorithms, whose iterative nature captures well complic...
research
07/27/2023

Correlation decay up to the sampling threshold in the local lemma regime

We study the decay of correlation between locally constrained independen...
research
12/23/2019

Asymptotic Behavior for Textiles in von-Kármán regime

The paper is dedicated to the investigation of simultaneous homogenizati...
research
11/30/2021

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

Continuing our earlier work in <cit.>, we study the random regular k-NAE...
research
03/27/2023

Uniformly Random Colourings of Sparse Graphs

We analyse uniformly random proper k-colourings of sparse graphs with ma...

Please sign up or login with your details

Forgot password? Click here to reset