Knot probabilities in random diagrams

We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to compute exact probabilities for knots in this model. As expected, most diagrams with 10 and fewer crossings are unknots (about 78% of the roughly 1.6 billion 10 crossing diagrams). For these crossing numbers, the unknot fraction is mostly explained by the prevalence of tree-like diagrams which are unknots for any assignment of over/under information at crossings. The data shows a roughly linear relationship between the log of knot type probability and the log of the frequency rank of the knot type, analogous to Zipf's law for word frequency. All knot frequencies are available as ancillary data.

[1]  Yuen Ren Chao,et al.  Human Behavior and the Principle of Least Effort: An Introduction to Human Ecology , 1950 .

[2]  Y. Hashizume.  On the uniqueness of the decomposition of a link , 1958 .

[3]  S. Edwards.  Statistical mechanics with topological constraints: I , 1967 .

[4]  T. Walsh,et al.  Counting rooted maps by genus II , 1972 .

[5]  Jenö Lehel,et al.  Generating all 4-regular planar graphs from the graph of the octahedron , 1981, J. Graph Theory.

[6]  S. Whittington,et al.  Knots in self-avoiding walks , 1988 .

[7]  Louis H. Kauffman,et al.  New invariants in the theory of knots , 1988 .

[8]  Nicholas Pippenger,et al.  Knots in random walks , 1989, Discret. Appl. Math..

[9]  Stuart G. Whittington,et al.  Entanglement complexity of graphs in Z3 , 1992, Mathematical Proceedings of the Cambridge Philosophical Society.

[10]  F. Aicardi.  Tree-like curves , 1994 .

[11]  V. Arnold.  Plane curves, their invariants, Perestroikas, and classifications , 1994 .

[12]  Xiao-Song Lin,et al.  Integral geometry of plane curves and knot invariants , 1994 .

[13]  N. Pippenger,et al.  On Random Knots , 1994 .

[14]  S. Gusein-Zade.  On the enumeration of curves from infinity to infinity , 1994 .

[15]  Y. Diao.  The Knotting of Equilateral Polygons in R3 , 1995 .

[16]  A. Vershik,et al.  Random walks on braid groups: Brownian bridges, complexity and statistics , 1996 .

[17]  Gilles Schaeer,et al.  Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees , 1997 .

[18]  S. Gusein-Zade,et al.  COMMUNICATIONS OF THE MOSCOW MATHEMATICAL SOCIETY: On the number of topological types of plane curves , 1998 .

[19]  M. Polyak.  Invariants of curves and fronts via Gauss diagrams , 1998 .

[20]  On the number of topological types of plane curves , 1998 .

[21]  Brendan D. McKay,et al.  Isomorph-Free Exhaustive Generation , 1998, J. Algorithms.

[22]  I. Darcy.  BIOLOGICAL DISTANCES ON DNA KNOTS AND LINKS: Applications to XER recombination , 2001 .

[23]  A TRANSFER MATRIX APPROACH TO THE ENUMERATION OF KNOTS , 2001, math-ph/0102015.

[24]  Yuanan Diao,et al.  Global Knotting in Equilateral Random Polygons , 2001 .

[25]  P. Francesco,et al.  Census of planar maps: From the one-matrix model solution to a combinatorial proof , 2002, cond-mat/0207682.

[26]  Paul Zinn-Justin,et al.  On the Asymptotic Number of Plane Curves and Alternating Knots , 2004, Exp. Math..

[27]  Paul Wollan,et al.  Generation of simple quadrangulations of the sphere , 2005, Discret. Math..

[28]  S G Whittington,et al.  Statistical topology of closed curves: Some applications in polymer physics , 2007 .

[29]  Ranking knots of random, globular polymer rings. , 2007, Physical review letters.

[30]  B. McKay,et al.  Fast generation of planar graphs , 2007 .

[31]  Hyeyoung Moon.  Calculating knot distances and solving tangle equations involving Montesinos links , 2010 .

[32]  Gábor Domokos,et al.  Generating spherical multiquadrangulations by restricted vertex splittings and the reducibility of equilibrium classes , 2012, ArXiv.

[33]  Matt Mastin.  Links and Planar Diagram Codes , 2013, 1309.3288.

[34]  J. Zuber,et al.  Maps, immersions and permutations , 2015, 1507.03163.

[35]  Sunder Ram Krishnan,et al.  Random knots using Chebyshev billiard table diagrams , 2015, 1505.07681.

[36]  C. Shonkwiler,et al.  A fast direct sampling algorithm for equilateral closed polygons , 2015, 1510.02466.

[37]  Harrison Chapman,et al.  Asymptotic laws for random knot diagrams , 2016, 1608.02638.

[38]  Nathan Linial,et al.  Invariants of Random Knots and Links , 2014, Discret. Comput. Geom..

[39]  A Classification of Spherical Curves Based on Gauss Diagrams , 2016 .