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

DOI10.1214/17-EJS1348MaRDI QIDQ1684152zbMATH OpenOpenAlexWikidataFDO

Authors Błażej Miasojedow, Wojciech Niemiro

Publication date 8 December 2017

Published in Electronic Journal of Statistics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1606.08160, https://projecteuclid.org/euclid.ejs/1510974128

zbMATH Keywords

MCMChidden Markov modelsdrift conditiongeometric ergodicityposterior samplingcontinuous time Markov processessmall setcontinuous-time Bayesian network (CTBN)

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40) Continuous-time Markov processes on discrete state spaces (60J27)

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.

Recommendations

• Geometric ergodicity of Rao and Teh's algorithm for homogeneous Markov jump processes
• Convergence rates in geometric ergodicity for discrete-time Markov chains
• scientific article; zbMATH DE number 1531952
• Renewal theory and computable convergence rates for geometrically erdgodic Markov chains
• On geometric ergodicity of the MTAR process
• Geometric approximations to transition densities of jump-type Markov processes
• Extremal indices, geometric ergodicity of Markov chains and MCMC
• Approximations of geometrically ergodic reversible Markov chains

Cited in

(3)

• Geometric ergodicity of Rao and Teh's algorithm for homogeneous Markov jump processes
• Structure learning for continuous time Bayesian networks via penalized likelihood
• Efficient Parameter Sampling for Markov Jump Processes

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

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