The BFACF algorithm and knotted polygons
- 7 December 1991
- journal article
- Published by IOP Publishing in Journal of Physics A: General Physics
- Vol. 24 (23) , 5553-5567
- https://doi.org/10.1088/0305-4470/24/23/021
Abstract
The BFACF algorithm applied to polygons involves sampling on a Markov chain whose state space is the set of all polygons. In three dimensions, for the simple cubic lattice. The authors prove that the ergodic classes of this Markov chain are the knot classes of the polygons.Keywords
This publication has 15 references indexed in Scilit:
- The dimensions of knotted polygonsJournal of Physics A: General Physics, 1991
- Dynamic critical exponent of the BFACF algorithm for self-avoiding walksJournal of Statistical Physics, 1991
- Monte Carlo test of a hyperscaling relation for the two-dimensional self-avoiding walk. IIJournal of Physics A: General Physics, 1990
- Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpointsJournal of Statistical Physics, 1990
- The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walkJournal of Statistical Physics, 1988
- Nonergodicity of local, length-conserving Monte Carlo algorithms for the self-avoiding walkJournal of Statistical Physics, 1987
- Dynamic critical exponent of some Monte Carlo algorithms for the self-avoiding walkJournal of Physics A: General Physics, 1986
- A new Monte-Carlo approach to the critical properties of self-avoiding random walksJournal de Physique, 1983
- Random paths and random surfaces on a digital computerPhysics Letters B, 1981
- Monte Carlo Calculations of the Dimensions of Polymers in a Restrictive Subvolume of SolutionThe Journal of Chemical Physics, 1965