This paper generalizes the work of Kendall [Electron. Comm. Probab. 9 (2004) 140–151], which showed that perfect simulation, in the form of dominated coupling from the past, is always possible (although not necessarily practical) for geometrically ergodic Markov chains. Here, we consider the more general situation of positive recurrent chains and explore when it is possible to produce such a simulation algorithm for these chains. We introduce a class of chains which we name tame, for which we show that perfect simulation is possible.
"Perfect simulation for a class of positive recurrent Markov chains." Ann. Appl. Probab. 17 (3) 781 - 808, June 2007. https://doi.org/10.1214/105051607000000032