Quasipolynomial-time algorithms for Gibbs point processes

MaRDI QIDQ6411496zbMATH OpenFDO

Authors Matthew Jenssen, Marcus Michelen, Mohan Ravichandran

Publication date 21 September 2022

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 $lambda$ for which the partition function satisfies a zero-free assumption in a neighborhood of the interval $[0,lambda]$. As a corollary, for all finite-range stable potentials we obtain a quasipolynomial-time determinsitic algorithm for all $lambda</(e^{B+1}hat{C}_{p}hi)$ where $hat{C}_{p}hi$ is a temperedness parameter and $B$ is the stability constant of $phi$. 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 $e^2$ and obtain a quasipolynomial-time deterministic approximation algorithm for all $lambda<e/Delt{a}_{p}hi$, where $Delt{a}_{p}hi$ is the potential-weighted connective constant of the potential $phi$. 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.

This page was built for publication: Quasipolynomial-time algorithms for Gibbs point processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6411496)