arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0704.0906math.PRmath.STstat.COstat.TH
收藏

Metropolis算法与两个平均场自旋系统的等能采样

Metropolis algorithm and equienergy sampling for two mean field spin systems

Bassetti Federico, Leisen Fabrizio

摘要:

本文研究了Metropolis算法与两个平均场自旋系统,即所谓的平均场Ising模型和Blume-Emery-Griffiths模型的关系。在这两个例子中,对于某些参数,建议链的朴素选择产生了缓慢混合的Metropolis链,这是一个频谱间隙以指数方式快速减小的链(在问题的维度$N$中)。在这里,我们展示了如何在建议链中的轻微变化可以避免这个问题,保持平均计算成本类似于通常的大都市的成本。更精确地说,我们证明了,与一个合适的变种的建议,大都市链有一个频谱间隙,减少多项式在1/N。利用能量的某种对称结构,该方法依赖于允许起始态能级内的适当跳跃。

英文摘要:

In this paper we study the Metropolis algorithm in connection with two mean--field spin systems, the so called mean--field Ising model and the Blume--Emery--Griffiths model. In both this examples the naive choice of proposal chain gives rise, for some parameters, to a slowly mixing Metropolis chain, that is a chain whose spectral gap decreases exponentially fast (in the dimension $N$ of the problem). Here we show how a slight variant in the proposal chain can avoid this problem, keeping the mean computational cost similar to the cost of the usual Metropolis. More precisely we prove that, with a suitable variant in the proposal, the Metropolis chain has a spectral gap which decreases polynomially in 1/N. Using some symmetry structure of the energy, the method rests on allowing appropriate jumps within the energy level of the starting state.

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

↑