Probability-Changing Cluster Algorithm: Study of Three-Dimensional Ising Model and Percolation Problem

Yusuke Tomita, Yutaka Okabe

研究成果: Article査読

15 被引用数 (Scopus)

抄録

We present a detailed description of the idea and procedure for the newly proposed Monte Carlo algorithm of tuning the critical point automatically, which is called the probability-changing cluster (PCC) algorithm [Y. Tomita and Y. Okabe: Phys. Rev. Lett. 86 (2001) 572]. Using the PCC algorithm, we investigate the three-dimensional Ising model and the bond percolation problem. We employ a refined finite-size scaling analysis to make estimates of critical point and exponents. With much less efforts, we obtain the results which are consistent with the previous calculations. We argue several directions for the application of the PCC algorithm.

本文言語English
ページ(範囲)1570-1575
ページ数6
ジャーナルjournal of the physical society of japan
71
6
DOI
出版ステータスPublished - 2002 6
外部発表はい

ASJC Scopus subject areas

  • 物理学および天文学(全般)

フィンガープリント

「Probability-Changing Cluster Algorithm: Study of Three-Dimensional Ising Model and Percolation Problem」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル