Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Frontiers in Algorithmics

FAW 2014: Frontiers in Algorithmics pp 276–287Cite as

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

  • Conference paper

  • 937 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8497))

Abstract

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.

Partially supported by NSFC 61370052 and 61370156.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Achlioptas, D., Kirousis, L., Kranakis, E., Krizanc, D., Molloy, M., Stamatiou, Y.: Random constraint satisfaction: a more accurate picture. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 107–120. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  2. Alekhnovich, M., Ben-Sasson, E.: Linear Upper Bounds for Random Walk on Small Density Random 3-cnfs. SIAM J. Comput. 36(5), 1248–1263 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  3. Alphonse, É., Osmani, A.: A model to study phase transition and plateaus in relational learning. In: Železný, F., Lavrač, N. (eds.) ILP 2008. LNCS (LNAI), vol. 5194, pp. 6–23. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  4. Broder, A.Z., Frieze, A.M., Upfal, E.: On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas. In: Proc of SODA, pp. 322–330 (1993)

    Google Scholar 

  5. Chao, M., Franco, J.: Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem. SIAM J. Comput. 15(4), 1106–1118 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  6. Cocco, S., Monasson, R., Montanari, A., Semerjian, G.: Analyzing search algorithms with physical methods. In: Percus, A., Istrate, G., Moore, C. (eds.) Computational Complexity and Statistical Physics, pp. 63–106. Oxford University Press (2006)

    Google Scholar 

  7. Coja-Oghlan, A., Frieze, A.: Analyzing Walksat on random formulas. In: Proc. of ANALCO, pp. 48–55 (2012)

    Google Scholar 

  8. Coja-Oghlan, A., Feige, U., Frieze, A., Krivelevich, M., Vilenchik, D.: On smoothed k-CNF formulas and the Walksat algorithm. In: Proc. of SODA, pp. 451–460 (2009)

    Google Scholar 

  9. Fan, Y., Shen, J.: On the phase transitions of random k-constraint satisfaction problems. Artif. Intell. 175, 914–927 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  10. Fan, Y., Shen, J., Xu, K.: A general model and thresholds for random constraint satisfaction problems. Artif. Intell. 193, 1–17 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  11. Gao, Y., Culberson, J.: Consistency and random constraint satisfaction problems. J. Artif. Intell. Res. 28, 517–557 (2007)

    MATH  MathSciNet  Google Scholar 

  12. Gent, I., Macintype, E., Prosser, P., Smith, B., Walsh, T.: Random constraint satisfaction: flaws and structure. Constraints 6(4), 345–372 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  13. Jiang, W., Liu, T., Ren, T., Xu, K.: Two hardness results on feedback vertex sets. In: Atallah, M., Li, X.-Y., Zhu, B. (eds.) FAW-AAIM 2011. LNCS, vol. 6681, pp. 233–243. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  14. Lecoutre, C.: Constraint Networks: Techniques and Algorithms. John Wiley & Sons (2009)

    Google Scholar 

  15. Liu, T., Lin, X., Wang, C., Su, K., Xu, K.: Large Hinge Width on Sparse Random Hypergraphs. In: Proc of IJCAI, pp. 611–616 (2011)

    Google Scholar 

  16. Liu, T., Wang, C., Xu, K.: Large hypertree width for sparse random hypergraphs. J. Comb. Optim. (2014), doi 10.1007/s10878-013-9704-y

    Google Scholar 

  17. Mezard, M., Montanari, A.: Information, Physics and Computation. Oxford University Press (2009)

    Google Scholar 

  18. Richter, S., Helmert, M., Gretton, C.: A stochastic local search approach to vertex cover. In: Hertzberg, J., Beetz, M., Englert, R. (eds.) KI 2007. LNCS (LNAI), vol. 4667, pp. 412–426. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  19. Rossi, F., Van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming. Elsevier (2006)

    Google Scholar 

  20. Smith, B.M., Dyer, M.E.: Locating the Phase Transition in Binary Constraint Satisfaction Problems. Artif. Intell. 81, 155–181 (1996)

    Article  MathSciNet  Google Scholar 

  21. Semerjian, G., Monasson, R.: Relaxation and Metastability in the Random Walk SAT search procedure. Phys. Rev. E 67, 066103 (2003)

    Google Scholar 

  22. Semerjian, G., Monasson, R.: A Study of Pure Random Walk on Random Satisfiability Problems with Physical Methods. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 120–134. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  23. Schöning, U.: A probabilistic algorithm for k-SAT based on limited local search and restart. Algorithmica 32, 615–623 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  24. Schöning, U.: A probabilistic algorithm for k-SAT and constraint satisfaction problems. In: Proc. of FOCS, pp. 410–414 (1999)

    Google Scholar 

  25. Smith, B.: Constructing an asymptotic phase transition in random binary constraint satisfaction problems. Theoret. Comput. Sci. 265, 265–283 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  26. Wang, C., Liu, T., Cui, P., Xu, K.: A note on treewidth in random graphs. In: Wang, W., Zhu, X., Du, D.-Z. (eds.) COCOA 2011. LNCS, vol. 6831, pp. 491–499. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  27. Xu, K., Li, W.: Exact Phase Transitions in Random Constraint Satisfaction Problems. J. Artif. Intell. Res. 12, 93–103 (2000)

    MATH  Google Scholar 

  28. Xu, K., Li, W.: Many Hard Examples in Exact Phase Transitions. Theoret. Comput. Sci. 355, 291–302 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  29. Xu, K., Boussemart, F., Hemery, F., Lecoutre, C.: Random Constraint Satisfaction: Easy Generation of Hard (Satisfiable) Instances. Artif. Intell. 171, 514–534 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  30. Xu, W.: An analysis of backtrack-free algorithm on a constraint satisfaction problem with growing domains (in Chineses). Acta Mathematicae Applicatae Sinica (Chinese Series) (accepted, 2014)

    Google Scholar 

  31. Zhao, C., Zheng, Z.: Threshold behaviors of a random constraint satisfaction problem with exact phase transitions. Inform. Process. Lett. 111, 985–988 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  32. Zhao, C., Zhang, P., Zheng, Z., Xu, K.: Analytical and Belief-propagation Studies of Random Constraint Satisfaction Problems with Growing Domains. Phys. Rev. E 85, 016106 (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Automation and Electrical Engineering, University of Science and Technology Beijing, Beijing, 100083, China

    Wei Xu

  2. Institute of Applied Mathematics, Academy of Mathematics and System Science, Chinese Academy of Sciences, Beijing, 100190, China

    Fuzhou Gong

Authors
  1. Wei Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fuzhou Gong
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Texas A&M University, USA

    Jianer Chen

  2. Cornell University, USA

    John E. Hopcroft

  3. School of Information Science and Engineering, Central South University, 410083, Changsha, China

    Jianxin Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Xu, W., Gong, F. (2014). A Study of Pure Random Walk Algorithms on Constraint Satisfaction Problems with Growing Domains. In: Chen, J., Hopcroft, J.E., Wang, J. (eds) Frontiers in Algorithmics. FAW 2014. Lecture Notes in Computer Science, vol 8497. Springer, Cham. https://doi.org/10.1007/978-3-319-08016-1_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08016-1_25

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08015-4

  • Online ISBN: 978-3-319-08016-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation