pith. sign in

arxiv: 2601.04102 · v1 · pith:FSWFRGNYnew · submitted 2026-01-07 · ❄️ cond-mat.stat-mech · math.GT· math.PR

Random knotting in very long off-lattice self-avoiding polygons

Jason Cantarella , Tetsuo Deguchi , Henrik Schumacher , Clayton Shonkwiler , Erica Uehara This is my paper

Pith reviewed 2026-05-21 15:50 UTC · model grok-4.3

classification ❄️ cond-mat.stat-mech math.GTmath.PR
keywords random knottingself-avoiding polygonsPoisson distributionknot localizationpolymer entanglementknot probabilities
0
0 comments X

The pith

The number of prime knot summands in random long self-avoiding polygons follows a Poisson distribution.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper generates enormous samples of off-lattice self-avoiding polygons using an efficient pivot algorithm and determines their exact knot types. It shows that for any fixed knot type K, the number of times K appears as a separate prime factor in the overall knot of the polygon follows a Poisson distribution very closely. A sympathetic reader would care because this gives a precise statistical description of how knots form and add up in long random chains, which models polymers and DNA, and it gives a numerical value for the characteristic scale at which knotting becomes common.

Core claim

The number of prime summands of knot type K in a random n-gon is very well described by a Poisson distribution. The characteristic length of knotting is estimated as 656500 ± 2500. These results agree with previous on-lattice computations and support both knot localization and the knot entropy conjecture.

What carries the argument

The scale-free pivot algorithm combined with Clisby's tree data structure for generating uniform random self-avoiding polygons, paired with a knot diagram simplification and invariant-free classification method to identify exact knot types.

If this is right

  • More accurate measurement of knotting rates and amplitude ratios using counts from large n.
  • Confirmation that knot probabilities behave as expected from localization ideas.
  • Support for the conjecture that knot entropy grows in a certain way with chain length.
  • Consistency between off-lattice bead-chain models and earlier lattice-based simulations.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • These Poisson statistics suggest that knot formation events along a long chain are independent rare occurrences, allowing simple probabilistic models for entanglement in polymers.
  • Extending to even longer chains could test if the Poisson description holds without limit or if interactions appear at very large scales.
  • The characteristic length provides a concrete scale for when knotting effects become dominant in physical polymer systems.

Load-bearing premise

The polygons generated by the scale-free pivot algorithm are truly uniformly distributed according to the self-avoiding measure, and the knot classification code identifies every knot type without any systematic errors.

What would settle it

Generating even longer polygons and checking whether the distribution of knot summands still fits the Poisson prediction within statistical error, or if the estimated characteristic length remains stable.

Figures

Figures reproduced from arXiv: 2601.04102 by Clayton Shonkwiler, Erica Uehara, Henrik Schumacher, Jason Cantarella, Tetsuo Deguchi.

