Perfect Sampling for Hard Spheres from Strong Spatial Mixing

05/03/2023

∙

by   Konrad Anand, et al.

∙

0

∙

share

We provide a perfect sampling algorithm for the hard-sphere model on subsets of ℝ^d with expected running time linear in the volume under the assumption of strong spatial mixing. A large number of perfect and approximate sampling algorithms have been devised to sample from the hard-sphere model, and our perfect sampling algorithm is efficient for a range of parameters for which only efficient approximate samplers were previously known and is faster than these known approximate approaches. Our methods also extend to the more general setting of Gibbs point processes interacting via finite-range, repulsive potentials.