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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
