The BFACF algorithm and knotted polygons
From MaRDI portal
Publication:3994288
DOI10.1088/0305-4470/24/23/021zbMath0765.65005OpenAlexW2069159861MaRDI QIDQ3994288
E. J. Janse van Rensburg, Stuart G. Whittington
Publication date: 13 August 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/24/23/021
ergodicityknotMonte Carlo algorithmpolymersMarkov chainclassespolygonswalkscycle graphhypercubic latticeBFACF algorithm
Related Items (23)
The Curvature of Lattice Knots ⋮ Linking and link complexity of geometrically constrained pairs of rings ⋮ GENERALIZED ATMOSPHERIC SAMPLING OF KNOTTED POLYGONS ⋮ Topological effects on the mechanical properties of polymer knots ⋮ Statistical topology and knotting of fluctuating filaments ⋮ Random state transitions of knots: a first step towards modeling unknotting by type II topoisomerases ⋮ A Markov Chain Sampler for Plane Curves ⋮ Statics and dynamics of DNA knotting ⋮ An ergodic algorithm for generating knots with a prescribed injectivity radius ⋮ The compressibility of minimal lattice knots ⋮ Lattice knots in a slab ⋮ A study of polymer knots using a simple knot invariant consisting of multiple contour integrals ⋮ Polymers with spatial or topological constraints: theoretical and computational results ⋮ Statistical topology of closed curves: Some applications in polymer physics ⋮ Thoughts on lattice knot statistics ⋮ Monte Carlo Methods for Lattice Polygons ⋮ Squeezing knots ⋮ A symmetry motivated link table ⋮ A note on band surgery and the signature of a knot ⋮ A Monte Carlo algorithm for lattice ribbons. ⋮ The free energy of compressed lattice knots ⋮ Asymptotics of linked polygons ⋮ Bounds for minimum step number of knots confined to tubes in the simple cubic lattice
This page was built for publication: The BFACF algorithm and knotted polygons
