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(nlog n) sampling algorithms on bounded-degree graphs for a large class of problems throughout the so-called uniquenes...
| Päätekijät: | , , , |
|---|---|
| Aineistotyyppi: | Journal article |
| Kieli: | English |
| Julkaistu: |
Association for Computing Machinery
2024
|