Perfect Sampling in Infinite Spin Systems via Strong Spatial Mixing
Data Structures and Algorithms
2021-07-01 v1 Discrete Mathematics
Probability
Abstract
We present a simple algorithm that perfectly samples configurations from the unique Gibbs measure of a spin system on a potentially infinite graph . The sampling algorithm assumes strong spatial mixing together with subexponential growth of . It produces a finite window onto a perfect sample from the Gibbs distribution. The run-time is linear in the size of the window.
Keywords
Cite
@article{arxiv.2106.15992,
title = {Perfect Sampling in Infinite Spin Systems via Strong Spatial Mixing},
author = {Konrad Anand and Mark Jerrum},
journal= {arXiv preprint arXiv:2106.15992},
year = {2021}
}