Satisfiability Threshold for Power Law Random 2-SAT in Configuration Model

05/13/2019
by   Oleksii Omelchenko, et al.
0

The Random Satisfiability problem has been intensively studied for decades. For a number of reasons the focus of this study has mostly been on the model, in which instances are sampled uniformly at random from a set of formulas satisfying some clear conditions, such as fixed density or the probability of a clause to occur. However, some non-uniform distributions are also of considerable interest. In this paper we consider Random 2-SAT problems, in which instances are sampled from a wide range of non-uniform distributions. The model of random SAT we choose is the so-called configuration model, given by a distribution ξ for the degree (or the number of occurrences) of each variable. Then to generate a formula the degree of each variable is sampled from ξ, generating several clones of the variable. Then 2-clauses are created by choosing a random paritioning into 2-element sets on the set of clones and assigning the polarity of literals at random. Here we consider the random 2-SAT problem in the configuration model for power-law-like distributions ξ. More precisely, we assume that ξ is such that its right tail F_ξ(x) satisfies the conditions Wℓ^-α< F_ξ(ℓ)< Vℓ^-α for some constants V,W. The main goal is to study the satisfiability threshold phenomenon depending on the parameters α,V,W. We show that a satisfiability threshold exists and is determined by a simple relation between the first and second moments of ξ.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/03/2019

The Satisfiability Threshold for Non-Uniform Random 2-SAT

Propositional satisfiability (SAT) is one of the most fundamental proble...
research
07/31/2019

A Model of Random Industrial SAT

One of the most studied models of SAT is random SAT. In this model, inst...
research
08/03/2023

Upper bounds on the 2-colorability threshold of random d-regular k-uniform hypergraphs for k≥ 3

For a large class of random constraint satisfaction problems (CSP), deep...
research
12/10/2012

Balanced K-SAT and Biased random K-SAT on trees

We study and solve some variations of the random K-satisfiability proble...
research
05/14/2021

A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm

We show that for every r ≥ 2 there exists ϵ_r > 0 such that any r-unifor...
research
08/11/2000

On the Average Similarity Degree between Solutions of Random k-SAT and Random CSPs

To study the structure of solutions for random k-SAT and random CSPs, th...
research
04/14/2018

The threshold for SDP-refutation of random regular NAE-3SAT

Unlike its cousin 3SAT, the NAE-3SAT (not-all-equal-3SAT) problem has th...

Please sign up or login with your details

Forgot password? Click here to reset