CoBarS: Fast reweighted sampling for polygon spaces in any dimension
Abstract
We present the first algorithm for sampling random configurations of closed -gons with any fixed edgelengths in any dimension which is proved to sample correctly from standard probability measures on these spaces. We generate open -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 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 . For fixed dimension, these reweighting factors may be computed in 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