Perfect sampling from spatial mixing
Data Structures and Algorithms
2020-04-27 v2
Abstract
We introduce a new perfect sampling technique that can be applied to general Gibbs distributions and runs in linear time if the correlation decays faster than the neighborhood growth. In particular, in graphs with sub-exponential neighborhood growth like , our algorithm achieves linear running time as long as Gibbs sampling is rapidly mixing. As concrete applications, we obtain the currently best perfect samplers for colorings and for monomer-dimer models in such graphs.
Cite
@article{arxiv.1907.06033,
title = {Perfect sampling from spatial mixing},
author = {Weiming Feng and Heng Guo and Yitong Yin},
journal= {arXiv preprint arXiv:1907.06033},
year = {2020}
}