Fast sampling via spectral independence beyond bounded-degree graphs
Spectral independence is a recently-developed framework for obtaining sharp bounds on the convergence time of the classical Glauber dynamics. This new framework has yielded optimal O(n log n) sampling algorithms on bounded-degree graphs for a large class of problems throughout the so-called uniquene...
| 主要な著者: | , , , |
|---|---|
| フォーマット: | Conference item |
| 言語: | English |
| 出版事項: |
Leibniz International Proceedings in Informatics
2022
|