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,...
Main Author: | Herrera Poyatos, A |
---|---|
Other Authors: | Goldberg, L |
Format: | Thesis |
Language: | English |
Published: |
2023
|
Subjects: |
Similar Items
-
On the complexity of counting homomorphisms under surjectivity constraints
by: Focke, J
Published: (2020) -
The complexity of approximately counting retractions to square-free graphs
by: Focke, J, et al.
Published: (2021) -
The complexity of approximating the complex-valued Potts model
by: Galanis, A, et al.
Published: (2022) -
Approximate cycles count in undirected graphs
by: Maytham Safar, et al.
Published: (2014-04-01) -
Approximate Synchronization of Complex Network Consisting of Nodes With Minimum-Phase Zero Dynamics and Uncertainties
by: Branislav Rehak, et al.
Published: (2022-01-01)