Dynamic critical behavior of cluster algorithms for 2D Ashkin-Teller and Potts models

Abstract

We study the dynamic critical behavior of two algorithms: the Swendsen-Wang algorithm for the two-dimensional Potts model with q=2,3,4 and a Swendsen-Wang-type algorithm for the two-dimensional symmetric Ashkin-Teller model on the self-dual curve. We find that the Li--Sokal bound on the autocorrelation time τ_{{\rm int},{\cal E}} \geq const \times C_H is almost, but not quite sharp. The ratio τ_{{\rm int},{\cal E}}/C_H appears to tend to infinity either as a logarithm or as a small power (0.05 \ltapprox p \ltapprox 0.12). We also show that the exponential autocorrelation time τ_{{\rm exp},{\cal E}} is proportional to the integrated autocorrelation time τ_{{\rm int},{\cal E}}.

arXiv comment19 pages, LaTeX2e. Self-unpacking file containing the tex file, three macros and four ps files. Talk presented at the conference on Inhomogeneous Random Systems, Université de Cergy-Pontoise, 25 January 2000. To appear in Markov Processes and Related Fields

References in corpus (6)

• Logarithmic Corrections and Finite-Size Scaling in the Two-Dimensional 4-State Potts Model
• Universal Amplitude Ratios in the 3D Ising Model
• A Cluster Method for the Ashkin--Teller Model
• Dynamic Critical Behavior of a Swendsen-Wang-Type Algorithm for the Ashkin-Teller Model
• Dynamic Critical Behavior of the Swendsen-Wang Algorithm: The Two-Dimensional 3-State Potts Model Revisited
• The critical Ising lines of the d=2 Ashkin-Teller model