Novel Monte Carlo algorithms and their applications

Abstract

We describe a generalized scheme for the probability-changing cluster (PCC) algorithm, based on the study of the finite-size scaling property of the correlation ratio, the ratio of the correlation functions with different distances. We apply this generalized PCC algorithm to the two-dimensional 6-state clock model. We also discuss the combination of the cluster algorithm and the extended ensemble method. We derive a rigorous broad histogram relation for the bond number. A Monte Carlo dynamics based on the number of potential moves for the bond number is proposed, and applied to the three-dimensional Ising and 3-state Potts models.

13 pages including 7 eps figures, proceedings of StatPhys-Taiwan-2002, to appear in Physica A

References in corpus (8)

• Determining the density of states for classical statistical models: A random walk algorithm to produce a flat histogram
• Probability-Changing Cluster Algorithm for Two-Dimensional XY and Clock Models
• Three-dimensional antiferromagnetic q-state Potts models: application of the Wang-Landau algorithm
• Finite-size Scaling of Correlation Ratio and Generalized Scheme for the Probability-Changing Cluster Algorithm
• Combination of improved multibondic method and the Wang-Landau method
• Crossover and self-averaging in the two-dimensional site-diluted Ising model
• Probability-Changing Cluster Algorithm: Study of Three-Dimensional Ising Model and Percolation Problem
• Broad histogram relation for the bond number and its applications