Probability-changing cluster algorithm for the study of critical phenomena

Bernd A. Berg, Wolfhard Janke E

Yutaka Okabe, Yusuke Tomita, Chiaki Yamaguchi

Yusuke Tomita, Yutaka Okabe

Using the newly proposed probability-changing cluster (PCC) Monte Carlo algorithm, we simulate the two-dimensional (2D) site-diluted Ising model. Since we can tune the critical point of each random sample automatically with the PCC algorithm, we succeed in studying the sample-dependent T(c)(L) and the sample average of physical quantities at each T(c)(L) systematically. Using the finite-size scaling (FSS) analysis for T(c)(L), we discuss the importance of corrections to FSS both in the strong-dilution and weak-dilution regions. The critical phenomena of the 2D site-diluted Ising model are shown to be controlled by the pure fixed point. The crossover from the percolation fixed point to the pure Ising fixed point with the system size is explicitly demonstrated by the study of the Binder parameter. We also study the distribution of critical temperature T(c)(L). Its variance shows the power-law L dependence, L(-n), and the estimate of the exponent n is consistent with the prediction of Aharony and Harris [Phys. Rev. Lett. 77, 3700 (1996)]. Calculating the relative variance of critical magnetization at the sample-dependent T(c)(L), we show that the 2D site-diluted Ising model exhibits weak self-averaging.

Yusuke Tomita, Yutaka Okabe

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. {\bf 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.

Stella M. Peltier, Angelo Plastino

Z. Alexandrowicz