A Study of Pure Random Walk Algorithms on Constraint Satisfaction Problems with Growing Domains

The performances of two types of pure random walk (PRW) algorithms for a model of constraint satisfaction problems with growing domains (called Model RB) are investigated. Threshold phenomenons appear for both algorithms. In particular, when the constraint density r is smaller than a threshold value r d , PRW algorithms can solve instances of Model RB efficiently, but when r is bigger than the r d , they fail. Using a physical method, we find out the threshold values for both algorithms. When the number of variables N is large, the threshold values tend to zero, so generally speaking PRW does not work on Model RB.

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

[2]  Michael Beetz,et al.  KI 2007: Advances in Artificial Intelligence, 30th Annual German Conference on AI, KI 2007, Osnabrück, Germany, September 10-13, 2007, Proceedings , 2007, KI.

[3]  Alan M. Frieze,et al.  Analyzing Walksat on Random Formulas , 2011, ANALCO.

[4]  Alan M. Frieze,et al.  On smoothed k-CNF formulas and the Walksat algorithm , 2009, SODA.

[5]  Ke Xu,et al.  A Note on Treewidth in Random Graphs , 2011, COCOA.

[6]  Wei Jiang,et al.  Two Hardness Results on Feedback Vertex Sets , 2011, FAW-AAIM.

[7]  Malte Helmert,et al.  A Stochastic Local Search Approach to Vertex Cover , 2007, KI.

[8]  Toby Walsh,et al.  Random Constraint Satisfaction: Flaws and Structure , 2004, Constraints.

[9]  Binhai Zhu,et al.  Combinatorial Optimization and Applications , 2014, Lecture Notes in Computer Science.

[10]  Christophe Lecoutre,et al.  Constraint Networks: Techniques and Algorithms , 2009 .

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

[12]  Yannis C. Stamatiou,et al.  Random Constraint Satisfaction: A More Accurate Picture , 1997, CP.

[13]  Kaile Su,et al.  Large Hinge Width on Sparse Random Hypergraphs , 2011, IJCAI.

[14]  Yun Fan,et al.  A general model and thresholds for random constraint satisfaction problems , 2012, Artif. Intell..

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

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

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

[18]  Ke Xu,et al.  Analytical and belief-propagation studies of random constraint satisfaction problems with growing domains. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  Aomar Osmani,et al.  A Model to Study Phase Transition and Plateaus in Relational Learning , 2008, ILP.

[20]  Lusheng Wang,et al.  Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Joint International Conference, FAW-AAIM 2011, Jinhua, China, May 28-31, 2011. Proceedings , 2011, FAW-AAIM.

[21]  U. Schöning.  A probabilistic algorithm for k-SAT and constraint satisfaction problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[22]  W Xu.  An Analysis of Backtrack-free Algorithm on a Constraint Satisfaction Problem with Growing Domains , 2014 .

[23]  Alan M. Frieze,et al.  On the satisfiability and maximum satisfiability of random 3-CNF formulas , 1993, SODA '93.

[24]  Eli Ben-Sasson,et al.  Linear Upper Bounds for Random Walk on Small Density Random 3-CNFs , 2007, SIAM J. Comput..

[25]  Rémi Monasson,et al.  A Study of Pure Random Walk on Random Satisfiability Problems with "Physical" Methods , 2003, SAT.

[26]  Andrea Montanari,et al.  Analyzing Search Algorithms with Physical Methods , 2006, Computational Complexity and Statistical Physics.

[27]  T. Toffoli.  Physics and computation , 1982 .

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

[29]  Gert Smolka.  Principles and Practice of Constraint Programming-CP97 , 1997, Lecture Notes in Computer Science.

[30]  Ke Xu,et al.  Large hypertree width for sparse random hypergraphs , 2015, J. Comb. Optim..

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

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

[33]  Uwe Schöning,et al.  A Probabilistic Algorithm for k -SAT Based on Limited Local Search and Restart , 2002, Algorithmica.

[34]  Yun Fan,et al.  On the phase transitions of random k-constraint satisfaction problems , 2011, Artif. Intell..

[35]  Toby Walsh,et al.  Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.

[36]  R. Monasson,et al.  Relaxation and metastability in a local search procedure for the random satisfiability problem. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[37]  J. Culberson,et al.  Consistency and Random Constraint Satisfaction Models , 2007, J. Artif. Intell. Res..