arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1212.4512math.PR
收藏

肇事逃逸和相关算法的积极性

Positivity of hit-and-run and related algorithms

Daniel Rudolf, Mario Ullrich

摘要:

我们证明了对应于打了就跑算法,随机扫描吉布斯采样器,切片采样器和一个积极的建议大都会算法的马尔可夫算子的积极性。在所有这些情况下,正性与状态空间和稳态分布无关。特别是,结果表明,它是没有必要考虑这些马尔可夫链的懒惰版本。这个证明依赖于一个众所周知的引理,它将乘积M T M^* 的正性与T的正性联系起来,对于某些算子M和T。它仍然需要找到具有正算子T的马尔可夫算子的那种表示。

英文摘要:

We prove positivity of the Markov operators that correspond to the hit-and-run algorithm, random scan Gibbs sampler, slice sampler and an Metropolis algorithm with positive proposal. In all of these cases the positivity is independent of the state space and the stationary distribution. In particular, the results show that it is not necessary to consider the lazy versions of these Markov chains. The proof relies on a well known lemma which relates the positivity of the product M T M^*, for some operators M and T, to the positivity of T. It remains to find that kind of representation of the Markov operator with a positive operator T.

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

↑