Quasipolynomial-time algorithms for Gibbs point processes
Abstract
We demonstrate a quasipolynomial-time deterministic approximation algorithm for the partition function of a Gibbs point process interacting via a finite-range stable potential. This result holds for all activities for which the partition function satisfies a zero-free assumption in a neighborhood of the interval . As a corollary, for all finite-range stable potentials we obtain a quasipolynomial-time determinsitic algorithm for all where is a temperedness parameter and is the stability constant of . In the special case of a repulsive potential such as the hard-sphere gas we improve the range of activity by a factor of at least and obtain a quasipolynomial-time deterministic approximation algorithm for all , where is the potential-weighted connective constant of the potential . Our algorithm approximates coefficients of the cluster expansion of the partition function and uses the interpolation method of Barvinok to extend this approximation throughout the zero-free region.
Keywords
Cite
@article{arxiv.2209.10453,
title = {Quasipolynomial-time algorithms for Gibbs point processes},
author = {Matthew Jenssen and Marcus Michelen and Mohan Ravichandran},
journal= {arXiv preprint arXiv:2209.10453},
year = {2023}
}
Comments
Results extended to include stable potentials