On the critical exponents of random k-SAT

Abstract

There has been much recent interest in the satisfiability of random Boolean formulas. A random k-SAT formula is the conjunction of m random clauses, each of which is the disjunction of k literals (a variable or its negation). It is known that when the number of variables n is large, there is a sharp transition from satisfiability to unsatisfiability; in the case of 2-SAT this happens when m/n --> 1, for 3-SAT the critical ratio is thought to be m/n ~ 4.2. The sharpness of this transition is characterized by a critical exponent, sometimes called ν=ν_k (the smaller the value of νthe sharper the transition). Experiments have suggested that ν_3 = 1.5+-0.1, ν_4 = 1.25+-0.05, ν_5=1.1+-0.05, ν_6 = 1.05+-0.05, and heuristics have suggested that ν_k --> 1 as k --> infinity. We give here a simple proof that each of these exponents is at least 2 (provided the exponent is well-defined). This result holds for each of the three standard ensembles of random k-SAT formulas: m clauses selected uniformly at random without replacement, m clauses selected uniformly at random with replacement, and each clause selected with probability p independent of the other clauses. We also obtain similar results for q-colorability and the appearance of a q-core in a random graph.

11 pages. v2 has revised introduction and updated references

References in corpus (1)

• The Scaling Window of the 2-SAT Transition

Cited by in corpus (8)

• Structure of large random hypergraphs
• Finite size scaling for the core of large random hypergraphs
• Random MAX SAT, Random MAX CUT, and Their Phase Transitions
• Exhaustive enumeration unveils clustering and freezing in random 3-SAT
• Entanglement phase transition with spin glass criticality
• Criticality and Universality in the Unit-Propagation Search Rule
• Revisiting the cavity-method threshold for random 3-SAT
• Finite-size scaling in random $K$-satisfiability problems