Answers are grounded in this paper and cite their sources.
Employing the Vassiliev invariants as tools for determining knot types of polygons in 3 dimensions, we evaluate numerically the knotting probability P K (N) of the Gaussian random polygon being equivalent to a knot type K. For prime knots and composite knots we plot the knotting probability P K (N) against the number N of polygonal nodes. Taking the analogy with the asymptotic scaling behaviors of self-avoiding walks, we propose a formula of fitting curves to the numerical data. The curves fit well the graphs of the knotting probability P K (N) versus N. This agreement suggests to us that the scaling formula for the knotting probability might also work for the random polygons other than the Gaussian random polygon.
No takes yet. Share an insight, caveat, or question.
Deguchi et al. (1994) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: