The pivot algorithm and polygons: results on the FCC lattice

DOI10.1088/0305-4470/23/9/021MaRDI QIDQ3200527zbMATH OpenOpenAlexFDO

Authors E. J. Janse van Rensburg, Neal Madras, S. G. Whittington

Publication date 1990

Published in Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1088/0305-4470/23/9/021

zbMATH Keywords

simulationequilibriumcomputational efficiencypivot algorithmself-avoiding random walksNumerical resultsface-centred cubic latticeergodic Markov chainself-avoiding polygon

Mathematics Subject Classification ID

Probabilistic methods, stochastic differential equations (65C99) Sums of independent random variables; random walks (60G50) Kinetic theory of gases in time-dependent statistical mechanics (82C40) Kinetic theory of gases in equilibrium statistical mechanics (82B40)

Recommendations

• The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
• A faster implementation of the pivot algorithm for self-avoiding walks
• Efficient implementation of the Pivot algorithm for self-avoiding walks
• Cut-and-permute algorithm for self-avoiding walks in the presence of surfaces
• BFACF-style algorithms for polygons in the body-centered and face-centered cubic lattices

Cited in

(11)

• A faster implementation of the pivot algorithm for self-avoiding walks
• Join-and-Cut algorithm for self-avoiding walks with variable length and free endpoints
• A variant of the recoil growth algorithm to generate multi-polymer systems
• The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
• Monte Carlo Methods for Lattice Polygons
• Reconfiguring convex polygons
• Efficient implementation of the Pivot algorithm for self-avoiding walks
• The Erdős--Nagy theorem and its ramifications
• BFACF-style algorithms for polygons in the body-centered and face-centered cubic lattices
• Efficiency of the incomplete enumeration algorithm for Monte-Carlo simulation of linear and branched polymers
• Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints.

This page was built for publication: The pivot algorithm and polygons: results on the FCC lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3200527)