Uniform Sampling Through the Lovasz Local Lemma

被引：29

作者：

Guo, Heng ^{[1
]}

Jerrum, Mark ^{[2
]}

Liu, Jingcheng ^{[3
]}

机构：

[1] Univ Edinburgh, Sch Informat, Edinburgh EH8 9AB, Midlothian, Scotland

[2] Queen Mary Univ London, Sch Math Sci, London E1 4NS, England

[3] Univ Calif Berkeley, Dept EECS, Berkeley, CA 94720 USA

来源：

JOURNAL OF THE ACM | 2019年 / 66卷 / 03期

基金：

英国工程与自然科学研究理事会;

关键词：

Exact sampling; Lovasz Local Lemma; #SAT; ALGORITHMIC APPROACH;

D O I：

10.1145/3310131

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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 new connections between the variable framework of the Lovasz 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.

引用

页数：31

共 50 条

[21] Sampling Partial Acyclic Orientations in Chordal Graphs by the Lovasz Local Lemma (Student Abstract)
Sun, Wenbo
Bezakova, Ivona
THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 15901 - 15902
[22] Entropy compression versus Lovasz Local Lemma
Alves, Rogerio G.
Procacci, Aldo
Sanchis, Remy
ADVANCES IN APPLIED MATHEMATICS, 2021, 125
[23] New Constructive Aspects of the Lovasz Local Lemma
Haeupler, Bernhard
Saha, Barna
Srinivasan, Aravind
JOURNAL OF THE ACM, 2011, 58 (06)
[24] New Constructive Aspects of the Lovasz Local Lemma
Haeupler, Bernhard
Saha, Barna
Srinivasan, Aravind
2010 IEEE 51ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2010, : 397 - 406
[25] Improved Algorithmic Versions of the Lovasz Local Lemma
Srinivasan, Aravind
PROCEEDINGS OF THE NINETEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2008, : 611 - 620
[26] LOPSIDED LOVASZ LOCAL LEMMA AND LATIN TRANSVERSALS
ERDOS, P
SPENCER, J
DISCRETE APPLIED MATHEMATICS, 1991, 30 (2-3) : 151 - 154
[27] A Lower Bound for the Distributed Lovasz Local Lemma
Brandt, Sebastian
Fischer, Orr
Hirvonen, Juho
Keller, Barbara
Lempiainen, Tuomo
Rybicki, Joel
Suomela, Jukka
Uitto, Jara
STOC'16: PROCEEDINGS OF THE 48TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2016, : 479 - 488
[28] A Constructive Proof of the General Lovasz Local Lemma
Moser, Robin A.
Tardos, Gabor
JOURNAL OF THE ACM, 2010, 57 (02)
[29] Coloring non-uniform hypergraphs: A new algorithmic approach to the general Lovasz Local Lemma
Czumaj, A
Scheideler, C
PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 30 - 39
[30] Sampling Lovasz local lemma for general constraint satisfaction solutions in near-linear time
He, Kun
Wang, Chunyang
Yin, Yitong
2022 IEEE 63RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2022, : 147 - 158

← 1 2 3 4 5 →