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...
主要な著者: | Bezakova, I, Galanis, A, Goldberg, L, Stefankovic, D |
---|---|
フォーマット: | Conference item |
言語: | English |
出版事項: |
Leibniz International Proceedings in Informatics
2022
|
類似資料
-
Fast sampling via spectral independence beyond bounded-degree graphs
著者:: Bezáková, I, 等
出版事項: (2024) -
Inapproximability of the independent set polynomial in the complex plane
著者:: Bezakova, I, 等
出版事項: (2018) -
Inapproximability of the independent set polynomial in the complex plane
著者:: Bezáková, I, 等
出版事項: (2020) -
Fast mixing via polymers for random graphs with unbounded degree
著者:: Galanis, A, 等
出版事項: (2022) -
Fast mixing via polymers for random graphs with unbounded degree
著者:: Galanis, A, 等
出版事項: (2021)