Recommendations
- A faster direct sampling algorithm for equilateral closed polygons and the probability of knotting
- An ergodic algorithm for generating knots with a prescribed injectivity radius
- Sampling large random knots in a confined space
- Random knots using Chebyshev billiard table diagrams
- Asymptotic laws for random knot diagrams
Cites work
- A central limit theorem for the number of degree-\(k\) vertices in random maps
- A classification of spherical curves based on Gauss diagrams
- A new polynomial invariant of knots and links
- A pattern of asymptotic vertex valency distributions in planar maps
- A polynomial upper bound on Reidemeister moves
- Analytic combinatorics
- Asymptotic laws for random knot diagrams
- Asymptotics of knotted lattice polygons
- Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees
- Complexity of plane and spherical curves
- Equation of state calculations by fast computing machines
- scientific article; zbMATH DE number 140170 (Why is no real title available?)
- scientific article; zbMATH DE number 1303211 (Why is no real title available?)
- scientific article; zbMATH DE number 1305557 (Why is no real title available?)
- scientific article; zbMATH DE number 3188477 (Why is no real title available?)
- scientific article; zbMATH DE number 3198429 (Why is no real title available?)
- Infinitely Many Knots with the Same Polynomial Invariant
- Invariants of random knots and links
- Knot probabilities in random diagrams
- Knots in random walks
- Knots in self-avoiding walks
- KNOTS, SLIPKNOTS, AND EPHEMERAL KNOTS IN RANDOM WALKS AND EQUILATERAL POLYGONS
- Making curves minimally crossing by Reidemeister moves
- Maps, immersions and permutations
- Matrix integrals and the counting of tangles and links
- Monte Carlo results for projected self-avoiding polygons: a two-dimensional model for knotted polymers
- On knots in a model for the adsorption of ring polymers
- On the Asymptotic Number of Plane Curves and Alternating Knots
- On the structure and scarcity of alternating links and tangles
- On the universality of knot probability ratios
- Random sampling of large planar maps and convex polyhedra
- Root vertex valency distributions of rooted maps and rooted triangulations
- Semiquandles and flat virtual knots
- Shortening curves on surfaces
- Simple random walk on the uniform infinite planar quadrangulation: Subdiffusivity via pioneer points
- State models and the Jones polynomial
- Statistical topology of closed curves: some applications in polymer physics
- The BFACF algorithm and knotted polygons
- The dimensions of knotted polygons
- The distribution of the maximum vertex degree in random planar maps
- The geometry of spherical curves and the algebra of quaternions
- The Knotting of Equilateral Polygons in R3
- The number of Reidemeister moves needed for unknotting
- The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
- The rate of growth of the number of prime alternating links and tangles
- The self-avoiding walk.
- Untangling planar curves
- Virtual knots and links
Cited in
(4)
This page was built for publication: A Markov Chain Sampler for Plane Curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5094488)