Dynamic Critical Behavio(u)r of a Cluster Algorithm for the Ashkin--Teller Model
classification
✦ hep-lat
keywords
ashkin--tellermodelalgorithmboundcriticaldynamicltapproxalong
read the original abstract
We study the dynamic critical behavior of a Swendsen--Wang--type algorithm for the Ashkin--Teller model. We find that the Li--Sokal bound on the autocorrelation time ($\tau_{{\rm int},{\cal E}} \ge {\rm const} \times C_H$) holds along the self-dual curve of the symmetric Ashkin--Teller model, but this bound is apparently not sharp. The ratio $\tau_{{\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$).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.