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...
| প্রধান লেখক: | , , , |
|---|---|
| বিন্যাস: | Journal article |
| ভাষা: | English |
| প্রকাশিত: |
Association for Computing Machinery
2024
|