arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.13255math.PRmath.SP
收藏

Metropolis算法的多维示例

Multidimensional examples of the Metropolis algorithm

Laurent Saloff-Coste, Sophie Uluatam

摘要:

考虑通过使用网格大小为$1/N$的正方形网格离散化和Metropolis算法来近似立方体$[0,1]^n$上的给定概率分布的问题。在这里,维度$n$是固定的,我们主要关注$n=2$的情况。为了理解这样一个过程的收敛速度,需要控制相关有限马尔可夫链的谱间隙$λ$,以及它如何依赖于参数$N$。在这项工作中,我们研究的基本例子,良好的上界和下界$λ$可以通过适当的应用路径技术。

英文摘要:

Consider the problem of approximating a given probability distribution on the cube $[0,1]^n$ via the use of a square lattice discretization with mesh-size $1/N$ and the Metropolis algorithm. Here the dimension $n$ is fixed and we focus for the most part on the case $n=2$. In order to understand the speed of convergence of such a procedure, one needs to control the spectral gap, $λ$, of the associated finite Markov chain, and how it depends on the parameter $N$. In this work, we study basic examples for which good upper-bounds and lower-bounds on $λ$ can be obtained via appropriate application of path techniques.

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

↑