arXiv · 2501.04885
Direct Sampling of Confined Polygons in Linear Time
Abstract
We present an algorithm for sampling tightly confined random equilateral closed polygons in three-space which has runtime linear in the number of edges. Using symplectic geometry, sampling such polygons reduces to sampling a moment polytope, and in our confinement model this polytope turns out to be very natural from a combinatorial point of view. This connection to combinatorics yields both our fast sampling algorithm and explicit formulas for the expected distances of vertices to the origin. We use our algorithm to investigate the expected total curvature of confined polygons, leading to a very precise conjecture for the asymptotics of total curvature.
Explore related subjects
Keep this discovery
Clayton Shonkwiler, Kandin Theis. 2025-01-08. Direct Sampling of Confined Polygons in Linear Time. https://doi.org/10.1137/25m1747610
Cite the original work for its findings. Save a collection to share your selection of sources.