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,...
Hlavní autor: | Herrera Poyatos, A |
---|---|
Další autoři: | Goldberg, L |
Médium: | Diplomová práce |
Jazyk: | English |
Vydáno: |
2023
|
Témata: |
Podobné jednotky
-
On the complexity of counting homomorphisms under surjectivity constraints
Autor: Focke, J
Vydáno: (2020) -
The complexity of approximately counting retractions to square-free graphs
Autor: Focke, J, a další
Vydáno: (2021) -
The complexity of approximating the complex-valued Potts model
Autor: Galanis, A, a další
Vydáno: (2022) -
Approximate cycles count in undirected graphs
Autor: Maytham Safar, a další
Vydáno: (2014-04-01) -
Approximate Synchronization of Complex Network Consisting of Nodes With Minimum-Phase Zero Dynamics and Uncertainties
Autor: Branislav Rehak, a další
Vydáno: (2022-01-01)