BibTeX
CSL-JSON
MLA
Harvard
Uniform Sampling through the Lovász Local Lemma
release_6qv224f7tjcxfc7rlktfchpbwe
by
Heng Guo, Mark Jerrum, Jingcheng Liu
Released
as a article
.
2016
Abstract
We propose a new algorithmic framework, called "partial rejection sampling",
to draw samples exactly from a product distribution, conditioned on none of a
number of bad events occurring. Our framework builds (perhaps surprising) new
connections between the variable framework of the Lov\'asz Local Lemma and some
classical sampling algorithms such as the "cycle-popping" algorithm for rooted
spanning trees. Among other applications, we discover new algorithms to sample
satisfying assignments of k-CNF formulas with bounded variable occurrences.
In text/plain
format
Archived Files and Locations
application/pdf 381.1 kB
file_g2yfvbj355flzfex3htqvgn24e
|
arxiv.org (repository) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
arXiv
1611.01647v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links