Perfect Sampling in Infinite Spin Systems via Strong Spatial Mixing

DOI10.1137/21M1437433MaRDI QIDQ6371625arXivFDO

Authors Konrad Anand, Mark Jerrum

Publication date 30 June 2021

Published in arXiv

Full work available at URL https://doi.org/10.1137/21M1437433

Mathematics Subject Classification ID

Combinatorial probability (60C05) Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Randomized algorithms (68W20) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

arXiv classification

cs.DMcs.DSmath.PR

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.

This page was built for publication: Perfect Sampling in Infinite Spin Systems via Strong Spatial Mixing

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