Dynamic critical behavior of a Swendsen-Wang-type algorithm for the Ashkin-Teller model

Jesús Salas, Alan D. Sokal

    Research output: Contribution to journalArticlepeer-review

    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 (τint. δ ≥ const × CH) holds along the self-dual curve of the symmetric Ashkin-Teller model, and is almost, but not quite sharp. The ratio τint. δ /CH appears to tend to infinity either as a logarithm or as a small power (0.05 ≤ p ≤ 0.12). In an appendix we discuss the problem of extracting estimates of the exponential autocorrelation time.

    Original languageEnglish (US)
    Pages (from-to)297-361
    Number of pages65
    JournalJournal of Statistical Physics
    Volume85
    Issue number3-4
    DOIs
    StatePublished - Nov 1996

    Keywords

    • Ashkin-Teller model
    • Autocorrelation time
    • Cluster algorithm
    • Critical slowing down
    • Dynamical critical behavior
    • Fitting correlated data
    • Ising model
    • Li-Sokal bound
    • Monte Carlo
    • Potts model
    • Swendsen-Wang algorithm

    ASJC Scopus subject areas

    • Statistical and Nonlinear Physics
    • Mathematical Physics

    Fingerprint

    Dive into the research topics of 'Dynamic critical behavior of a Swendsen-Wang-type algorithm for the Ashkin-Teller model'. Together they form a unique fingerprint.

    Cite this