Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
On the size of a random maximal graph
Random Graphs 93 Proceedings of the sixth international seminar on Random graphs and probabilistic methods in combinatorics and computer science
A Spectral Technique for Coloring Random 3-Colorable Graphs
SIAM Journal on Computing
Random Structures & Algorithms
Some optimal inapproximability results
Journal of the ACM (JACM)
A spectral technique for random satisfiable 3CNF formulas
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Solving random satisfiable 3CNF formulas in expected polynomial time
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On the solution-space geometry of random constraint satisfaction problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Randomly generated intersecting hypergraphs II
Random Structures & Algorithms - Proceedings from the 12th International Conference “Random Structures and Algorithms”, August1-5, 2005, Poznan, Poland
The random planar graph process
Random Structures & Algorithms
Algorithmic Barriers from Phase Transitions
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Why almost all k-colorable graphs are easy
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Complete convergence of message passing algorithms for some satisfiability problems
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
The freezing threshold for k-colourings of a random graph
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
In this work we suggest a new model for generating random satisfiable k-CNF formulas. To generate such formulas. randomly permute all $2^k\binom{n}{k}$ possible clauses over the variables x1,. . .,xn, and starting from the empty formula, go over the clauses one by one, including each new clause as you go along if, after its addition, the formula remains satisfiable. We study the evolution of this process, namely the distribution over formulas obtained after scanning through the first m clauses (in the random permutation's order). Random processes with conditioning on a certain property being respected are widely studied in the context of graph properties. This study was pioneered by Ruciński and Wormald in 1992 for graphs with a fixed degree sequence, and also by Erdős, Suen and Winkler in 1995 for triangle-free and bipartite graphs. Since then many other graph properties have been studied, such as planarity and H-freeness. Thus our model is a natural extension of this approach to the satisfiability setting. Our main contribution is as follows. For m ≥ cn, c = c(k) a sufficiently large constant, we are able to characterize the structure of the solution space of a typical formula in this distribution. Specifically, we show that typically all satisfying assignments are essentially clustered in one cluster, and all but e−Ω(m/n)n of the variables take the same value in all satisfying assignments. We also describe a polynomial-time algorithm that finds w.h.p. a satisfying assignment for such formulas.