Skip to main content

Applications of the Probability-Changing Cluster Algorithm and Related Problems

  • Conference paper
Computer Simulation Studies in Condensed-Matter Physics XIV

Part of the book series: Springer Proceedings in Physics ((SPPHY,volume 89))

  • 183 Accesses

Abstract

We describe the idea of the newly proposed efficient algorithpi of tuning the critical point automatically. This probability-changing cluster (PCC) algorithm is an extended version of the Swendsen-Wang algorithm. As an application of the PCC algorithm, we study the two-dimensional site-diluted Ising model, paying attention to the self-averaging property. We also use another newly proposed algorithm, the Wang-Landau algorithm, for the study of the three-dimensional antiferromagnetic q-state Potts models.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D.P. Landau and K. Binder: A Guide to Monte Carlo Methods in Statistical Physics, (Cambridge U. Press, Cambridge, 2000).

    Google Scholar 

  2. R.H. Swendsen and J.S. Wang: Phys. Rev. Lett. 58, 86 (1987).

    Article  ADS  Google Scholar 

  3. U. Wolff: Phys. Rev. Lett. 60, 1461 (1988); 62, 361 (1989).

    Article  MathSciNet  ADS  Google Scholar 

  4. B.A. Berg and T. Neuhaus: Phys. Lett. B 267, 249 (1991); Phys. Rev. Lett. 68, 9 (1992).

    Article  ADS  Google Scholar 

  5. J. Lee: Phys. Rev. Lett. 71, 211 (1993).

    Article  ADS  Google Scholar 

  6. E. Marinari and G. Parisi: Europhys. Lett. 19, 451 (1992).

    Article  ADS  Google Scholar 

  7. K. Hukushima and K. Nemoto: J. Phys. Soc. Jpn. 65, 1604 (1996).

    Article  ADS  Google Scholar 

  8. P.M.C. de Oliveira, T.J.P. Penna, and H.J. Herrmann: Eur. Phys. J. B 1, 205 (1998).

    Article  ADS  Google Scholar 

  9. J.-S. Wang: Eur. Phys. J. B 8, 287 (1998).

    Article  ADS  Google Scholar 

  10. F. Wang and D.P. Landau: Phys. Rev. Lett. 86, 2050 (2001).

    Article  ADS  Google Scholar 

  11. P.W. Kasteleyn and C.M. Fortuin: J. Phys. Soc. Jpn. Suppl. 26, 11 (1969); C.M. Fortuin and P.W. Kasteleyn: Physica 57, 536 (1972).

    ADS  Google Scholar 

  12. A. Coniglio and W. Klein: J. Phys. A 13, 2775 (1980).

    Article  ADS  Google Scholar 

  13. C.-K. Hu: Phys. Rev. B 29, 5103 (1984).

    Article  ADS  Google Scholar 

  14. Y. Tomita, Y. Okabe, and C.-K. Hu: Phys. Rev. E 60, 2716 (1999).

    Article  ADS  Google Scholar 

  15. J. Machta, Y.S. Choi, A. Lucke, T. Schweizer, and L.V. Chayes: Phys. Rev. Lett. 75, 2792 (1995); Phys. Rev. E 54, 1332 (1996).

    Article  ADS  MATH  Google Scholar 

  16. Y. Tomita and Y. Okabe: Phys. Rev. Lett. 86, 572 (2001).

    Article  ADS  Google Scholar 

  17. F.Y. Wu: Rev. Mod. Phys. 54, 235 (1982) and references therein.

    Article  ADS  Google Scholar 

  18. S. Wiseman and E. Domany: Phys. Rev. Lett. 81, 22 (1998); Phys. Rev. E 58, 2938 (1998).

    Article  ADS  Google Scholar 

  19. K. Bernardet, F. Pazmandi, and G.G. Batrouni: Phys. Rev. Lett. 84, 4477 (2000).

    Article  ADS  Google Scholar 

  20. V.S. Dotsenko: Nucl. Phys. B 235 [FS11], 54 (1984).

    Article  MathSciNet  ADS  Google Scholar 

  21. R.H. Swendsen: private communication.

    Google Scholar 

  22. J.-S. Wang: private communication.

    Google Scholar 

  23. A. Aharony and A.B. Harris: Phys. Rev. Lett. 77, 3700 (1996).

    Article  ADS  Google Scholar 

  24. R.B. Stinchcombe: in Phase Transitions and Critical Phenomena, ed. by C. Domb and J.L. Lebowitz (Academic Press, New York, 1983), Vol. 7.

    Google Scholar 

  25. A.B. Harris: J. Phys. C7, 1671 (1974).

    ADS  Google Scholar 

  26. Y. Tomita and Y. Okabe: in preparation.

    Google Scholar 

  27. J.B. Banavar, G.S. Grest, and D. Jasnow: Phys. Rev. Lett. 45, 1424 (1980); Phys. Rev. B 52, 4639 (1982).

    Article  MathSciNet  ADS  Google Scholar 

  28. I. Ono: Prog. Theor. Phys. Suppl. 87, 102 (1986).

    Article  ADS  Google Scholar 

  29. J.-S. Wang, R.H. Swendsen, and R. Kotecký: Phys. Rev. Lett. 63, 109 (1989); Phys. Rev. B 42, 2465 (1989).

    Article  ADS  Google Scholar 

  30. M. Kolesik and M. Suzuki: J. Phys. A 28, 6543 (1995).

    Article  ADS  Google Scholar 

  31. R.K. Heilmann, J.-S. Wang, and R.H. Swendsen: Phys. Rev. B 53, 2210 (1996).

    Article  ADS  Google Scholar 

  32. M. Itakura: Phys. Rev. B 60, 6558 (1999).

    Article  ADS  Google Scholar 

  33. R. Shrock and S.-H. Tsai: J. Phys. A 30, 495 (1997); Phys. Rev. E 58, 4332 (1998).

    Article  MathSciNet  ADS  MATH  Google Scholar 

  34. C. Yamaguchi and Y. Okabe: in preparation.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Okabe, Y., Tomita, Y., Yamaguchi, C. (2002). Applications of the Probability-Changing Cluster Algorithm and Related Problems. In: Landau, D.P., Lewis, S.P., Schüttler, HB. (eds) Computer Simulation Studies in Condensed-Matter Physics XIV. Springer Proceedings in Physics, vol 89. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59406-9_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-59406-9_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-63967-8

  • Online ISBN: 978-3-642-59406-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics