Approximate counting via complex zero-free regions and spectral independence
<p>This thesis investigates fundamental problems in approximate counting that arise in the field of statistical mechanics. Building upon recent advancements in the area, our research aims to enhance our understanding of the computational complexity of sampling from the Ising and Potts models,...
第一著者: | Herrera Poyatos, A |
---|---|
その他の著者: | Goldberg, L |
フォーマット: | 学位論文 |
言語: | English |
出版事項: |
2023
|
主題: |
類似資料
-
On the complexity of counting homomorphisms under surjectivity constraints
著者:: Focke, J
出版事項: (2020) -
The complexity of approximately counting retractions to square-free graphs
著者:: Focke, J, 等
出版事項: (2021) -
The complexity of approximating the complex-valued Potts model
著者:: Galanis, A, 等
出版事項: (2022) -
Approximate cycles count in undirected graphs
著者:: Maytham Safar, 等
出版事項: (2014-04-01) -
Approximate Synchronization of Complex Network Consisting of Nodes With Minimum-Phase Zero Dynamics and Uncertainties
著者:: Branislav Rehak, 等
出版事項: (2022-01-01)