Ergodicity of the BFACF algorithm in three dimensions

DOI10.1088/0305-4470/25/5/012MaRDI QIDQ4008075zbMATH OpenOpenAlexFDO

Authors E. J. Janse van Rensburg

Publication date 27 September 1992

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/25/5/012

zbMATH Keywords

ergodicity classesMonte Carlo simulations

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Other physical applications of random processes (60K40) Monte Carlo methods (65C05) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Recommendations

• The BFACF algorithm and knotted polygons
• The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
• BFACF-style algorithms for polygons in the body-centered and face-centered cubic lattices
• Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints.
• Ergodicity of the Wang–Swendsen–Kotecký algorithm on several classes of lattices on the torus

Cited in

(5)

• Thoughts on lattice knot statistics
• Generalized atmospheric sampling of knotted polygons
• Monte Carlo Methods for Lattice Polygons
• The BFACF algorithm and knotted polygons
• Squeezing knots

This page was built for publication: Ergodicity of the BFACF algorithm in three dimensions

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