Analytical and belief-propagation studies of random constraint satisfaction problems with growing domains.

We study solution-space structure and solution-finding algorithms of a representative hard random constraint satisfaction problem with growing domains known as Model RB. Using rigorous methods, we show that solutions are grouped into disconnected clusters before the theoretical satisfiability phase transition point. Using the cavity method, it is shown that the entropy density obtained by belief propagation (BP) on random Model RB instances, which corresponds well to the analytical results, vanishes as the control parameter (constraint tightness) approaches the satisfiability threshold. From an algorithmic point of view, we find that reinforced BP, which performs much better than all existing algorithms, allows us to find solutions efficiently for instances in the regime that is very close to the satisfiability transition. These results also can shed light on the effectiveness of BP reinforcement on problems with a large number of states.

[1]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

[2]  Haijun Zhou,et al.  Message passing for vertex covers , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Barbara M. Smith,et al.  Constructing an asymptotic phase transition in random binary constraint satisfaction problems , 2001, Theor. Comput. Sci..

[4]  R. Zecchina,et al.  Phase transitions in combinatorial problems , 2001 .

[5]  Florent Krzakala,et al.  Phase Transitions in the Coloring of Random Graphs , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Guilhem Semerjian,et al.  On the cavity method for decimated random constraint satisfaction problems and the analysis of belief propagation guided decimation algorithms , 2009, ArXiv.

[7]  Ke Xu,et al.  Random constraint satisfaction: Easy generation of hard (satisfiable) instances , 2007, Artif. Intell..

[8]  Marc Mézard,et al.  Landscape of solutions in constraint satisfaction problems , 2005, Physical review letters.

[9]  M. Mézard,et al.  Information, Physics, and Computation , 2009 .

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  Ke Xu,et al.  A message-passing approach to random constraint satisfaction problems with growing domains , 2011 .

[12]  Haijun Zhou,et al.  Stability analysis on the finite-temperature replica-symmetric and first-step replica-symmetry-broken cavity solutions of the random vertex cover problem. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Andrea Montanari,et al.  Gibbs states and the set of solutions of random constraint satisfaction problems , 2006, Proceedings of the National Academy of Sciences.

[14]  M. Mézard,et al.  Survey-propagation decimation through distributed local computations , 2005, cond-mat/0512002.

[15]  Martin E. Dyer,et al.  Locating the Phase Transition in Binary Constraint Satisfaction Problems , 1996, Artif. Intell..

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

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

[18]  Riccardo Zecchina,et al.  Learning by message-passing in networks of discrete synapses , 2005, Physical review letters.

[19]  Wei Li,et al.  Many hard examples in exact phase transitions , 2003, Theor. Comput. Sci..

[20]  Lenka Zdeborová,et al.  Exhaustive enumeration unveils clustering and freezing in random 3-SAT , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  Wei Li,et al.  Exact Phase Transitions in Random Constraint Satisfaction Problems , 2000, J. Artif. Intell. Res..

[22]  Abdul Sattar,et al.  Local search with edge weighting and configuration checking heuristics for minimum vertex cover , 2011, Artif. Intell..

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

[24]  Lenka Zdeborová,et al.  Locked constraint satisfaction problems. , 2008, Physical review letters.

[25]  Zhiming Zheng,et al.  Threshold behaviors of a random constraint satisfaction problem with exact phase transitions , 2011, Inf. Process. Lett..

[26]  P. Pin,et al.  Statistical mechanics of maximal independent sets. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[27]  Riccardo Zecchina,et al.  Entropy landscape and non-Gibbs solutions in constraint satisfaction problems , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[28]  Hui Ma,et al.  Communities of solutions in single solution clusters of a random K-satisfiability formula. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.