Non-local Monte Carlo algorithm for self-avoiding walks with variable length and free endpoints

Sergio Caracciolo, Andrea Pelissetto, Alan D. Sokal

    Research output: Contribution to journalArticle

    Abstract

    We discuss the dynamic critical behaviour of a Monte Carlo algorithm for self-avoiding walks of variable length and free endpoints. The algorithm works in the unorthodox ensemble consisting of all pairs of SAWs such that the total number of steps Ntot in the two walks is fixed. In two dimensions the autocorrelation time in CPU units grows as N≈1.5, and the behaviour improves in higher dimensions.

    Original languageEnglish (US)
    Pages (from-to)68-71
    Number of pages4
    JournalNuclear Physics B (Proceedings Supplements)
    Volume20
    Issue numberC
    DOIs
    StatePublished - May 20 1991

    ASJC Scopus subject areas

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

    Fingerprint Dive into the research topics of 'Non-local Monte Carlo algorithm for self-avoiding walks with variable length and free endpoints'. Together they form a unique fingerprint.

  • Cite this