Algorithms for general hard-constraint point processes via discretization

07/19/2021
βˆ™
by   Tobias Friedrich, et al.
βˆ™
0
βˆ™

We study a general model for continuous spin systems with hard-core interactions. Our model allows for a mixture of q types of particles on a d-dimensional Euclidean region 𝕍 of volume Ξ½(𝕍). For each type, particle positions are distributed according to a Poisson point process. The Gibbs distribution over possible system states is given by the mixture of these point processes conditioned that no two particles are closer than some distance parameterized by a q Γ— q matrix. This model encompasses classical continuous spin systems, such as the hard-sphere model or the Widom-Rowlinson model. We present sufficient conditions for approximating the partition function of this model, which is the normalizing factor of its Gibbs measure. For the hard-sphere model, our method yields a randomized approximation algorithm with running time polynomial in Ξ½(𝕍) for the known uniqueness regime of the Gibbs measure. In the same parameter regime, we obtain a quasi-polynomial deterministic approximation, which, to our knowledge, is the first rigorous deterministic algorithm for a continuous spin system. We obtain similar approximation results for all continuous spin systems captured by our model and, in particular, the first explicit approximation bounds for the Widom-Rowlinson model. Additionally, we show how to obtain efficient approximate samplers for the Gibbs distributions of the respective spin systems within the same parameter regimes. Key to our method is reducing the continuous model to a discrete instance of the hard-core model with size polynomial in Ξ½(𝕍). This generalizes existing discretization schemes for the hard-sphere model and, additionally, improves the required number of vertices of the generated graph from super-exponential to quadratic in Ξ½(𝕍), which we argue to be tight.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
βˆ™ 04/04/2022

Using random graphs to sample repulsive Gibbs point processes with arbitrary-range potentials

We study computational aspects of Gibbs point processes that are defined...
research
βˆ™ 09/21/2022

Quasipolynomial-time algorithms for repulsive Gibbs point processes

We demonstrate a quasipolynomial-time deterministic approximation algori...
research
βˆ™ 10/20/2018

A Polynomial Time MCMC Method for Sampling from Continuous DPPs

We study the Gibbs sampling algorithm for continuous determinantal point...
research
βˆ™ 04/20/2020

The complexity of approximating averages on bounded-degree graphs

We prove that, unless P=NP, there is no polynomial-time algorithm to app...
research
βˆ™ 11/11/2020

Uniqueness of the Gibbs measure for the 4-state anti-ferromagnetic Potts model on the regular tree

We show that the 4-state anti-ferromagnetic Potts model with interaction...
research
βˆ™ 02/13/2023

On the Mixing Time of Glauber Dynamics for the Hard-core and Related Models on G(n,d/n)

We study the single-site Glauber dynamics for the fugacity Ξ», Hard-core ...

Please sign up or login with your details

Forgot password? Click here to reset