License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2022.103
URN: urn:nbn:de:0030-drops-164442
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/16444/
Qiu, Guoliang ;
Wang, Yanheng ;
Zhang, Chihao
A Perfect Sampler for Hypergraph Independent Sets
Abstract
The problem of uniformly sampling hypergraph independent sets is revisited. We design an efficient perfect sampler for the problem under a similar condition of the asymmetric Lovász local lemma. When specialized to d-regular k-uniform hypergraphs on n vertices, our sampler terminates in expected O(n log n) time provided d ≤ c⋅ 2^{k/2} where c > 0 is a constant, matching the rapid mixing condition for Glauber dynamics in Hermon, Sly and Zhang [Hermon et al., 2019]. The analysis of our algorithm is simple and clean.
BibTeX - Entry
@InProceedings{qiu_et_al:LIPIcs.ICALP.2022.103,
author = {Qiu, Guoliang and Wang, Yanheng and Zhang, Chihao},
title = {{A Perfect Sampler for Hypergraph Independent Sets}},
booktitle = {49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)},
pages = {103:1--103:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-235-8},
ISSN = {1868-8969},
year = {2022},
volume = {229},
editor = {Boja\'{n}czyk, Miko{\l}aj and Merelli, Emanuela and Woodruff, David P.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/16444},
URN = {urn:nbn:de:0030-drops-164442},
doi = {10.4230/LIPIcs.ICALP.2022.103},
annote = {Keywords: Coupling from the past, Markov chains, Hypergraph independent sets}
}
|
Keywords: |
|
Coupling from the past, Markov chains, Hypergraph independent sets |
|
Collection: |
|
49th International Colloquium on Automata, Languages, and Programming (ICALP 2022) |
|
Issue Date: |
|
2022 |
|
Date of publication: |
|
28.06.2022 |
