Sampling repulsive Gibbs point processes using random graphs
Open Access
- 11 October 2024
- journal article
- research article
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 34 (1) , 63-89
Abstract
We study computational aspects of repulsive Gibbs point processes, which are probabilistic models of interacting particles in a finite-volume region of space. We introduce an approach for reducing a Gibbs point process to the hard-core model, a well-studied discrete spin system. Given an instance of such a point process, our reduction generates a random graph drawn from a natural geometric model. We show that the partition function of a hard-core model on graphs generated by the geometric model concentrates around the partition function of the Gibbs point process. Our reduction allows us to use a broad range of algorithms developed for the hard-core model to sample from the Gibbs point process and approximate its partition function. This is, to the extent of our knowledge, the first approach that deals with pair potentials of unbounded range.Keywords
This publication has 31 references indexed in Scilit:
- Strong Spatial Mixing for Repulsive Point ProcessesJournal of Statistical Physics, 2022
- Perfect sampling from spatial mixingRandom Structures & Algorithms, 2022
- Algorithms for Hard-Constraint Point Processes via Discretization2022
- Spatial mixing and the connective constant: optimal boundsProbability Theory and Related Fields, 2016
- Explaining why simple liquids are quasi-universalNature Communications, 2014
- Modelling Spatial Point Patterns in R2006
- On the rate of convergence of spatial birth-and-death processesAnnals of the Institute of Statistical Mathematics, 1989
- The Yukawa potentialPhysica A: Statistical Mechanics and its Applications, 1989
- Gaussian Model Potentials for Molecular InteractionsThe Journal of Chemical Physics, 1972
- Equation of State Calculations by Fast Computing MachinesThe Journal of Chemical Physics, 1953