Geometric ergodicity and perfect simulation

DOI10.1214/ECP.v9-1117zbMath1061.60070arXivmath/0410012OpenAlexW2103900361MaRDI QIDQ1768228

Wilfrid S. Kendall

Publication date: 14 March 2005

Published in: Electronic Communications in Probability (Search for Journal in Brave)

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

zbMATH Keywords

dominated coupling from the past algorithmsFoster-Lyapunov criteriageometrically ergodic chains

Mathematics Subject Classification ID

Discrete-time Markov processes on general state spaces (60J05)

Related Items

Using the \(M/G/1\) queue under processor sharing for exact simulation of queues ⋮ Steady-state simulation of reflected Brownian motion and related stochastic networks ⋮ Comment: ``Gibbs sampling, exponential families, and orthogonal polynomials ⋮ Power diagrams and interaction processes for unions of discs ⋮ The mathematics of mixing things up ⋮ Perfect simulation for a class of positive recurrent Markov chains ⋮ Perfect simulation of M/G/c queues ⋮ Doeblin trees ⋮ The Markov chain Monte Carlo revolution ⋮ Perfect Sampling of Generalized Jackson Networks ⋮ Perfect sampling of GI/GI/\(c\) queues ⋮ Exact and Computationally Efficient Likelihood-Based Estimation for Discretely Observed Diffusion Processes (with Discussion) ⋮ Exact estimation for Markov chain equilibrium expectations