Solution clustering in random satisfiability

For a large number of random constraint satisfaction problems, such as random k-SAT and random graph and hypergraph coloring, we have very good estimates of the largest constraint density for which solutions exist. All known polynomial-time algorithms for these problems, though, fail to find solutions at much lower densities. To understand the origin of this gap we study how the structure of the space of solutions evolves in such problems as constraints are added. In particular, we show that in random k-SAT for k ≥ 8, much before solutions disappear, they organize into an exponential number of clusters, each of which is relatively small and far apart from all other clusters. Moreover, inside each cluster most variables are frozen, i.e., take only one value.

[1]  Federico Ricci-Tersenghi,et al.  On the solution-space geometry of random constraint satisfaction problems , 2006, STOC '06.

[2]  M. Mézard,et al.  Analytic and Algorithmic Solution of Random Satisfiability Problems , 2002, Science.

[3]  Dimitris Achlioptas,et al.  THE THRESHOLD FOR RANDOM k-SAT IS 2k log 2 O(k) , 2004, FOCS 2004.

[4]  Lefteris M. Kirousis,et al.  Selecting Complementary Pairs of Literals , 2003, Electron. Notes Discret. Math..

[5]  Alan M. Frieze,et al.  Analysis of Two Simple Heuristics on a Random Instance of k-SAT , 1996, J. Algorithms.

[6]  Assaf Naor,et al.  Rigorous location of phase transitions in hard optimization problems , 2005, Nature.

[7]  Martin J. Wainwright,et al.  A new look at survey propagation and its generalizations , 2004, SODA '05.

[8]  Thierry Mora,et al.  Clustering of solutions in the random satisfiability problem , 2005, Physical review letters.

[9]  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.

[10]  M. Mézard,et al.  Pairs of SAT Assignments and Clustering in Random Boolean Formulae , 2005 .

[11]  L. Kirousis,et al.  Approximating the unsatisfiability threshold of random formulas , 1998, Random Struct. Algorithms.

[12]  Assaf Naor,et al.  The two possible values of the chromatic number of a random graph , 2004, STOC '04.

[13]  Riccardo Zecchina,et al.  Survey propagation as local equilibrium equations , 2003, ArXiv.

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

[15]  Ming-Te Chao,et al.  Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem , 1986, SIAM J. Comput..

[16]  Cristopher Moore,et al.  The asymptotic order of the random k-SAT threshold , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[17]  Yacine Boufkhad,et al.  A General Upper Bound for the Satisfiability Threshold of Random r-SAT Formulae , 1997, J. Algorithms.

[18]  Olivier Dubois,et al.  Typical random 3-SAT formulae and the satisfiability threshold , 2000, SODA '00.

[19]  Yuval Peres,et al.  The threshold for random k-SAT is 2k (ln 2 - O(k)) , 2003, STOC '03.