The pivot algorithm and polygons: results on the FCC lattice

DOI10.1088/0305-4470/23/9/021zbMath0714.65109OpenAlexW1965803677MaRDI QIDQ3200527

Neal Madras, E. J. Janse van Rensburg, Stuart 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 efficiencyergodic Markov chainpivot algorithmself-avoiding random walksNumerical resultsface-centred cubic latticeself-avoiding polygon

Mathematics Subject Classification ID

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) Probabilistic methods, stochastic differential equations (65C99)

Related Items (6)

Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints. ⋮ Join-and-Cut algorithm for self-avoiding walks with variable length and free endpoints ⋮ Efficiency of the incomplete enumeration algorithm for Monte-Carlo simulation of linear and branched polymers ⋮ The Erdős--Nagy theorem and its ramifications ⋮ Reconfiguring convex polygons ⋮ Monte Carlo Methods for Lattice Polygons

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