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

Sergio Caracciolo, Andrea Pelissetto, Alan D. Sokal

    Research output: Contribution to journalArticlepeer-review


    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)
    Issue numberC
    StatePublished - Jun 1989

    ASJC Scopus subject areas

    • Atomic and Molecular Physics, and Optics
    • Nuclear and High Energy Physics


    Dive into the research topics of 'Performance of new algorithms for self-avoiding walks with fixed endpoints'. Together they form a unique fingerprint.

    Cite this