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)