Applications of geometric bounds to the convergence rate of Markov chains on n

Stochastic Processes and their Applications

Volumn 87, Issue 1, 2000, Pages 1-23

  Yuen, Wai Kong ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012864525     PISSN: 03044149     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0304-4149(99)00101-5     Document Type: Article

References (33)

1. Amit Y. On the rates of convergence of stochastic relaxation for Gaussian and non-Gaussian distributions. J. Multivariate Anal. 38:1991;89-99.
2. Amit Y., Grenander U. Comparing sweep strategies for stochastic relaxation. J. Multivariate Anal. 37(2):1991;197-222.
3. Bañuelos R., Carroll T. Brownian motion and the fundamental frequency of a drum. Duke Math. J. 75:1994;575-602.
4. Baxter J.R., Rosenthal J.S. Rates of convergence for everywhere-positive Markov chains. Statist. Probab. Lett. 22:1995;333-338.
5. Belsley, E.D., 1993. Rates of convergence of Markov chains related to association schemes. Ph.D. Dissertation, Department of Mathematics, Harvard University.
6. Conway, J.B., 1985. A Course in Functional Analysis. Springer, New York.
7. Diaconis, P., 1988. Group Representations in Probability and Statistics, IMS Lecture Series 11. Institute of Mathematical Statistics, Hayward, CA.
8. Diaconis P., Saloff-Coste L. Comparison theorems for reversible Markov chains. Ann. Appl. Probab. 3:1993;696-730.
9. Diaconis P., Stroock D. Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Probab. 1:1991;36-61.
10. Frieze A., Kannan R., Polson N.G. Sampling from log-concave distributions. Ann. Appl. Probab. 4:1994;812-837.
11. Frigessi A., Hwang C.-R., Sheu S.J., Di Stefano P. Convergence rates of the Gibbs sampler, the metropolis algorithm, and other single-site updating dynamics. J. Roy. Statist. Soc. Ser. B. 55:1993;205-220.
12. Gelfand A.E., Smith A.F.M. Sampling based approaches to calculating marginal densities. J. Amer. Statist. Assoc. 85:1990;398-409.
13. Hanlon P. A Markov chain on the symmetric group and Jack symmetric functions. Discrete Math. 99:1992;123-140.
14. Hwang C.-R., Hwang-Ma S.-Y., Sheu S.-J. Accelerating Gaussian diffusions. Ann. Appl. Probab. 3:1993;897-913.
15. Ingrassia S. On the rate of convergence of the metropolis algorithm and Gibbs sampler by geometric bounds. Ann. Appl. Probab. 2:1994;347-389.
16. Jerrum M., Sinclair A. Approximating the permanent. SIAM J. Comput. 18:1988;1149-1178.
17. Kreyszig, E., 1978. Introductory Functional Analysis with Applications. Wiley, Toronto.
18. 2 spectrum for Markov chains and Markov processes: a generalization of Cheeger's inequality Trans. Amer. Math. Soc. 309:1988;557-580.
19. Meyn S.P., Tweedie R.L. Computable bounds for convergence rates of Markov chains. Ann. Appl. Prob. 4:1994;981-1011.
20. Mira, A., 1998. Ordering, slicing and splitting Monte Carlo Markov chains. Ph.D. Dissertation, School of Statistics, University of Minnesota.
21. Quastel J. Diffusion of colour in the simple exclusion process. Comm. Pure Appl. Math. 45:1992;623-679.
22. Reed, M., Simon, B., 1978. Methods of Mathematical Physics IV. Academic Press, New York.
23. Roberts G.O., Rosenthal J.S. Shift-coupling and convergence rates of ergodic averages. Comm. Statist. - Stochastic Models. 13(1):1997;147-165.
24. Roberts G.O., Rosenthal J.S. Geometric ergodicity and hybrid Markov chains. Electron. Comm. Probab. 2:1997;13-25.
25. Rosenthal J.S. Rates of convergence for Gibbs sampler for variance components models. Ann. Statist. 23:1995;740-761.
26. Rosenthal J.S. Minorization conditions and convergence rates for Markov chain Monte Carlo. J. Amer. Statist. Assoc. 90:1995;558-566.
27. Rosenthal J.S. Analysis of Gibbs samples for a model related to James-Stein estimators. Statist. Comput. 6:1996;269-275.
28. Rosenthal J.S. Markov chain convergence: from finite to infinite. Stochastic Process. Appl. 62:1996;55-72.
29. Rudin, W., 1991. Functional Analysis, 2nd Edition. McGraw-Hill, New York.
30. Sinclair A. Improved bounds for mixing rates of Markov chains and multicomodity flow. Combin. Probab. Comput. 1:1992;351-370.
31. Sinclair A., Jerrum M. Approximate counting, uniform generation and rapidly mixing Markov chains. Inform. Comput. 82:1989;93-133.
32. Smith A.F.M., Roberts G.O. Bayesian computation via the Gibbs sampler and related Markov chain Monte Carlo methods (with discussion). J. Roy. Statist. Soc. Ser. B. 55:1993;3-24.
33. Tierney L. Markov chains for exploring posterior distributions. Ann. Statist. 22:1994;1701-1762.