References
- [Alexander and Briggs 26] J. W. Alexander and G. B. Briggs. “On Types of Knotted Curves.” Ann Math. 28:1/4 (1926), 562. doi: https://doi.org/10.2307/1968399.
- [Aragão de Carvalho and Caracciolo 83] C. Aragão de Carvalho and S. Caracciolo. “A New Monte Carlo Approach to the Critical Properties of Self-Avoiding Random Walks.” J Phys France. 44:3 (1983), 323–331. doi: https://doi.org/10.1051/jphys:01983004403032300.
- [Aragão de Carvalho et al. 83] C. Aragão de Carvalho, S. Caracciolo, and J. Fröhlich. “Polymers and g|ϕ|4 Theory in Four Dimensions.” Nuclear Phys B. 215:2 (1983), 209–248. doi: https://doi.org/10.1016/0550-3213(83)90213-4.
- [Arnol’d 95] V. I. Arnol’d. “The Geometry of Spherical Curves and the Algebra of Quaternions.” Russ Math Surv. 50:1 (1995), 1. doi: https://doi.org/10.1070/RM1995v050n01ABEH001662.
- [Ashton et al. 17] T. Ashton, J. Cantarella, and H. Chapman. plCurve: Fast polygon library. Available online (http://www.jasoncantarella.com/wordpress/software/plcurve/), 2017.
- [Barbensi and Celoria 18] A. Barbensi and D. Celoria. “The Reidemeister Graph Is a Complete Knot Invariant.” ArXiv Preprints, Available online (http://arxiv.org/abs/1801.03313v1), 2018.
- [Benjamini and Curien 13] I. Benjamini and N. Curien. “Simple Random Walk on the Uniform Infinite Planar Quadrangulation: Subdiffusivity via Pioneer Points.” Geom Funct Anal. 23:2 (2013), 501–531. doi: https://doi.org/10.1007/s00039-013-0212-0.
- [Berg and Foerster 81] B. Berg and D. Foerster. “Random Paths and Random Surfaces on a Digital Computer.” Phys Lett B. 106:4 (1981), 323–326. doi: https://doi.org/10.1016/0370-2693(81)90545-1.
- [Buck and Zechiedrich 04] G. R. Buck and E. L. Zechiedrich. “DNA Disentangling By Type-2 Topoisomerases.” J Mol Biol. 340:5 (2004), 933–939. doi: https://doi.org/10.1016/j.jmb.2004.05.034.
- [Cantarella et al. 16] J. Cantarella, H. Chapman, and M. Mastin. “Knot Probabilities in Random Diagrams.” J Phys A Math Theor. 49:40 (2016), 405001. doi: https://doi.org/10.1088/1751-8113/49/40/405001.
- [Chang and Erickson 17] H.-C. Chang and J. Erickson. “Untangling Planar Curves.” Discrete Comput Geom. 58:4 (2017), 889–920. doi: https://doi.org/10.1007/s00454-017-9907-6.
- [Chapman 17] H. Chapman. “Asymptotic Laws for Random Knot Diagrams.” J Phys A Math Theor. 50 (2017), 2255001. doi: https://doi.org/10.1088/1751-8121/aa6e45. arXiv: 1608.02638 [math.GT].
- [Chapman 18] H. Chapman. “Slipknotting in the Knot Diagram Model.” arXiv.org. Available online (https://doi.org/https://arxiv.org/pdf/1803.07114.pdf), 2018.
- [Conway and Guttmann 96] A. Conway and A. J. Guttmann. “Square Lattice Self-Avoiding Walks and Corrections to Scaling.” Phys Rev Lett. 77:26 (1996), 5284.
- [Coquereaux and Zuber 16] R. Coquereaux, and J.-B. Zuber. “Maps, Immersions and Permutations.” J Knot Theory Ramificat. 25:8 (2016), 1650047. doi: https://doi.org/10.1142/s0218216516500474.
- [Culler 17] M. Culler, N. M. Dunfield, and J. R. Weeks. SnapPy, a computer program for studying the geometry and topology of 3-manifolds. Available online (http://snappy.computop.org), 2017.
- [Deguchi and Tsurusaki 97] T. Deguchi, and K. Tsurusaki. “Universality of Random Knotting.” Phys Rev E. 55:5 (1997), 6245–6248. doi: https://doi.org/10.1103/physreve.55.6245.
- [Delbrück 62] M. Delbrück. “Knotting Problems in Biology.” Chap. 5. In Mathematical Problems in the Biological Sciences, edited by R. Bellman, pp. 55–63. Providence, RI: American Mathematical Society, 1962.
- [Diao 95] Y. Diao. “The Knotting of Equilateral Polygons in R3.” J Knot Theory Ramificat. 4:2 (1995), 189–196. doi: https://doi.org/10.1142/S0218216595000090.
- [Diao et al. 12] Y. Diao, C. Ernst, and U. Ziegler. “Generating Large Random Knot Projections.” Chap. 23. In Physical and Numerical Models in Knot Theory, edited by J. A. Calvo, K. C. Millett, E. J. Rawdon, and A. Stasiak, pp. 473–494. Singapore: World Scientific, 2012.
- [Drmota and Panagiotou 13] M. Drmota, and K. Panagiotou. “A Central Limit Theorem for the Number of Degree-k Vertices in Random Maps.” Algorithmica. 66:4 (2013), 741–761. doi: https://doi.org/10.1007/s00453-013-9751-x.
- [Dunfield et al. 14] N. Dunfield, A. Hirani, M. Obeidin, A. Ehrenberg, S. Bhattacharyya, and D. Lei. Random Knots: A Preliminary Report. Available online (http://www.math.uiuc.edu/∼nmd/preprints/slides/random_knots.pdf), 2014.
- [Even-Zohar et al. 16] C. Even-Zohar, J. Hass, N. Linial, and T. Nowik. “Invariants of Random Knots and Links.” Discrete Comput Geom. 56:2 (2016), 274–314. doi: https://doi.org/10.1007/s00454-016-9798-y.
- [Ewing and Millett 91] B. Ewing and K. C. Millett. “A Load Balanced Algorithm for the Calculation of the Polynomial Knot and Link Invariants.” In The Mathematical Heritage of C. F. Gauss, pp. 225–266. River Edge, NJ: World Scientific Publishing, 1991.
- [Ewing and Millett 97] B. Ewing and K. C. Millett. “Computational Algorithms and the Complexity of Link Polynomials.” In Progress in Knot Theory and Related Topics, vol. 56, pp. 51–68. Hermann, Paris: Travaux en Cours, 1997.
- [Flajolet and Sedgewick 09] P. Flajolet and R. Sedgewick. Analytic Combinatorics. Cambridge, UK: Cambridge University Press, 2009.
- [Freyd 85] P. Freyd, D. Yetter, J. Hoste, W. B. R. Lickorish, K. Millett, and A. Ocneanu. “A New Polynomial Invariant of Knots and Links.” Bull Am Math Soc. 12:2 (1985), 239–247. doi: https://doi.org/10.1090/s0273-0979-1985-15361-3.
- [Frisch and Wasserman 61] H. L. Frisch and E. Wasserman. “Chemical Topology 1.” J Am Chem Soc. 83:18 (1961), 3789–3795. doi: https://doi.org/10.1021/ja01479a015.
- [Gao and Richmond 94] Z. Gao and L. Richmond. “Root Vertex Valency Distributions of Rooted Maps and Rooted Triangulations.” Eur J Combinator. 15:5 (1994), 483–490. doi: https://doi.org/10.1006/eujc.1994.1050.
- [Gao and Wormald 00] Z. Gao and N. C. Wormald. “The Distribution of the Maximum Vertex Degree in Random Planar Maps.” J Combinat Theory Ser A. 89:2 (2000), 201–230. doi: https://doi.org/10.1006/jcta.1999.3006.
- [Geyer 91] C. J. Geyer. “Markov Chain Monte Carlo Maximum Likelihood, Computing Science and Statistics.” In Proceedings of the 23rd Symposium Interface, pp. 156–163. Fairfax Station, VA: Interface Foundation of North America, 1991.
- [Graaf and Schrijver 97] M. D. Graaf and A. Schrijver. “Making Curves Minimally Crossing by Reidemeister Moves.” J Combinat Theory Ser B. 70:1 (1997), 134–156. doi: https://doi.org/10.1006/jctb.1997.1754.
- [Guitter and Orlandini 99] E. Guitter and E. Orlandini. “Monte Carlo Results for Projected Self-Avoiding Polygons: a Two-Dimensional Model for Knotted Polymers.” J Phys A Math Gen. 32:8 (1999), 1359–1385. doi: https://doi.org/10.1088/0305-4470/32/8/006.
- [Hammersley 61] J. M. Hammersley. “The Number of Polygons on a Lattice.” Math Proc Camb Phil Soc. 57:3 (1961), 516. doi: https://doi.org/10.1017/S030500410003557X.
- [Hass and Lagarias 01] J. Hass and J. Lagarias. “The Number of Reidemeister Moves Needed for Unknotting.” J Amer Math Soc. 14:2 (2001), 399–428.
- [Hass and Scott 94] J. Hass, and P. Scott. “Shortening Curves on Surfaces.” Topology 33:1 (1994), 25–43. doi: https://doi.org/10.1016/0040-9383(94)90033-7.
- [Henrich and Nelson 10] A. Henrich and S. Nelson. “Semiquandles and at Virtual Knots.” Pac J Math. 248:1 (2010), 155–170. doi: https://doi.org/10.2140/pjm.2010.248.155.
- [Kanenobu 86] T. Kanenobu. “Infinitely Many Knots with the Same Polynomial Invariant.” Proc Am Math Soc. 97:1 (1986), 158–158. doi: https://doi.org/10.1090/s0002-9939-1986-0831406-7.
- [Kauffman 87] L. H. Kauffman. “State Models and the Jones Polynomial.” Topology 26.3 (1987), 395–407. doi: https://doi.org/10.1016/0040-9383(87)90009-7.
- [Kauffman and Lambropoulou 06] L. Kauffman and H. S. Lambropoulou. “Hard Unknots and Collapsing Tangles.” Paper presented at the Introductory Lectures on Knot Theory: Selected Lectures presented at the Advanced School and Conference on Knot Theory and its Applications to Physics and Biology ICTP, Trieste, Italy, May 11–29, 2006.
- [Kauffman and Manturov 06] L. H. Kauffman and V. O. Manturov. “Virtual Knots and Links.” Proc Steklov Inst Math. 252:1 (2006), 104–121. doi: https://doi.org/10.1134/s0081543806010111.
- [Lackenby 15] M. Lackenby. “A Polynomial Upper Bound on Reidemeister Moves.” Ann Math. 182:2 (2015), 491–564.
- [Lal 69] M. Lal. “Monte Carlo Computer Simulation of Chain Molecules. I.” Mol Phys. 17:1 (1969), 57–64.
- [Liskovets 99] V. A. Liskovets. “A Pattern of Asymptotic Vertex Valency Distributions in Planar Maps.” J Combin Theory Ser B. 75:1 (1999), 116–133. doi: https://doi.org/10.1006/jctb.1998.1870.
- [Madras and Slade 13] N. Madras and G. Slade. The Self-Avoiding Walk. Probability and Its Applications. Boston: Birkhäuser. Available online (https://books.google.com/books?id=JsoFCAAAQBAJ), 2013.
- [Madras and Sokal 88] N. Madras, and A. D. Sokal. “The Pivot Algorithm: A Highly Efficient Monte Carlo Method for the Self-Avoiding Walk.” J Stat Phys. 50:1–2 (1988), 109–186.
- [Metropolis et al. 53] N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller. “Equation of State Calculations by Fast Computing Machines.” J. Chem. Phys. 21:6 (1953), 1087–1092. doi: https://doi.org/10.1063/1.1699114.
- [Millett 10] K. C. Millett. “Knots, Slipknots, and Ephemeral Knots in Random Walks and Equilateral Polygons.” J Knot Theory Ramificat. 19:5 (2010), 601–615. doi: https://doi.org/10.1142/S0218216510008078.
- [Nowik 09] T. Nowik. “Complexity of Plane and Spherical Curves.” Duke Math J. 148:1 (2009), 107–118. doi: https://doi.org/10.1215/00127094-2009-022.
- [Obeidin 16] M. Obeidin. “Volumes of Random Alternating Link Diagrams.” arXiv: 1611.04944. Available online (http://arxiv.org/abs/1611.04944v2), 2016.
- [Orlandini et al. 98] E. Orlandini, M. C. Tesi, E. J. J. V. Rensburg, and S. G. Whittington. “Asymptotics of Knotted Lattice Polygons.” J Phys A Math Gen. 31:28 (1998), 5953–5967. doi: https://doi.org/10.1088/0305-4470/31/28/010.
- [Orlandini and Whittington 07] E. Orlandini and S. G. Whittington. “Statistical Topology of Closed Curves: Some Applications in Polymer Physics.” Rev Mod Phys. 79:2 (2007), 611–642. doi: https://doi.org/10.1103/revmodphys.79.611.
- [Orlandini 98] E. Orlandini. (1998). “Monte Carlo Study of Polymer Systems by Multiple Markov Chain Method.” In Numerical Methods for Polymeric Systems, pp. 33–57. New York: Springer.
- [Pippenger 89] N. Pippenger. “Knots in Random Walks.” Discrete Appl Math. 25:3 (1989), 273–278. doi: https://doi.org/10.1016/0166-218x(89)90005-x.
- [Reidemeister 48] K. Reidemeister. Knotentheorie. Ergebnisse Der Mathematik Und Ihrer Grenzgebiete. Berlin: Chelsea Pub. Co. Available online (https://books.google.com/books?id=W8s-AAAAIAAJ), 1948.
- [Rensburg and Whittington 91] E. J. J. V. Rensburg and S. G. Whittington. “The Dimensions of Knotted Polygons.” J. Phys. A: Math. Gen. 24:16 (1991), 3935–3948. doi: https://doi.org/10.1088/0305-4470/24/16/028.
- [Rensburg and Rechnitzer 11] E. J. J. V. Rensburg and A. Rechnitzer. “On the Universality of Knot Probability Ratios.” J Phys A Math Theor. 44:16 (2011), 162002.
- [Rensburg and Whittington 91] Rensburg, E. J. J. V. and S. G. Whittington. “The BFACF Algorithm and Knotted Polygons.” J Phys A Math Gen. 24:23 (1991), 5553–5567. doi: https://doi.org/10.1088/0305-4470/24/23/021.
- [Schaeffer 97] G. Schaeffer. “Bijective Census and Random Generation of Eulerian Planar Maps with Prescribed Vertex Degrees.” In The Electronic Journal of Combinatorics 4.1 (1997), R20, 14 p. Available at http://eudml.org/doc/119255.
- [Schaeffer 99a] G. Schaeffer. PlanarMap. Available Online (http://www.lix.polytechnique.fr/∼schaeffe/PagesWeb/PlanarMap/index-en.html), 1999a.
- [Schaeffer 99b] G. Schaeffer. “Random Sampling of Large Planar Maps and Convex Polyhedra.” In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing. STOC '99, pp. 760–769. Atlanta, GA: ACM, 1999b.
- [Schaeffer and Zinn-Justin 04] G. Schaeffer and P. Zinn-Justin. “On the Asymptotic Number of Plane Curves and Alternating Knots.” Exp Math. 13:4 (2004), 483–493.
- [Sumners and Whittington 88] D. W. Sumners and S. G. Whittington. “Knots in Self-Avoiding Walks.” J Phys A Math Gen. 21:7 (1988), 1689–1694. doi: https://doi.org/10.1088/0305-4470/21/7/030.
- [Sundberg and Thistlethwaite 98] C. Sundberg and M. Thistlethwaite. “The Rate of Growth of the Number of Prime Alternating Links and Tangles.” Pac J Math. 182:2 (1998), 329–358. doi: https://doi.org/10.2140/pjm.1998.182.329.
- [Thistlethwaite 98] M. Thistlethwaite. “On The Structure and Scarcity of Alternating Links and Tangles.” J Knot Theory Ramificat. 7:7 (1998), 981–1004. doi: https://doi.org/10.1142/s021821659800053x.
- [Trigueros et al. 01] S. Trigueros, J. Arsuaga, M. E. Vazquez, D. W. Sumners, and J. Roca. “Novel Display of Knotted DNA Molecules by Two-Dimensional Gel Electrophoresis.” Nucleic Acids Res. 29:13 (2001), E67.
- [Valette 16] G. Valette. “A Classification of Spherical Curves Based on Gauss Diagrams.” Arnold Math J. (2016), 1–23. doi: https://doi.org/10.1007/s40598-016-0049-3.
- [Vanderzande 95] C. Vanderzande. “On Knots in a Model for the Adsorption of Ring Polymers.” J Phys A Math Gen. 28:13 (1995), 3681.
- [Wang and Landau 01] F. Wang and D. P. Landau. “Efficient, Multiple-Range Random Walk Algorithm To Calculate the Density of States.” Phys Rev Lett. 86:10 (2001), 2050–2053. doi: https://doi.org/10.1103/physrevlett.86.2050.
- [Zinn-Justin and Zuber 02] P. Zinn-Justin, and J.-B. Zuber. “Matrix Integrals and the Counting of Tangles and Links.” Discrete Math. 246:1–3 (2002), 343–360. doi: https://doi.org/10.1016/s0012-365x(01)00267-9.
- [Zinn-Justin and Zuber 09] P. Zinn-Justin and J.-B. Zuber. “Knot Theory and Matrix Integrals.” In: Random Matrix Theory, edited by A. Baik and D. Francesco. Oxford, UK: Oxford University Press, 2009. Available at https://arxiv.org/pdf/1006.1812.pdf.