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

From MaRDI portal
Publication:274146

DOI10.1016/J.SPL.2016.02.002zbMATH Open1345.60079arXiv1512.00736OpenAlexW2281500142WikidataQ96748968 ScholiaQ96748968MaRDI QIDQ274146FDOQ274146


Authors: Błażej Miasojedow, Wojciech Niemiro Edit this on Wikidata


Publication date: 22 April 2016

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Abstract: Rao and Teh (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.


Full work available at URL: https://arxiv.org/abs/1512.00736




Recommendations




Cites Work


Cited In (1)





This page was built for publication: Geometric ergodicity of Rao and Teh's algorithm for homogeneous Markov jump processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q274146)