Direct Sampling of Confined Polygons in Linear Time
SIAM Journal on Discrete Mathematics · 30.06.2026 · 40 (2) · 505-535
DOI: 10.1137/25m1747610 ↗Kurz gefasst
Fachartikel in der Zeitschrift SIAM Journal on Discrete Mathematics, online erschienen am 07.04.2026. Verfasst von Clayton Shonkwiler und 1 weiteren Autor:innen. Die Arbeit nennt 87 Literaturangaben. Gefördert von: National Science Foundation.
Abstract (Originalsprache)
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 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.
Förderung
- National Science Foundation
Zitieren
APA
Shonkwiler, C., & Theis, K. (2026). Direct Sampling of Confined Polygons in Linear Time. SIAM Journal on Discrete Mathematics, 40(2), 505-535. https://doi.org/10.1137/25m1747610
Vancouver
Shonkwiler C, Theis K. Direct Sampling of Confined Polygons in Linear Time. SIAM Journal on Discrete Mathematics. 2026;40(2):505-535. doi:10.1137/25m1747610
BibTeX
@article{Shonkwiler2026,
author = {Shonkwiler, Clayton and Theis, Kandin},
title = {Direct Sampling of Confined Polygons in Linear Time},
journal = {SIAM Journal on Discrete Mathematics},
year = {2026},
volume = {40},
number = {2},
pages = {505--535},
doi = {10.1137/25m1747610}
}
EUVIMED