Performance of new algorithms for self-avoiding walks with fixed endpoints

Sergio Caracciolo, Andrea Pelissetto, Alan D. Sokal

    Research output: Contribution to journalArticle

    Abstract

    We discuss the dynamic critical behaviour of a hybrid Monte Carlo algorithm for the self-avoidings walks of variable length and fixed endpoints. A local algorithm is augmented by non-local cut-and-paste moves, which speed up equilibration within the subspace of walks with fixed length. The percentage of non-local moves can be optimized to get the lowest dynamic critical exponent for the autocorrelation time in CPU units.

    Original languageEnglish (US)
    Pages (from-to)525-528
    Number of pages4
    JournalNuclear Physics B - Proceedings Supplements
    Volume9
    Issue numberC
    DOIs
    StatePublished - 1989

    Fingerprint

    autocorrelation
    exponents

    ASJC Scopus subject areas

    • Nuclear and High Energy Physics

    Cite this

    Performance of new algorithms for self-avoiding walks with fixed endpoints. / Caracciolo, Sergio; Pelissetto, Andrea; Sokal, Alan D.

    In: Nuclear Physics B - Proceedings Supplements, Vol. 9, No. C, 1989, p. 525-528.

    Research output: Contribution to journalArticle

    Caracciolo, Sergio ; Pelissetto, Andrea ; Sokal, Alan D. / Performance of new algorithms for self-avoiding walks with fixed endpoints. In: Nuclear Physics B - Proceedings Supplements. 1989 ; Vol. 9, No. C. pp. 525-528.
    @article{1e448181bbb94600b26c3fbf2246f6a6,
    title = "Performance of new algorithms for self-avoiding walks with fixed endpoints",
    abstract = "We discuss the dynamic critical behaviour of a hybrid Monte Carlo algorithm for the self-avoidings walks of variable length and fixed endpoints. A local algorithm is augmented by non-local cut-and-paste moves, which speed up equilibration within the subspace of walks with fixed length. The percentage of non-local moves can be optimized to get the lowest dynamic critical exponent for the autocorrelation time in CPU units.",
    author = "Sergio Caracciolo and Andrea Pelissetto and Sokal, {Alan D.}",
    year = "1989",
    doi = "10.1016/0920-5632(89)90155-2",
    language = "English (US)",
    volume = "9",
    pages = "525--528",
    journal = "Nuclear and Particle Physics Proceedings",
    issn = "2405-6014",
    publisher = "Elsevier",
    number = "C",

    }

    TY - JOUR

    T1 - Performance of new algorithms for self-avoiding walks with fixed endpoints

    AU - Caracciolo, Sergio

    AU - Pelissetto, Andrea

    AU - Sokal, Alan D.

    PY - 1989

    Y1 - 1989

    N2 - We discuss the dynamic critical behaviour of a hybrid Monte Carlo algorithm for the self-avoidings walks of variable length and fixed endpoints. A local algorithm is augmented by non-local cut-and-paste moves, which speed up equilibration within the subspace of walks with fixed length. The percentage of non-local moves can be optimized to get the lowest dynamic critical exponent for the autocorrelation time in CPU units.

    AB - We discuss the dynamic critical behaviour of a hybrid Monte Carlo algorithm for the self-avoidings walks of variable length and fixed endpoints. A local algorithm is augmented by non-local cut-and-paste moves, which speed up equilibration within the subspace of walks with fixed length. The percentage of non-local moves can be optimized to get the lowest dynamic critical exponent for the autocorrelation time in CPU units.

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

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

    U2 - 10.1016/0920-5632(89)90155-2

    DO - 10.1016/0920-5632(89)90155-2

    M3 - Article

    VL - 9

    SP - 525

    EP - 528

    JO - Nuclear and Particle Physics Proceedings

    JF - Nuclear and Particle Physics Proceedings

    SN - 2405-6014

    IS - C

    ER -