An ergodic algorithm for generating knots with a prescribed injectivity radius

DOI10.1142/S0218216519500457MaRDI QIDQ5378505zbMATH OpenOpenAlexWikidataFDO

Authors Kyle Leland Chapman

Publication date 31 May 2019

Published in Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1603.02770

zbMATH Keywords

injective radiusMarkov chainphysical knotrandom knotropelengththickness of a knot

Mathematics Subject Classification ID

Knot theory (57K10) Relations of manifolds and cell complexes with biology (57Z10) Relations of manifolds and cell complexes with chemistry (57Z15) Relations of manifolds and cell complexes with engineering (57Z20) Convergence of probability measures (60B10) Discrete-time Markov processes on general state spaces (60J05)

Abstract: The first algorithm for sampling the space of thick equilateral knots, as a function of thickness, will be described. This algorithm is based on previous algorithms of applying random reflections. To prove the existence of the algorithm, we describe a method for turning any knot into the regular planar polygon using only thickness non-decreasing moves. This approach ensures that the algorithm has a positive probability of connecting any two knots with the required thickness constraint and so is ergodic. This ergodic sampling unlocks the ability to analyze the effects of thickness on properties of the geometric knot such as radius of gyration. This algorithm will be shown to be faster than previous methods for generating thick knots, and the data from this algorithm shows that the radius of gyration increases strongly with thickness and that the growth exponent for radius of gyration increases with thickness.

Recommendations

• A fast ergodic algorithm for generating ensembles of equilateral random polygons
• Off-lattice random walks with excluded volume: a new method of generation, proof of ergodicity and numerical results
• Sampling large random knots in a confined space
• The BFACF algorithm and knotted polygons
• Squeezing knots

Cites work

• APPROXIMATING SMOOTH THICKNESS
• Convexification of polygons by flips and by flipturns
• scientific article; zbMATH DE number 4068937 (Why is no real title available?)
• scientific article; zbMATH DE number 480232 (Why is no real title available?)
• scientific article; zbMATH DE number 4119105 (Why is no real title available?)
• KNOTTING OF REGULAR POLYGONS IN 3-SPACE
• Markov chains and stochastic stability
• POLYGONAL KNOT SPACE NEAR ROPELENGTH-MINIMIZED KNOTS
• The BFACF algorithm and knotted polygons
• The Erdős--Nagy theorem and its ramifications
• The generation of random equilateral polygons
• The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
• The symplectic geometry of closed equilateral random walks in 3-space

Cited in

(7)

• Models of random knots
• The mean squared writhe of alternating random knot diagrams
• Off-lattice random walks with excluded volume: a new method of generation, proof of ergodicity and numerical results
• A Markov Chain Sampler for Plane Curves
• Sampling spaces of thick polygons
• AN EASY AND FAST ALGORITHM FOR OBTAINING MINIMAL DISCRETE KNOTS
• A faster direct sampling algorithm for equilateral closed polygons and the probability of knotting

This page was built for publication: An ergodic algorithm for generating knots with a prescribed injectivity radius

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