Figure 1
Figure 1. Figure 1: These plots show the probability P(m31 (n) = m) of observing m trefoil summands in off-lattice self-avoiding polygons of length n, together with the Poisson distribution function (λK(n))me −λK(n) m! from (1). This is defined only at integer m, but we draw connecting curves as guides for the eye. The number of n-gons sampled (2 43/n) decreases with n, so the data appears rougher for large n. We restricted o… view at source ↗
Figure 2
Figure 2. Figure 2: These plots show the probability P(m41 (n) = m), P(m51 (n) = m), P(m52 (n) = m), and P(m61 ) = m) of observing m summands of knot type 41, 51/5 m 1 , 52/5 m 2 , or 61/6 m 1 in off-lattice self-avoiding polygons of length n, together with the Poisson distribution functions (λK(n))me −λK(n) m! from (1). Since these knots are much less probable than trefoils, only large values of n are shown. The Poisson fit … view at source ↗
Figure 3
Figure 3. Figure 3: This figure shows the total variation distance [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: The log-log plot at left shows the rate of knotting per edge: [PITH_FULL_IMAGE:figures/full_fig_p007_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Fraction of knots and unknots for n-edge SAPs, together with plots of e −n/n0 and 1 − e −n/n0 with the characteristic length n0 = 656 500 estimated from knotting rates. The plot stops at n = 223 because we observed no unknotted SAPs for larger n. more complex knots Rcomplex(n) := X K : cr(K)>6 RK(n) = − 1 n log P01 − X K : cr(K)≤6 RK(n) Using this method, a conservative estimate is that for 2 10 ≤ n ≤ 2 21… view at source ↗
Figure 6
Figure 6. Figure 6: The probability of knot type K = 31 or K = 3m 1 , along with 99% confidence intervals, based on observed counts in our dataset (the errors were estimated with Geyer’s IPS estimate for each Markov chain, then combined across parallel chains assuming independence). The data fits well to the standard model (3). The coefficient CK and the βK and γK for the finite-size correction are comparable to those measure… view at source ↗
read the original abstract

We present experimental results on knotting in off-lattice self-avoiding polygons in the bead-chain model. Using Clisby's tree data structure and the scale-free pivot algorithm, for each $k$ between $10$ and $27$ we generated $2^{43-k}$ polygons of size $n=2^k$. Using a new knot diagram simplification and invariant-free knot classification code, we were able to determine the precise knot type of each polygon. The results show that the number of prime summands of knot type $K$ in a random $n$-gon is very well described by a Poisson distribution. We estimate the characteristic length of knotting as $656500 \pm 2500$. We use the count of summands for large $n$ to measure knotting rates and amplitude ratios of knot probabilities more accurately than previous experiments. Our calculations agree quite well with previous on-lattice computations, and support both knot localization and the knot entropy conjecture.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 0 minor

Summary. The manuscript reports Monte Carlo simulations of off-lattice self-avoiding polygons (SAPs) in the bead-chain model using the scale-free pivot algorithm and Clisby's tree data structure. For lengths n = 2^k (k = 10 to 27), ensembles of size 2^{43-k} are generated. A new knot-diagram simplification combined with an invariant-free classification procedure determines the exact knot type of each polygon. The central claims are that the number of prime summands of each knot type K is well-described by a Poisson distribution, yielding a characteristic knotting length of 656500 ± 2500, together with improved measurements of knotting rates and amplitude ratios that agree with prior on-lattice work and support knot localization and the knot entropy conjecture.

Significance. The enormous sample sizes (up to 2^43 polygons) and close numerical agreement with earlier lattice results provide high-precision evidence for Poisson statistics of knot summands if the classification is accurate. The characteristic length is obtained by direct fitting rather than algebraic re-expression of prior parameters. These results would furnish a valuable benchmark for theoretical models of random knotting in polymers and strengthen support for localization in the scaling limit.

major comments (1)
  1. [description of the knot diagram simplification and invariant-free classification procedure] The Poisson fits and the reported characteristic length 656500 ± 2500 rest entirely on per-type counts of prime summands produced by the new invariant-free knot classification code. The manuscript provides no quantitative error-rate measurement, cross-validation against an invariant-based classifier (e.g., Jones polynomial), or test on known composite knots for the large diagrams arising at n = 2^27. Systematic misidentification of prime factors would bias the summand histograms, the fitted Poisson parameters, and therefore the length estimate. A controlled accuracy assessment on a representative subsample is required to confirm that the central claims are not affected by classification errors.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for the positive assessment of its significance. We address the major comment on the validation of the knot classification procedure below.

read point-by-point responses

  1. Referee: The Poisson fits and the reported characteristic length 656500 ± 2500 rest entirely on per-type counts of prime summands produced by the new invariant-free knot classification code. The manuscript provides no quantitative error-rate measurement, cross-validation against an invariant-based classifier (e.g., Jones polynomial), or test on known composite knots for the large diagrams arising at n = 2^27. Systematic misidentification of prime factors would bias the summand histograms, the fitted Poisson parameters, and therefore the length estimate. A controlled accuracy assessment on a representative subsample is required to confirm that the central claims are not affected by classification errors.

    Authors: We agree that the manuscript would be strengthened by the inclusion of a quantitative accuracy assessment for the invariant-free classification procedure. The current version does not report explicit error rates or cross-validation results against invariant-based methods. In the revised manuscript we will add a new subsection that describes the diagram simplification algorithm in greater detail and presents controlled validation tests performed on representative subsamples. These will include direct comparison of the invariant-free classifier against the Jones polynomial for 10^5 polygons with n ≤ 2^20 and systematic checks on artificially constructed composite knots whose prime factors are known a priori. The results of these tests will be used to bound the possible bias in the summand counts and to confirm that the reported Poisson parameters and characteristic length remain robust within the stated uncertainties. revision: yes

Circularity Check

0 steps flagged

No circularity: knotting statistics derived from direct sampling and empirical fitting

full rationale

The derivation proceeds by generating ensembles of off-lattice self-avoiding polygons via the scale-free pivot algorithm, applying a knot-diagram simplification and invariant-free classification procedure to identify prime summands, counting occurrences per knot type K across sampled n-gons, and fitting a Poisson distribution plus characteristic length directly to those counts. None of these steps reduces the reported Poisson description or the length estimate 656500 ± 2500 to a definitional re-expression, a fitted input renamed as prediction, or a self-citation chain; the outputs remain independent empirical measurements on the sampled data.

Axiom & Free-Parameter Ledger

1 free parameters · 2 axioms · 0 invented entities

The central claims rest on the correctness of the uniform sampling procedure for self-avoiding polygons and the accuracy of the knot classification procedure; these are domain assumptions rather than derived results.

free parameters (1)
  • characteristic length of knotting = 656500
    Fitted from the observed counts of knot summands at large n to parameterize the Poisson distribution.
axioms (2)
  • domain assumption The scale-free pivot algorithm with Clisby's tree data structure produces samples distributed according to the uniform measure on self-avoiding polygons.
    This assumption underlies the claim that the generated polygons represent random n-gons.
  • domain assumption The knot diagram simplification and invariant-free classification code returns the correct knot type for every generated polygon.
    Required for the precise knot-type counts that support the Poisson distribution claim.

pith-pipeline@v0.9.0 · 5717 in / 1479 out tokens · 59562 ms · 2026-05-21T15:50:00.339700+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

56 extracted references · 56 canonical work pages

  1. [1]

    M. A. Krasnow, A. Stasiak, S. J. Spengler, F. Dean, T. Koller, and N. R. Cozzarelli, Determination of the absolute handedness of knots and catenanes of DNA, Nature304, 559 (1983)

    work page 1983

  2. [2]

    V. V. Rybenkov, N. R. Cozzarelli, and A. V. Vologodskii, Probability of DNA knotting and the effective diameter of the DNA double helix, Proceedings of the National Academy of Sciences90, 5307 (1993)

    work page 1993

  3. [3]

    S. Y. Shaw and J. C. Wang, Knotting of a DNA chain during ring closure, Science260, 533 (1993)

    work page 1993

  4. [4]

    R. K. Sharma, I. Agrawal, L. Dai, P. S. Doyle, and S. Garaj, Complex DNA knots detected with a nanopore sensor, Nature Communications10, 4473 (2019)

    work page 2019

  5. [5]

    S. F. Edwards, Statistical mechanics with topological constraints: II, Journal of Physics A: General Physics1, 15 (1968)

    work page 1968

  6. [6]

    Hagita, T

    K. Hagita, T. Murashima, N. Sakata, K. Shimokawa, T. Deguchi, E. Uehara, and S. Fujiwara, Molecular dynamics of topological barriers on the crystallization behavior of ring polyethylene melts with trefoil knots, Macromolecules56, 15 (2023)

    work page 2023

  7. [7]

    W. W. Graessley and D. S. Pearson, Stress–strain behavior in polymer networks containing nonlocalized junctions, The Journal of Chemical Physics66, 3363 (1977)

    work page 1977

  8. [8]

    H. L. Frisch and E. Wasserman, Chemical topology, Journal of the American Chemical Society83, 3789 (1961)

    work page 1961

  9. [9]

    Delbrück, Knotting problems in biology, inMathematical Problems in the Biological Sciences, Pro- ceedings of Symposia in Applied Mathematics No

    M. Delbrück, Knotting problems in biology, inMathematical Problems in the Biological Sciences, Pro- ceedings of Symposia in Applied Mathematics No. 14, edited by R. E. Bellman (American Mathematical Society, 1962) pp. 55–63. 11

    work page 1962

  10. [10]

    A. V. Vologodskii, A. V. Lukashin, M. D. Kamenetskiˇ ı, and V. V. Anshelevich, The knot problem in statistical mechanics of polymer chains, Soviet Journal of Experimental and Theoretical Physics39, 1059 (1974)

    work page 1974

  11. [11]

    des Cloizeaux and M

    J. des Cloizeaux and M. Mehta, Topological constraints on polymer rings and critical indices, Journal de Physique40, 665 (1979)

    work page 1979

  12. [12]

    M. L. Bret, Monte carlo computation of the supercoiling energy, the sedimentation constant, and the radius of gyration of unknotted and knotted circular dna, Bioploymers19, 619 (1980)

    work page 1980

  13. [13]

    J. P. J. Michels and F. W. Wiegel, Probability of knots in a polymer ring, Phys. Lett. A90, 381 (1982)

    work page 1982

  14. [14]

    Koniaris and M

    K. Koniaris and M. Muthukumar, Knottedness in ring polymers, Physical Review Letters66, 2211 (1991)

    work page 1991

  15. [15]

    Deguchi and K

    T. Deguchi and K. Tsurusaki, A statistical study of random knotting using the Vassiliev invariants, Journal of Knot Theory and Its Ramifications3, 321 (1994)

    work page 1994

  16. [16]

    Deguchi and K

    T. Deguchi and K. Tsurusaki, Universality of random knotting, Physical Review E55, 6245 (1997)

    work page 1997

  17. [17]

    Uehara and T

    E. Uehara and T. Deguchi, Knotting probability of self-avoiding polygons under a topological constraint, Journal of Chemical Physics147, 094901 (2017)

    work page 2017

  18. [18]

    Xiong, A

    A. Xiong, A. J. Taylor, M. R. Dennis, and S. G. Whittington, Knot probabilities in equilateral random polygons, Journal of Physics A: Mathematical and Theoretical54, 405001 (2021)

    work page 2021

  19. [19]

    Cantarella, H

    J. Cantarella, H. Schumacher, and C. Shonkwiler, A faster direct sampling algorithm for equilateral closed polygons and the probability of knotting, Journal of Physics A: Mathematical and Theoretical 57, 285205 (2024)

    work page 2024

  20. [20]

    D. W. Sumners and S. G. Whittington, Knots in self-avoiding walks, Journal of Physics A: Mathematical and General21, 1689 (1988)

    work page 1988

  21. [21]

    Pippenger, Knots in random walks, Discrete Applied Mathematics25, 273 (1989)

    N. Pippenger, Knots in random walks, Discrete Applied Mathematics25, 273 (1989)

    work page 1989

  22. [22]

    Katrich, W

    V. Katrich, W. K. Olson, A. Vologodskii, J. Dubochet, and A. Stasiak, Tightness of random knotting, Physical Review E61, 5545 (2000)

    work page 2000

  23. [23]

    Marcone, E

    B. Marcone, E. Orlandini, A. L. Stella, and F. Zonta, What is the length of a knot in a polymer?, Journal of Physics A: Mathematical and General38, L15 (2005)

    work page 2005

  24. [24]

    Marcone, E

    B. Marcone, E. Orlandini, A. L. Stella, and F. Zonta, Size of knots in ring polymers, Physical Review E 75, 041105 (2007)

    work page 2007

  25. [25]

    Orlandini, A

    E. Orlandini, A. L. Stella, and C. Vanderzande, The size of knots in polymers, Physical Biology6, 025012 (2009)

    work page 2009

  26. [26]

    Orlandini, E

    E. Orlandini, E. J. Janse Van Rensburg, M. C. Tesi, and S. G. Whittington, Entropic Exponents of Knotted Lattice Polygons, inTopology and Geometry in Polymer Science, The IMA Volumes in Mathematics and Its Applications No. 103, edited by Whittington, S. G., Sumners, D. W., and Lodge, T. (Springer, New York, 1998) pp. 9–21

    work page 1998

  27. [27]

    For very largem, we know thatP (mn K = m) = 0, while (λK (n))me−λK (n) m! > 0, so the two sides of(1) cannot be exactly equal

    work page

  28. [28]

    S. G. Whittington, (2025), personal communication

    work page 2025

  29. [29]

    N. R. Beaton, K. Ishihara, M. Atapour, J. W. Eng, M. Vazquez, K. Shimokawa, and C. E. Soteros, A first proof of knot localization for polymers in a nanochannel, Journal of Physics A: Mathematical and Theoretical57, 38LT01 (2024)

    work page 2024

  30. [30]

    N. R. Beaton, K. Ishihara, M. Atapour, J. W. Eng, M. Vazquez, K. Shimokawa, and C. E. Soteros, Entanglement statistics of polymers in a lattice tube and unknotting of 4-plats, Discrete Applied Mathematics379, 242 (2026)

    work page 2026

  31. [31]

    Orlandini, M

    E. Orlandini, M. C. Tesi, E. J. Janse van Rensburg, and S. G. Whittington, Entropic exponents of lattice polygons with specified knot type, Journal of Physics A: Mathematical and General29, L299 (1996)

    work page 1996

  32. [32]

    Orlandini, M

    E. Orlandini, M. C. Tesi, E. J. Janse van Rensburg, and S. G. Whittington, Asymptotics of knotted lattice polygons, Journal of Physics A: Mathematical and General31, 5953 (1998)

    work page 1998

  33. [33]

    E. J. Janse Van Rensburg and A. Rechnitzer, On the universality of knot probability ratios, Journal of Physics A: Mathematical and General44, 162002 (2011)

    work page 2011

  34. [34]

    Uehara and T

    E. Uehara and T. Deguchi, Characteristic length of the knotting probability revisited, Journal of Physics: Condensed Matter27, 354104 (2015)

    work page 2015

  35. [35]

    E. J. Janse van Rensburg, The probability of knotting in lattice polygons, inPhysical Knots: Knotting, Linking, and Folding Geometric Objects in R 3: AMS Special Session on Physical Knotting and Unknot- 12 ting, Las Vegas, Nevada, April 21-22, 2001, Contemporary Mathematics No. 304, edited by Calvo, J. A., Millett, K. C., and Rawdon, E.J. (American Mathem...

    work page 2001

  36. [36]

    , vn where the spheres centered atvi andv i+1 (as well asvn andv 1) must be tangent [54–56]

    Here, a ring polymer is modeled by interior-disjoint unit diameter spheres centered atv1, . . . , vn where the spheres centered atvi andv i+1 (as well asvn andv 1) must be tangent [54–56]

    work page

  37. [37]

    Madras and A

    N. Madras and A. D. Sokal, The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walk, Journal of Statistical Physics50, 109 (1988)

    work page 1988

  38. [38]

    Clisby, Calculation of the connective constant for self-avoiding walks via the pivot algorithm, Journal of Physics A: Mathematical and Theoretical46, 245001 (2013)

    N. Clisby, Calculation of the connective constant for self-avoiding walks via the pivot algorithm, Journal of Physics A: Mathematical and Theoretical46, 245001 (2013)

    work page 2013

  39. [39]

    Clisby, Efficient implementation of the pivot algorithm for self-avoiding walks, Journal of Statistical Physics140, 349 (2010)

    N. Clisby, Efficient implementation of the pivot algorithm for self-avoiding walks, Journal of Statistical Physics140, 349 (2010)

    work page 2010

  40. [40]

    Clisby, Accurate estimate of the critical exponentν for self-avoiding walks via a fast implementation of the pivot algorithm, Physical Review Letters104, 055702 (2010)

    N. Clisby, Accurate estimate of the critical exponentν for self-avoiding walks via a fast implementation of the pivot algorithm, Physical Review Letters104, 055702 (2010)

    work page 2010

  41. [41]

    Clisby and D

    N. Clisby and D. T. C. Ho, Off-lattice and parallel implementations of the pivot algorithm, Journal of Physics: Conference Series2122, 012008 (2021)

    work page 2021

  42. [42]

    Schnabel and W

    S. Schnabel and W. Janke, Monte Carlo simulation of long hard-sphere polymer chains in two to five dimensions, Macromolecular Theory and Simulations32, 2200080 (2023)

    work page 2023

  43. [43]

    Schnabel and W

    S. Schnabel and W. Janke, Accelerating polymer simulation by means of tree data-structures and a parsimonious Metropolis algorithm, Computer Physics Communications256, 107414 (2020)

    work page 2020

  44. [44]

    Schumacher and J

    H. Schumacher and J. Cantarella, Knoodle,https://github.com/HenrikSchumacher/Knoodle (2025)

    work page 2025

  45. [45]

    Boldo, Kahan’s algorithm for a correct discriminant computation at last formally proven, IEEE Transactions on Computers58, 220 (2009)

    S. Boldo, Kahan’s algorithm for a correct discriminant computation at last formally proven, IEEE Transactions on Computers58, 220 (2009)

    work page 2009

  46. [46]

    Jeannerod, N

    C.-P. Jeannerod, N. Louvet, and J.-M. Muller, Further analysis of Kahan’s algorithm for the accurate computation of2×2determinants, Mathematics of Computation82, 2245 (2013)

    work page 2013

  47. [47]

    Cantarella, H

    J. Cantarella, H. Schumacher, and C. Shonkwiler, Hard unknots are often easy from a different perspective (in preparation)

    work page

  48. [48]

    Cantarella, H

    J. Cantarella, H. Schumacher, and C. Shonkwiler, A very fast code for knot classification up to 13 crossings (in preparation)

    work page

  49. [49]

    Cantarella, T

    J. Cantarella, T. Deguchi, H. Schumacher, C. Shonkwiler, and E. Uehara, Data for: Random knotting in very long off-lattice self-avoiding polygons [Dataset] (2025), Dryad

    work page 2025

  50. [50]

    C. J. Geyer, Practical Markov chain Monte Carlo, Statistical Science7, 473 (1992)

    work page 1992

  51. [51]

    This is the maximum difference between the probabilities of any event (such asmn K = m) according to the two distributions

    work page

  52. [52]

    Baiesi, E

    M. Baiesi, E. Orlandini, and A. L. Stella, The entropic cost to tie a knot, Journal of Statistical Mechanics: Theory and Experiment2010, P06012 (2010)

    work page 2010

  53. [53]

    Deguchi and E

    T. Deguchi and E. Uehara, Topological sum rules in the knotting probabilities of DNA, inTopology and Geometry of Biopolymers, Contemporary Mathematics, Vol. 746, edited by E. Flapan and H. Wong (American Mathematical Society, Providence, RI, USA, 2020) pp. 57–83

    work page 2020

  54. [54]

    S. D. Stellman and P. J. Gans, Efficient computer simulation of polymer conformation. I. Geometric properties of the hard-sphere model, Macromolecules5, 516 (1972)

    work page 1972

  55. [55]

    Kenyon and P

    R. Kenyon and P. Winkler, Branched polymers, American Mathematical Monthly116, 612 (2009)

    work page 2009

  56. [56]

    McMullen, M

    A. McMullen, M. Holmes-Cerfon, F. Sciortino, A. Y. Grosberg, and J. Brujic, Freely jointed polymers made of droplets, Physical Review Letters121, 138002 (2018)

    work page 2018