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,...
Autor Principal: | Herrera Poyatos, A |
---|---|
Outros autores: | Goldberg, L |
Formato: | Thesis |
Idioma: | English |
Publicado: |
2023
|
Subjects: |
Títulos similares
-
On the complexity of counting homomorphisms under surjectivity constraints
por: Focke, J
Publicado: (2020) -
The complexity of approximately counting retractions to square-free graphs
por: Focke, J, et al.
Publicado: (2021) -
The complexity of approximating the complex-valued Potts model
por: Galanis, A, et al.
Publicado: (2022) -
Approximate cycles count in undirected graphs
por: Maytham Safar, et al.
Publicado: (2014-04-01) -
Approximate Synchronization of Complex Network Consisting of Nodes With Minimum-Phase Zero Dynamics and Uncertainties
por: Branislav Rehak, et al.
Publicado: (2022-01-01)