Crossover and self-averaging in the two-dimensional site-diluted Ising model: Application of probability-changing cluster algorithm

Yusuke Tomita, Yutaka Okabe

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)

Abstract

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 (Formula presented) and the sample average of physical quantities at each (Formula presented) systematically. Using the finite-size scaling (FSS) analysis for (Formula presented) 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 (Formula presented) Its variance shows the power-law L dependence, (Formula presented) 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 (Formula presented) we show that the 2D site-diluted Ising model exhibits weak self-averaging.

Original languageEnglish
Pages (from-to)6
Number of pages1
JournalPhysical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics
Volume64
Issue number3
DOIs
Publication statusPublished - 2001
Externally publishedYes

ASJC Scopus subject areas

  • Statistical and Nonlinear Physics
  • Statistics and Probability
  • Condensed Matter Physics

Fingerprint

Dive into the research topics of 'Crossover and self-averaging in the two-dimensional site-diluted Ising model: Application of probability-changing cluster algorithm'. Together they form a unique fingerprint.

Cite this