arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0909.5162math.PR
收藏

Ising模型的混合时间:所有图的一致下界

Mixing time for the Ising model: a uniform lower bound for all graphs

Jian Ding, Yuval Peres

摘要:

考虑一个由$n$顶点组成的图上的伊辛模型的Glauber动力学。Hayes和Sinclair表明,这种动力学的混合时间至少是$n\log n/f(Δ)$,其中$Δ$是最大程度,而$f(Δ) = Θ(Δ\log^2 Δ)$是最大程度。他们的结果适用于更一般的自旋系统,在一般情况下,他们表明对$Δ$的某种依赖是必要的。本文重点研究铁磁Ising模型,证明了Glauber动力学在任意$n$ -顶点图上的混合时间至少为$(1/4+o(1))n \log n$。

英文摘要:

Consider Glauber dynamics for the Ising model on a graph of $n$ vertices. Hayes and Sinclair showed that the mixing time for this dynamics is at least $n\log n/f(Δ)$, where $Δ$ is the maximum degree and $f(Δ) = Θ(Δ\log^2 Δ)$. Their result applies to more general spin systems, and in that generality, they showed that some dependence on $Δ$ is necessary. In this paper, we focus on the ferromagnetic Ising model and prove that the mixing time of Glauber dynamics on any $n$-vertex graph is at least $(1/4+o(1))n \log n$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