Metropolis算法在无序树上的性能:爱因斯坦关系
Performance of the Metropolis algorithm on a disordered tree: The Einstein relation
摘要:
考虑$d$ -元根树($d\geq3$),其中每个边$e$被分配i.i.d.负均值的(有界)随机变量$X(e)$。将连接$v$到根的所有边上的$X(e)$的和$S(v)$分配给每个顶点$v$,并且假设在距离根$n$的距离处的所有顶点$v$上的$S(v)$的最大值$S_n^*$随着$n$趋于无穷大而趋于无穷大(必然地,线性地)。我们分析了Metropolis算法的树,并表明,在这些假设下,总是存在一个温度$1/β$的算法,使其实现线性(正)增长率在线性时间。这证实了Aldous的一个猜想[Anglomica 22(1998)388-412]。证明是通过建立一个爱因斯坦关系的Metropolis算法上的树。
英文摘要:
Consider a $d$-ary rooted tree ($d\geq3$) where each edge $e$ is assigned an i.i.d. (bounded) random variable $X(e)$ of negative mean. Assign to each vertex $v$ the sum $S(v)$ of $X(e)$ over all edges connecting $v$ to the root, and assume that the maximum $S_n^*$ of $S(v)$ over all vertices $v$ at distance $n$ from the root tends to infinity (necessarily, linearly) as $n$ tends to infinity. We analyze the Metropolis algorithm on the tree and show that under these assumptions there always exists a temperature $1/β$ of the algorithm so that it achieves a linear (positive) growth rate in linear time. This confirms a conjecture of Aldous [Algorithmica 22 (1998) 388-412]. The proof is obtained by establishing an Einstein relation for the Metropolis algorithm on the tree.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。