Translator Disclaimer
2017 Geometric ergodicity of Rao and Teh’s algorithm for Markov jump processes and CTBNs
Błażej Miasojedow, Wojciech Niemiro
Electron. J. Statist. 11(2): 4629-4648 (2017). DOI: 10.1214/17-EJS1348

Abstract

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.

Citation

Download Citation

Błażej Miasojedow. Wojciech Niemiro. "Geometric ergodicity of Rao and Teh’s algorithm for Markov jump processes and CTBNs." Electron. J. Statist. 11 (2) 4629 - 4648, 2017. https://doi.org/10.1214/17-EJS1348

Information

Received: 1 November 2016; Published: 2017
First available in Project Euclid: 18 November 2017

zbMATH: 06816627
MathSciNet: MR3724970
Digital Object Identifier: 10.1214/17-EJS1348

Subjects:
Primary: 65C40
Secondary: 60J27, 65C05

JOURNAL ARTICLE
20 PAGES


SHARE
Vol.11 • No. 2 • 2017
Back to Top