Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints

Sergio Caracciolo, Andrea Pelissetto, Alan D. Sokal

    Research output: Contribution to journalArticle

    Abstract

    We study a new Monte Carlo algorithm for generating self-avoiding walks with variable length (controlled by a fugacity β) and fixed endpoints. The algorithm is a hybrid of local (BFACF) and nonlocal (cut-and-paste) moves. We find that the critical slowing-down, measured in units of computer time, is reduced compared to the pure BFACF algorithm:τCPU∼ 〈N〉≈2.3 versus 〈N〉≈3.0. We also prove some rigorous bounds on the autocorrelation time for these and related Monte Carlo algorithms.

    Original languageEnglish (US)
    Pages (from-to)1-53
    Number of pages53
    JournalJournal of Statistical Physics
    Volume60
    Issue number1-2
    DOIs
    StatePublished - Jul 1990

    Fingerprint

    Self-avoiding Walk
    Monte Carlo Algorithm
    Critical Slowing down
    Autocorrelation
    Unit
    autocorrelation

    Keywords

    • BFACF algorithm
    • critical exponent
    • cut-and-paste
    • Monte Carlo
    • pivot algorithm
    • polymer
    • Self-avoiding walk

    ASJC Scopus subject areas

    • Statistical and Nonlinear Physics
    • Physics and Astronomy(all)
    • Mathematical Physics

    Cite this

    Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints. / Caracciolo, Sergio; Pelissetto, Andrea; Sokal, Alan D.

    In: Journal of Statistical Physics, Vol. 60, No. 1-2, 07.1990, p. 1-53.

    Research output: Contribution to journalArticle

    Caracciolo, Sergio ; Pelissetto, Andrea ; Sokal, Alan D. / Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints. In: Journal of Statistical Physics. 1990 ; Vol. 60, No. 1-2. pp. 1-53.
    @article{cfc12c8b15764b979d7b2ee2220bb31c,
    title = "Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints",
    abstract = "We study a new Monte Carlo algorithm for generating self-avoiding walks with variable length (controlled by a fugacity β) and fixed endpoints. The algorithm is a hybrid of local (BFACF) and nonlocal (cut-and-paste) moves. We find that the critical slowing-down, measured in units of computer time, is reduced compared to the pure BFACF algorithm:τCPU∼ 〈N〉≈2.3 versus 〈N〉≈3.0. We also prove some rigorous bounds on the autocorrelation time for these and related Monte Carlo algorithms.",
    keywords = "BFACF algorithm, critical exponent, cut-and-paste, Monte Carlo, pivot algorithm, polymer, Self-avoiding walk",
    author = "Sergio Caracciolo and Andrea Pelissetto and Sokal, {Alan D.}",
    year = "1990",
    month = "7",
    doi = "10.1007/BF01013668",
    language = "English (US)",
    volume = "60",
    pages = "1--53",
    journal = "Journal of Statistical Physics",
    issn = "0022-4715",
    publisher = "Springer New York",
    number = "1-2",

    }

    TY - JOUR

    T1 - Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints

    AU - Caracciolo, Sergio

    AU - Pelissetto, Andrea

    AU - Sokal, Alan D.

    PY - 1990/7

    Y1 - 1990/7

    N2 - We study a new Monte Carlo algorithm for generating self-avoiding walks with variable length (controlled by a fugacity β) and fixed endpoints. The algorithm is a hybrid of local (BFACF) and nonlocal (cut-and-paste) moves. We find that the critical slowing-down, measured in units of computer time, is reduced compared to the pure BFACF algorithm:τCPU∼ 〈N〉≈2.3 versus 〈N〉≈3.0. We also prove some rigorous bounds on the autocorrelation time for these and related Monte Carlo algorithms.

    AB - We study a new Monte Carlo algorithm for generating self-avoiding walks with variable length (controlled by a fugacity β) and fixed endpoints. The algorithm is a hybrid of local (BFACF) and nonlocal (cut-and-paste) moves. We find that the critical slowing-down, measured in units of computer time, is reduced compared to the pure BFACF algorithm:τCPU∼ 〈N〉≈2.3 versus 〈N〉≈3.0. We also prove some rigorous bounds on the autocorrelation time for these and related Monte Carlo algorithms.

    KW - BFACF algorithm

    KW - critical exponent

    KW - cut-and-paste

    KW - Monte Carlo

    KW - pivot algorithm

    KW - polymer

    KW - Self-avoiding walk

    UR - http://www.scopus.com/inward/record.url?scp=0002519625&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0002519625&partnerID=8YFLogxK

    U2 - 10.1007/BF01013668

    DO - 10.1007/BF01013668

    M3 - Article

    VL - 60

    SP - 1

    EP - 53

    JO - Journal of Statistical Physics

    JF - Journal of Statistical Physics

    SN - 0022-4715

    IS - 1-2

    ER -