2000 character limit reached
Perfect Sampling in Infinite Spin Systems via Strong Spatial Mixing
Published 30 Jun 2021 in cs.DS, cs.DM, and math.PR | (2106.15992v1)
Abstract: We present a simple algorithm that perfectly samples configurations from the unique Gibbs measure of a spin system on a potentially infinite graph $G$. The sampling algorithm assumes strong spatial mixing together with subexponential growth of $G$. It produces a finite window onto a perfect sample from the Gibbs distribution. The run-time is linear in the size of the window.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.