An ergodic algorithm for generating knots with a prescribed injectivity radius

DOI10.1142/S0218216519500457zbMath1429.57004arXiv1603.02770OpenAlexW2963312130WikidataQ122955302 ScholiaQ122955302MaRDI QIDQ5378505

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

Markov chainrandom knotropelengthinjective radiusthickness of a knotphysical knot

Mathematics Subject Classification ID

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

Related Items (1)

Models of random knots

Cites Work

• The symplectic geometry of closed equilateral random walks in 3-space
• The generation of random equilateral polygons
• Markov chains and stochastic stability
• The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
• The Erdős--Nagy theorem and its ramifications
• POLYGONAL KNOT SPACE NEAR ROPELENGTH-MINIMIZED KNOTS
• The BFACF algorithm and knotted polygons
• KNOTTING OF REGULAR POLYGONS IN 3-SPACE
• APPROXIMATING SMOOTH THICKNESS
• Convexification of polygons by flips and by flipturns
• Unnamed Item
• Unnamed Item
• Unnamed Item

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