The Uniform Even Subgraph and Its Connection to Phase Transitions of Graphical Representations of the Ising Model

IF 2.2 1区 物理与天体物理 Q1 PHYSICS, MATHEMATICAL
Ulrik Thinggaard Hansen, Boris Kjær, Frederik Ravn Klausen
{"title":"The Uniform Even Subgraph and Its Connection to Phase Transitions of Graphical Representations of the Ising Model","authors":"Ulrik Thinggaard Hansen,&nbsp;Boris Kjær,&nbsp;Frederik Ravn Klausen","doi":"10.1007/s00220-025-05297-3","DOIUrl":null,"url":null,"abstract":"<div><p>The uniform even subgraph is intimately related to the Ising model, the random-cluster model, the random current model, and the loop <span>\\(\\textrm{O}\\)</span>(1) model. In this paper, we first prove that the uniform even subgraph of <span>\\(\\mathbb {Z}^d\\)</span> percolates for <span>\\(d \\ge 2\\)</span> using its characterisation as the Haar measure on the group of even graphs. We then tighten the result by showing that the loop <span>\\(\\textrm{O}\\)</span>(1) model on <span>\\(\\mathbb {Z}^d\\)</span> percolates for <span>\\(d \\ge 2\\)</span> for edge-weights <i>x</i> lying in some interval <span>\\((1-\\varepsilon ,1]\\)</span>. Finally, our main theorem is that the loop <span>\\(\\textrm{O}\\)</span>(1) model and random current models corresponding to a supercritical Ising model are always at least critical, in the sense that their two-point correlation functions decay at most polynomially and the expected cluster sizes are infinite.</p></div>","PeriodicalId":522,"journal":{"name":"Communications in Mathematical Physics","volume":"406 6","pages":""},"PeriodicalIF":2.2000,"publicationDate":"2025-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00220-025-05297-3.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Communications in Mathematical Physics","FirstCategoryId":"101","ListUrlMain":"https://link.springer.com/article/10.1007/s00220-025-05297-3","RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, MATHEMATICAL","Score":null,"Total":0}
引用次数: 0

Abstract

The uniform even subgraph is intimately related to the Ising model, the random-cluster model, the random current model, and the loop \(\textrm{O}\)(1) model. In this paper, we first prove that the uniform even subgraph of \(\mathbb {Z}^d\) percolates for \(d \ge 2\) using its characterisation as the Haar measure on the group of even graphs. We then tighten the result by showing that the loop \(\textrm{O}\)(1) model on \(\mathbb {Z}^d\) percolates for \(d \ge 2\) for edge-weights x lying in some interval \((1-\varepsilon ,1]\). Finally, our main theorem is that the loop \(\textrm{O}\)(1) model and random current models corresponding to a supercritical Ising model are always at least critical, in the sense that their two-point correlation functions decay at most polynomially and the expected cluster sizes are infinite.

Ising模型图形表示的一致偶子图及其与相变的联系
均匀偶子图与Ising模型、随机聚类模型、随机电流模型和循环\(\textrm{O}\)(1)模型密切相关。本文首先利用偶图群上的Haar测度证明了\(\mathbb {Z}^d\)的均匀偶子图对\(d \ge 2\)的渗滤性。然后,我们通过显示\(\mathbb {Z}^d\)上的循环\(\textrm{O}\)(1)模型对位于某个区间\((1-\varepsilon ,1]\)的边权x的\(d \ge 2\)进行渗透来收紧结果。最后,我们的主要定理是,循环\(\textrm{O}\)(1)模型和对应于超临界伊辛模型的随机电流模型总是至少是临界的,因为它们的两点相关函数最多以多项式方式衰减,并且期望的簇大小是无限的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Communications in Mathematical Physics
Communications in Mathematical Physics 物理-物理:数学物理
CiteScore
4.70
自引率
8.30%
发文量
226
审稿时长
3-6 weeks
期刊介绍: The mission of Communications in Mathematical Physics is to offer a high forum for works which are motivated by the vision and the challenges of modern physics and which at the same time meet the highest mathematical standards.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信