A fast direct sampling algorithm for equilateral closed polygons

DOI10.1088/1751-8113/49/27/275202MaRDI QIDQ3186289zbMATH OpenOpenAlexFDO

Authors Jason Cantarella, Bertrand Duplantier, Clayton Shonkwiler, Erica Uehara

Publication date 9 August 2016

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1510.02466

zbMATH Keywords

closed random walk: random polygonCrankshaft algorithmpolygonal fold algorithmpolymer modelsrandom knot

Mathematics Subject Classification ID

Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Statistical mechanics of polymers (82D60)

Abstract: Sampling equilateral closed polygons is of interest in the statistical study of ring polymers. Over the past 30 years, previous authors have proposed a variety of simple Markov chain algorithms (but have not been able to show that they converge to the correct probability distribution) and complicated direct samplers (which require extended-precision arithmetic to evaluate numerically unstable polynomials). We present a simple direct sampler which is fast and numerically stable, and analyze its runtime using a new formula for the volume of equilateral polygon space as a Dirichlet-type integral.

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
• The symplectic geometry of closed equilateral random walks in 3-space
• Sampling spaces of thick polygons

Cited in

(17)

• Models of random knots
• Symplectic geometry and connectivity of spaces of frames
• Efficient sampling in spectrahedra and volume approximation
• The symplectic geometry of closed equilateral random walks in 3-space
• Random Triangles and Polygons in the Plane
• scientific article; zbMATH DE number 5375044 (Why is no real title available?)
• A fast ergodic algorithm for generating ensembles of equilateral random polygons
• New Stick Number Bounds from Random Sampling of Confined Polygons
• scientific article; zbMATH DE number 7278047 (Why is no real title available?)
• Sampling of Planar Curves: Theory and Fast Algorithms
• The generation of random equilateral polygons
• Sampling spaces of thick polygons
• Knot probabilities in equilateral random polygons
• A faster direct sampling algorithm for equilateral closed polygons and the probability of knotting
• CoBarS: Fast reweighted sampling for polygon spaces in any dimension
• A statistical approach to knot confinement via persistent homology
• Direct sampling of confined polygons in linear time

This page was built for publication: A fast direct sampling algorithm for equilateral closed polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3186289)