arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1606.08160stat.CO
收藏

Markov跳过程和CTBN的Rao和Teh算法的几何遍历性

Geometric ergodicity of Rao and Teh's algorithm for Markov jump processes and CTBNs

Błażej Miasojedow, Wojcieh Niemiro

摘要:

Rao和Teh(2012,2013)介绍了一种有效的MCMC算法,用于从隐马尔可夫跳跃过程的后验分布中进行采样。该算法基于虚拟跳跃采样的思想。本文证明了由Rao和Teh算法生成的马尔可夫链是几何遍历的。为此,我们建立了一个几何漂移的条件向一个小的集合。一个类似的结果也证明了一个特殊版本的算法,用于连续时间贝叶斯网络的概率推理。

英文摘要:

Rao and Teh (2012, 2013) introduced an efficient MCMC algorithm for sampling from the posterior distribution of a hidden Markov jump process. The algorithm is based on the idea of sampling virtual jumps. In the present paper we show that the Markov chain generated by Rao and Teh's algorithm is geometrically ergodic. To this end we establish a geometric drift condition towards a small set. A similar result is also proved for a special version of the algorithm, used for probabilistic inference in Continuous Time Bayesian Networks.

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

↑