2019
DOI: 10.1112/jlms.12286
|View full text |Cite
|
Sign up to set email alerts
|

Location of zeros for the partition function of the Ising model on bounded degree graphs

Abstract: The seminal Lee-Yang theorem states that for any graph the zeros of the partition function of the ferromagnetic Ising model lie on the unit circle in C. In fact the union of the zeros of all graphs is dense on the unit circle. In this paper we study the location of the zeros for the class of graphs of bounded maximum degree d ≥ 3, both in the ferromagnetic and the anti-ferromagnetic case. We determine the location exactly as a function of the inverse temperature and the degree d. An important step in our appro… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
62
1

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 32 publications
(65 citation statements)
references
References 37 publications
2
62
1
Order By: Relevance
“…For this to be done, we need an algorithm that given a local Hamiltonian H = O (n) ℓ=1 H ℓ , computes tr[H k ] in time O(n • 2 O (k ) ) instead of the current n O (k ) running time. This has been achieved for the classical Ising model [34,37] by relating the derivatives of the partition function to combinatorial objects that can be efficiently counted. Another approach for an improved running time is recently introduced in [29], where the authors apply a multivariate version of the cluster expansion that we use to compute the derivatives of log Z β (H ) efficiently.…”
Section: Discussion and Open Questionsmentioning
confidence: 99%
See 1 more Smart Citation
“…For this to be done, we need an algorithm that given a local Hamiltonian H = O (n) ℓ=1 H ℓ , computes tr[H k ] in time O(n • 2 O (k ) ) instead of the current n O (k ) running time. This has been achieved for the classical Ising model [34,37] by relating the derivatives of the partition function to combinatorial objects that can be efficiently counted. Another approach for an improved running time is recently introduced in [29], where the authors apply a multivariate version of the cluster expansion that we use to compute the derivatives of log Z β (H ) efficiently.…”
Section: Discussion and Open Questionsmentioning
confidence: 99%
“…Since its introduction [5], this method has been used to obtain deterministic algorithms for various interesting problems such as the ferromagnetic and antiferromagnetic Ising models [34,37] on bounded graphs.…”
Section: Previous Workmentioning
confidence: 99%
“…In this paper, we look at the computational complexity and complex zeros of the partition function in the Ising model. This is a classical and also currently very active area of research; see [6], [9], [10], [13], [16], [14], [15], [18], [19] and [22] for some recent results.…”
Section: Introduction and Main Resultsmentioning
confidence: 99%
“…We consider the partition function S as a function of a complex parameter . It is known that for a fixed Δ, as grows and ranges over all graphs with maximum degree Δ of a vertex, the zeros of the univariate function ↦ −→ S with either choice of can get arbitrarily close to = 0; see [2], [1], [18], [6]. We have…”
Section: The Bounds For the Zero-free Region Are Asymptotically Optimalmentioning
confidence: 99%
See 1 more Smart Citation