The antiferromagnetic Ising model beyond line graphs
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911450777255936 |
|---|---|
| author | Jerrum, Mark |
| author_facet | Jerrum, Mark |
| contents | Both the antiferromagnetic Ising model and the hard-core model could be said to be tractable on line graphs of bounded degree. For example, Glauber dynamics is rapidly mixing in both cases. In the case of the hard-core model, we know that tractability extends further, to claw-free graphs and somewhat beyond. In contrast, it is shown here that the corresponding extensions are not possible in the case of the antiferromagnetic Ising model. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_14915 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | The antiferromagnetic Ising model beyond line graphs Jerrum, Mark Computational Complexity Combinatorics Probability 68Q17 (Primary) 05C31 05C75 82B20 (Secondary) Both the antiferromagnetic Ising model and the hard-core model could be said to be tractable on line graphs of bounded degree. For example, Glauber dynamics is rapidly mixing in both cases. In the case of the hard-core model, we know that tractability extends further, to claw-free graphs and somewhat beyond. In contrast, it is shown here that the corresponding extensions are not possible in the case of the antiferromagnetic Ising model. |
| title | The antiferromagnetic Ising model beyond line graphs |
| topic | Computational Complexity Combinatorics Probability 68Q17 (Primary) 05C31 05C75 82B20 (Secondary) |
| url | https://arxiv.org/abs/2602.14915 |