Small and pseudo-small sets for Markov chains

Communications in Statistics. Part C: Stochastic Models

Volumn 17, Issue 2, 2001, Pages 121-145

  Roberts, Gareth O ^a   Rosenthal, Jeffrey S ^b  

^a LANCASTER UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Convergence rates; Coupling; Minorisation condition; Small set; Total variation distance

Indexed keywords

EID: 0000166052     PISSN: 08820287     EISSN: None     Source Type: Journal    
DOI: 10.1081/stm-100002060     Document Type: Article

References (36)

1. Aldous, D.J.; Thorisson, H. (1993), Shift-coupling. Stoch. Proc. Appl. 44, 1-14.
2. Asmussen, S. (1987), Applied Probability and Queues. John Wiley & Sons, New York.
3. Athreya, K.B.; Ney, P. (1978), A new approach to the limit theory of recurrent Markov chains. Trans. Amer. Math. Soc. 245, 493-501.
4. Bickel, P. (1999), Personal communication.
5. Cowles, M.K.; Rosenthal, J.S. (1998), A simulation approach to convergence rates for Markov chain Monte Carlo algorithms. Stat. and Computing 8, 115-124.
6. Diaconis, P. (1988), Group Representations in Probability and Statistics. IMS Lecture Series volume 11, Institute of Mathematical Statistics, Hay ward, California.
7. Dobrushin, R.L. (1956), Central limit theorem for nonstationary Markov chains. Th. Prob. Appl. 1, 65-80 and 329-383.
8. Fill, J.A. (1998), An interruptible algorithm for perfect sampling via Markov chains. Ann. Appl. Prob. 8, 131-162.
9. Fill, J.A.; Machida, M. ( 1999), Stochastic Monotonicity and Realizable Monotonicity. Preprint.
10. Fill, J.A.; Machida, M.; Murdoch, D.J.; Rosenthal, J.S. (1999), Extension of Fill's perfect rejection sampling algorithm to general chains. Random Structures and Algorithms, 17, 290-316.
11. Gilks, W.R.; Richardson, S.; Spiegelhalter, D.J., ed. (1996), Markov chain Monte Carlo in practice. Chapman and Hall, London.
12. Jain, N.; Jamison, B., (1967), Contributions to Doeblin's theory of Markov processes. Z. Wahrsch. Verw. Geb. 8, 19-40.
13. Kamae, T.; Krengel, U.; O'Brien, G.L., (1977), Stochastic inequalities on partially ordered spaces. Ann. Prob. 5, 899-912.
14. Lindvall, T.(1992), Lectures on the Coupling Method. Wiley & Sons, New York.
15. Lund, R.B.; Tweedie, R.L. (1996), Geometric convergence rates of stochastically ordered Markov chains. Math. Oper. Research 21, 182-194.
16. Lund, R.B.; Meyn, S.P.; Tweedie, R.L. (1996), Computable exponential convergence rates for stochastically ordered Markov processes. Ann. Appl. Prob. 6, 218-237.
17. Meyn, S.P.; Tweedie, R.L. (1993), Markov chains and stochastic stability. Springer-Verlag, London.
18. Murdoch, D.J.; Green, P. (1998), Exact Sampling from a Continuous State Space. Scandinavian J. Stat. 25, 483-502.
19. Mykland, P.A.; Tierney, L.; Yu, B. (1995), Regeneration in Markov chain samplers. J. Amer. Stat. Assoc. 90, 233-241.
20. Nummelin, E. (1978), Uniform and ratio limit theorems for Markov renewal and semi-regenerative processes on a general state space. Ann. Inst. Henri Poincaré Series B 14, 119-143.
21. Nummelin, E. (1984), General irreducible Markov chains and non-negative operators. Cambridge University Press.
22. Orey, S. (1971), Lecture notes on limit theorems for Markov chain transition probabilities. Van Nostrand Reinhold, London.
23. Propp, J.G.; Wilson, D.B. (1996). Exact sampling with coupled Markov chains and applications to statistical mechanics. Random Structures and Algorithms 9, 223-252.
24. Roberts, G.O.; Rosenthal, J.S. (1996), Quantitative bounds for convergence rates of continuous time Markov processes. Electronic J. Prob, 1, Paper no. 9, 1-21.
25. Roberts, G.O.; Rosenthal, J.S. (1997), Shift-coupling and convergence rates of ergodic averages. Comm. in Stat. - Stochastic Models 13, 147-165.
26. Roberts, G.O.; Rosenthal, J.S. (1998), Markov chain Monte Carlo: Some practical implications of theoretical results (with discussion). Canadian J. Stat. 26, 5-31.
27. Roberts, G.O. and Tweedie, R.L. (1999), Bounds on regeneration times and convergence rates for Markov chains. Stoch. Proc. Appl. 80, 211-229.
28. Roberts, G.O.; Tweedie, R.L. (2000), Rates of convergence for stochastically monotone and continuous time Markov models. J. Appl. Prob. 37, 359-373.
29. Rosenthal, J.S. (1993), Rates of Convergence for Data Augmentation on Finite Sample Spaces. Ann. Appl. Prob. 3, 819-839.
30. Rosenthal, J.S. (1995a), Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo. J. Amer. Stat. Assoc. 90 (1995), 558-566.
31. Rosenthal, J.S. (1995b), Convergence rates of Markov chains. SIAM Review 37, 387-405.
32. Rosenthal, J.S. (1997), Faithful couplings of Markov chains: now equals forever. Adv. Appl. Math. 18, 372-381.
33. Sloane, N.J.A. (2000), The On-Line Encyclopedia of Integer Sequences. Published electronically at http://www.research.att.com/∼njas/sequences/.
34. Smith, A.F.M.; Roberts, G.O. (1993), Bayesian computation via the Gibbs sampler and related Markov chain Monte Carlo methods (with discussion). J. Roy. Stat. Soc. Ser. B 55, 3-24.
35. Su, F.E. (1998), Convergence of random walks on the circle generated by an irrational rotation. Trans. Amer. Math. Soc. 350, 3717-3741.
36. Tierney, L. (1994), Markov chains for exploring posterior distributions (with discussion). Ann. Stat. 22, 1701-1762.