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 |
פורמט: | Thesis |
שפה: | 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, et al.
יצא לאור: (2021) -
The complexity of approximating the complex-valued Potts model
מאת: Galanis, A, et al.
יצא לאור: (2022) -
Approximate cycles count in undirected graphs
מאת: Maytham Safar, et al.
יצא לאור: (2014-04-01) -
Approximate Synchronization of Complex Network Consisting of Nodes With Minimum-Phase Zero Dynamics and Uncertainties
מאת: Branislav Rehak, et al.
יצא לאור: (2022-01-01)