Random 2-SAT with Prescribed Literal Degrees

Two classic "phase transitions" in discrete mathematics are the emergence of a giant component in a random graph as the density of edges increases, and the transition of a random 2-SAT formula from satisfiable to unsatisfiable as the density of clauses increases. The random-graph result has been extended to the case of prescribed degree sequences, where the almost-sure nonexistence or existence of a giant component is related to a simple property of the degree sequence. We similarly extend the satisfiability result, by relating the almost-sure satisfiability or unsatisfiability of a random 2-SAT formula to an analogous property of its prescribed literal-degree sequence. The extension has proved useful in analyzing literal-degree-based algorithms for (uniform) random 3-SAT.

[1]  Dimitris Achlioptas,et al.  Optimal myopic algorithms for random 3-SAT , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[2]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[3]  Bruce A. Reed,et al.  Mick gets some (the odds are on his side) (satisfiability) , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[4]  N. Wormald.  Differential Equations for Random Processes and Random Graphs , 1995 .

[5]  Yann Verhoeven.  Random 2-SAT and unsatisfiability , 1999, Inf. Process. Lett..

[6]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..

[7]  Lefteris M. Kirousis,et al.  The probabilistic analysis of a greedy satisfiability algorithm , 2002, Random Struct. Algorithms.

[8]  Béla Bollobás,et al.  A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..

[9]  Alan M. Frieze,et al.  Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number , 2002, Combinatorics, Probability and Computing.

[10]  Brendan D. McKay,et al.  Asymptotic enumeration by degree sequence of graphs with degreeso(n1/2) , 1991, Comb..

[11]  Béla Bollobás,et al.  The scaling window of the 2‐SAT transition , 1999, Random Struct. Algorithms.

[12]  Andreas Goerdt,et al.  A Threshold for Unsatisfiability , 1992, MFCS.

[13]  Svante Janson,et al.  Bounding the unsatisfiability threshold of random 3-SAT , 2000, Random Struct. Algorithms.