The complexity of approximating the complex-valued Ising model on bounded degree graphs
We study the complexity of approximating the partition function ZIsing(G;β) of the Ising model in terms of the relation between the edge interaction β and a parameter Δ which is an upper bound on the maximum degree of the input graph G. Following recent trends in both statistical physics and algorit...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Society for Industrial and Applied Mathematics
2022
|