Perfect Sampling for Gibbs Point Processes Using Partial Rejection Sampling
Abstract
We present a perfect sampling algorithm for Gibbs point processes, based on the partial rejection sampling of Guo et al. (2017). Our particular focus is on pairwise interaction processes, penetrable spheres mixture models and area-interaction processes, with a finite interaction range. For an interaction range 2r of the target process, the proposed algorithm can generate a perfect sample with O((1/r)) expected running time complexity, provided that the intensity of the points is not too high.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.