Distribution of the distance between opposite nodes of random polygons with a fixed knot
Akihisa Yao, Hiroshi Tsukahara, Tetsuo Deguchi, Takeo Inami

TL;DR
This study numerically analyzes the distribution of distances between opposite nodes in random polygons with fixed knots, revealing Gaussian-like behavior and universal scaling properties across different knot types.
Contribution
It introduces a numerical analysis of distance distributions in knotted polygons and demonstrates universal scaling and Gaussian behavior for various knot types.
Findings
Distribution fits self-avoiding walk scaling form
Re-scaled distributions become universal Gaussian
Introduces a fitting formula for gyration radius distribution
Abstract
We examine numerically the distribution function of distance between opposite polygonal nodes for random polygons of nodes with a fixed knot type . Here we consider three knots such as , and . In a wide range of , the shape of is well fitted by the scaling form of self-avoiding walks. The fit yields the Gaussian exponents and . Furthermore, if we re-scale the intersegment distance by the average size of random polygons of knot , the distribution function of the variable should become the same Gaussian distribution for any large value of and any knot . We also introduce a fitting formula to the distribution of gyration radius for random polygons under some topological constraint .
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.
