Dynamical critical behavior of a Swendsen-Wang-type algorithm for the Ashkin-Teller model
Journal Article
·
· Journal of Statistical Physics
- New York Univ., NY (United States)
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}{sub int, {epsilon}} {ge} const x C{sub H}) holds along the self-dual curve of the symmetric Ashkin-Teller model, and is almost, but not quite sharp. The ratio {tau}{sub int, {epsilon}}/C{sub H} appears to tend to infinity either as a logarithm or as a small power (0.05 {approx_lt} p {approx_lt} 0.12). In an appendix we discuss the problem of extracting estimates of the exponential autocorrelation time.
- Sponsoring Organization:
- USDOE
- OSTI ID:
- 441458
- Journal Information:
- Journal of Statistical Physics, Journal Name: Journal of Statistical Physics Journal Issue: 3-4 Vol. 85; ISSN JSTPBS; ISSN 0022-4715
- Country of Publication:
- United States
- Language:
- English
Similar Records
Empirical relations between static and dynamic exponents for Ising model cluster algorithms
Rigorous lower bound on the dynamic critical exponent of some multilevel Swendsen-Wang algorithms
Generalization of the Fortuin-Kasteleyn-Swendsen-Wang representation and Monte Carlo algorithm
Journal Article
·
Sun Feb 16 23:00:00 EST 1992
· Physical Review Letters; (United States)
·
OSTI ID:7205807
Rigorous lower bound on the dynamic critical exponent of some multilevel Swendsen-Wang algorithms
Journal Article
·
Mon Sep 16 00:00:00 EDT 1991
· Physical Review Letters; (United States)
·
OSTI ID:5242817
Generalization of the Fortuin-Kasteleyn-Swendsen-Wang representation and Monte Carlo algorithm
Journal Article
·
Thu Sep 15 00:00:00 EDT 1988
· Phys. Rev. D; (United States)
·
OSTI ID:6793282