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...
| Hauptverfasser: | , , , |
|---|---|
| Format: | Conference item |
| Sprache: | English |
| Veröffentlicht: |
Leibniz International Proceedings in Informatics
2022
|