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

近似马尔可夫链的耦合与解耦

Coupling and Decoupling to bound an approximating Markov Chain

James E. Johndrow, Jonathan C. Mattingly

摘要:

这个简单的笔记列出了一些在许多方面众所周知的观察结果,但以前可能没有以这种方式说过。其基本思想是,当比较两个不同的马尔可夫链时,将它们耦合是有用的,这是一种尽可能经常一致的方式。我们构建这样一个耦合,并通过一个简单的控制链,注册,如果两个进程同意或不同意,分析它。我们发现,在思考这些问题时,这种意象是有用的。我们特别感兴趣的是比较过程的不变测度和长时间平均值。然而,由于路径在长时间运行时一致,它还提供了对各种停时的估计,例如命中或退出时间。我们还证明了某些界限是紧的。最后,我们提供了一个简单的应用程序的马尔可夫链蒙特卡罗算法,并显示数值的结果,本文显示了良好的近似水平,在相当大的速度,通过使用一个近似链,而不是原来的采样链。

英文摘要:

This simple note lays out a few observations which are well known in many ways but may not have been said in quite this way before. The basic idea is that when comparing two different Markov chains it is useful to couple them is such a way that they agree as often as possible. We construct such a coupling and analyze it by a simple dominating chain which registers if the two processes agree or disagree. We find that this imagery is useful when thinking about such problems. We are particularly interested in comparing the invariant measures and long time averages of the processes. However, since the paths agree for long runs, it also provides estimates on various stopping times such as hitting or exit times. We also show that certain bounds are tight. Finally, we provide a simple application to a Markov Chain Monte Carlo algorithm and show numerically that the results of the paper show a good level of approximation at considerable speed up by using an approximating chain rather than the original sampling chain.

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

↑