Average size of random polygons with fixed knot topology
Hiroshi Matsuda, Akihisa Yao, Hiroshi Tsukahara, Tetsuo Deguchi, Ko, Furuta, Takeo Inami

TL;DR
This study uses numerical simulations to analyze the average size of random polygons with fixed knot types, confirming a scaling law and comparing exponents with self-avoiding and random polygons.
Contribution
It provides the first detailed numerical analysis of how fixed knot topology influences the size scaling of random polygons.
Findings
Scaling law $R^2_K o N^{2 u_K}$ confirmed across a wide range of N
Exponent $2 u_K$ estimated between 1.11 and 1.16, aligning with self-avoiding polygons
In smaller N range, exponent close to 1, similar to random polygons
Abstract
We have evaluated by numerical simulation the average size of random polygons of fixed knot topology , and we have confirmed the scaling law for the number of polygonal nodes in a wide range; -- 2200. The best fit gives -- 1.16 with good fitting curves in the whole range of . The estimate of is consistent with the exponent of self-avoiding polygons. In a limited range of (), however, we have another fit with -- 1.07, which is close to the exponent of random polygons.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
