The generation of random equilateral polygons (Q537896): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4948131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5603705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Statistical Study of Random Knotting Using the Vassiliev Invariants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimal weight of some singly-even codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: In Search of a Good Polygonal Knot Energy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5477842 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average crossing number of equilateral random polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predicting optimal lengths of random knots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scaling behavior of random knots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial invariant of knots and links / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3378438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The first 1,701,936 knots / rank
 
Normal rank
Property / cites work
 
Property / cites work: The symplectic geometry of polygons in Euclidean space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4722986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk. / rank
 
Normal rank
Property / cites work
 
Property / cites work: KNOTTING OF REGULAR POLYGONS IN 3-SPACE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2725554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Energy, ropelength, and other physical aspects of equilateral knots. / rank
 
Normal rank
Property / cites work
 
Property / cites work: POLYGONAL KNOT SPACE NEAR ROPELENGTH-MINIMIZED KNOTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The abundance of unknots in various models of polymer loops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5477847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5477848 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical topology of closed curves: Some applications in polymer physics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotics of knotted lattice polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anomalous finite-size effects for the mean-squared gyration radius of Gaussian random knots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte Carlo study of the interacting self-avoiding walk model in three dimensions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős--Nagy theorem and its ramifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice Models of Polymers / rank
 
Normal rank

Latest revision as of 02:47, 4 July 2024

scientific article
Language Label Description Also known as
English
The generation of random equilateral polygons
scientific article

    Statements

    The generation of random equilateral polygons (English)
    0 references
    0 references
    0 references
    0 references
    23 May 2011
    0 references
    Four popular methods to generate random equilateral polygons in three-space are described: the polygonal folding method, the Grankshaft rotation method, the Hedgehog method, and the triangle method. The authors compare the implementation and efficacy of these procedures, especially with regards to the population distribution of polygons in the space of polygonal knots, the distribution of edge vectors, the local curvature, and the local torsion. The authors give a rigorous proof that the Grankshaft rotation method is ergodic and they also show that this provides a fast, attractive alternative to the polygonal folding method, which was already known to be ergodic.
    0 references
    knot space
    0 references
    probability of knotting
    0 references
    Monte Carlo method
    0 references
    Pivot method
    0 references
    polygonal folding
    0 references
    Grankshaft rotations
    0 references
    Hedgehog method
    0 references
    triangle method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers