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,...
Glavni avtor: | Herrera Poyatos, A |
---|---|
Drugi avtorji: | Goldberg, L |
Format: | Thesis |
Jezik: | English |
Izdano: |
2023
|
Teme: |
Podobne knjige/članki
-
On the complexity of counting homomorphisms under surjectivity constraints
od: Focke, J
Izdano: (2020) -
The complexity of approximately counting retractions to square-free graphs
od: Focke, J, et al.
Izdano: (2021) -
The complexity of approximating the complex-valued Potts model
od: Galanis, A, et al.
Izdano: (2022) -
Approximate cycles count in undirected graphs
od: Maytham Safar, et al.
Izdano: (2014-04-01) -
Approximate Synchronization of Complex Network Consisting of Nodes With Minimum-Phase Zero Dynamics and Uncertainties
od: Branislav Rehak, et al.
Izdano: (2022-01-01)