Knot probabilities in equilateral random polygons

Abstract

We consider the probability of knotting in equilateral random polygons in Euclidean 3-dimensional space, which model, for instance, random polymers. Results from an extensive Monte Carlo dataset of random polygons indicate a universal scaling formula for the knotting probability with the number of edges. This scaling formula involves an exponential function, independent of knot type, with a power law factor that depends on the number of prime components of the knot. The unknot, appearing as a composite knot with zero components, scales with a small negative power law, contrasting with previous studies that indicated a purely exponential scaling. The methodology incorporates several improvements over previous investigations: our random polygon data set is generated using a fast, unbiased algorithm, and knotting is detected using an optimised set of knot invariants based on the Alexander polynomial.

24 pages, 8 figures

References in corpus (3)

• Universal properties of knotted polymer rings
• On the Limits of Analogy Between Self-Avoidance and Topology-Driven Swelling of Polymer Loops
• The entropic cost to tie a knot

Cited by in corpus (4)

• A faster direct sampling algorithm for equilateral closed polygons and the probability of knotting
• Random knotting in very long off-lattice self-avoiding polygons
• Entanglement statistics of polymers in a lattice tube and unknotting of 4-plats
• New Statistical Topology Theory Predicts Turbulent Magnetic Emergence from the Sun's Interior