The generation of random equilateral polygons
From MaRDI portal
Publication:537896
Recommendations
- A fast ergodic algorithm for generating ensembles of equilateral random polygons
- Generating equilateral random polygons in confinement. II
- Generating equilateral random polygons in confinement
- Generating equilateral random polygons in confinement. III
- A fast direct sampling algorithm for equilateral closed polygons
Cites work
- scientific article; zbMATH DE number 1187090 (Why is no real title available?)
- scientific article; zbMATH DE number 1305557 (Why is no real title available?)
- scientific article; zbMATH DE number 1024108 (Why is no real title available?)
- scientific article; zbMATH DE number 3996829 (Why is no real title available?)
- scientific article; zbMATH DE number 1877234 (Why is no real title available?)
- scientific article; zbMATH DE number 1877235 (Why is no real title available?)
- scientific article; zbMATH DE number 1428887 (Why is no real title available?)
- scientific article; zbMATH DE number 5037104 (Why is no real title available?)
- scientific article; zbMATH DE number 5037109 (Why is no real title available?)
- scientific article; zbMATH DE number 3323627 (Why is no real title available?)
- A Statistical Study of Random Knotting Using the Vassiliev Invariants
- A new polynomial invariant of knots and links
- Anomalous finite-size effects for the mean-squared gyration radius of Gaussian random knots
- Asymptotics of knotted lattice polygons
- Energy, ropelength, and other physical aspects of equilateral knots.
- In Search of a Good Polygonal Knot Energy
- KNOTTING OF REGULAR POLYGONS IN 3-SPACE
- Lattice Models of Polymers
- Monte Carlo explorations of polygonal knot spaces
- Monte Carlo study of the interacting self-avoiding walk model in three dimensions.
- On the minimal weight of some singly-even codes
- Optimization by simulated annealing
- POLYGONAL KNOT SPACE NEAR ROPELENGTH-MINIMIZED KNOTS
- Predicting optimal lengths of random knots
- Scaling behavior of random knots
- Statistical topology of closed curves: some applications in polymer physics
- The Erdős--Nagy theorem and its ramifications
- The abundance of unknots in various models of polymer loops
- The average crossing number of equilateral random polygons
- The enumeration and classification of knots and links
- The first 1,701,936 knots
- The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
- The symplectic geometry of polygons in Euclidean space
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Under-knotted and over-knotted polymers. I: Unrestricted loops
Cited in
(17)- Knot probabilities in equilateral random polygons
- CoBarS: Fast reweighted sampling for polygon spaces in any dimension
- Generating equilateral random polygons in confinement. III
- A fast ergodic algorithm for generating ensembles of equilateral random polygons
- scientific article; zbMATH DE number 7278912 (Why is no real title available?)
- Generating equilateral random polygons in confinement. II
- Models of random knots
- Polymers with spatial or topological constraints: theoretical and computational results
- Few points to generate a random polytope
- A faster direct sampling algorithm for equilateral closed polygons and the probability of knotting
- scientific article; zbMATH DE number 7266344 (Why is no real title available?)
- Generating triangulations at random
- Topological sum rules in the knotting probabilities of DNA
- GRP_CH Heuristic for Generating Random Simple Polygon
- The symplectic geometry of closed equilateral random walks in 3-space
- Generation of Random Triangular Digital Curves Using Combinatorial Techniques
- An ergodic algorithm for generating knots with a prescribed injectivity radius
This page was built for publication: The generation of random equilateral polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q537896)