Off-lattice simulations of self-avoiding polygons up to length 2^27 show that the number of prime knot summands follows a Poisson distribution with characteristic knotting length 656500 ± 2500, supporting knot localization and entropy conjectures.
Clisby, Calculation of the connective constant for self-avoiding walks via the pivot algorithm, Journal of Physics A: Mathematical and Theoretical46, 245001 (2013)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cond-mat.stat-mech 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Random knotting in very long off-lattice self-avoiding polygons
Off-lattice simulations of self-avoiding polygons up to length 2^27 show that the number of prime knot summands follows a Poisson distribution with characteristic knotting length 656500 ± 2500, supporting knot localization and entropy conjectures.