English

CoBarS: Fast reweighted sampling for polygon spaces in any dimension

Differential Geometry 2023-10-31 v1 Statistical Mechanics Probability

Abstract

We present the first algorithm for sampling random configurations of closed nn-gons with any fixed edgelengths r1,,rnr_1, \dots, r_n in any dimension dd which is proved to sample correctly from standard probability measures on these spaces. We generate open nn-gons as weighted sets of edge vectors on the unit sphere and close them by taking a M\"obius transformation of the sphere which moves the center of mass of the edges to the origin. Using previous results of the authors, such a M\"obius transformation can be found in O(n)O(n) time. The resulting closed polygons are distributed according to a pushforward measure. The main contribution of the present paper is the explicit calculation of reweighting factors which transform this pushforward measure to any one of a family of standard measures on closed polygon space, including the symplectic volume for polygons in R3\mathbb{R}^3. For fixed dimension, these reweighting factors may be computed in O(n)O(n) time. Experimental results show that our algorithm is efficient and accurate in practice, and an open-source reference implementation is provided.

Keywords

Cite

@article{arxiv.2310.19134,
  title  = {CoBarS: Fast reweighted sampling for polygon spaces in any dimension},
  author = {Jason Cantarella and Henrik Schumacher},
  journal= {arXiv preprint arXiv:2310.19134},
  year   = {2023}
}

Comments

27 pages, 8 figures

R2 v1 2026-06-28T13:05:16.703Z