Hostname: page-component-586b7cd67f-r5fsc Total loading time: 0 Render date: 2024-12-01T01:19:16.909Z Has data issue: false hasContentIssue false
  • English
  • Français

Explicit bounds for geometric convergence of Markov chains

Part of: Distribution theory Markov processes

Published online by Cambridge University Press:  14 July 2016

John E. Kolassa
John E. Kolassa*
Affiliation:
University of Rochester Medical Center
*
∗Postal address: Department of Statistics, Rutgers University, 501 Hill Center, Bush Campus, Piscataway, NJ 08855 USA. Email address: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper presents bounds on convergence rates of Markov chains in terms of quantities calculable directly from chain transition operators. Bounds are constructed by creating a probability distribution that minorizes the transition kernel over some region, and by examining bounds on an expectation conditional on lying within and without this region. These are shown to be sharper in most cases than previous similar results. These bounds are applied to a Markov chain useful in frequentist conditional inference in canonical generalized linear models.

Keywords

Markov Chain Monte Carlogeometric convergence

MSC classification

Primary: 60J20: Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.)
Secondary: 62E20: Asymptotic distribution theory
Type
Research Papers
Information
Journal of Applied Probability , Volume 37 , Issue 3 , September 2000 , pp. 642 - 651
Copyright
Copyright © Applied Probability Trust 2000 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Foss, S. G., and Tweedie, R. L. (1998). Perfect simulation and backward coupling. Stoch. Models 14, 187–203.CrossRefGoogle Scholar
Hirji, K. F., Mehta, C. R., and Patel, N. R. (1987). Computing distributions for exact logistic regression. J. Amer. Statist. Assoc. 82, 1110–1117.CrossRefGoogle Scholar
Kolassa, J. E., and Tanner, M. A. (1994). Approximate conditional inference in exponential families via the Gibbs sampler. J. Amer. Statist. Assoc. 89, 697–702.Google Scholar
Kolassa, J. E. (1996). Convergence and accuracy of Gibbs sampling for conditional distributions in generalized linear models. University of Rochester Department of Biostatistics Tech. Rept 96–16.Google Scholar
Kolassa, J. E. (1998). Bounding convergence rates for Markov chains: an example of the use of computer algebra. To appear in Statist. Comput.Google Scholar
Kolassa, J. E. (1999). Convergence and accuracy of Gibbs sampling for conditional distributions in generalized linear models. Ann. Statist. 27, 129–142.Google Scholar
Meyn, S. P., and Tweedie, R. L. (1993). Markov Chains and Stochastic Stability. Springer, New York.CrossRefGoogle Scholar
Meyn, S. P., and Tweedie, R. L. (1994). Computable bounds for geometric convergence rates of Markov chains. Adv. Appl. Prob. 4, 981–1011.Google Scholar
Murdoch, D. J., and Green, P. J. (1998). Exact sampling from a continuous sample space. Scand. J. Statist. 25, 483–502.CrossRefGoogle Scholar
Nummelin, E. (1984). General Irreducible Markov Chains And Non-Negative Operators. Cambridge University Press.CrossRefGoogle Scholar
Rosenthal, J. S. (1995a). Rates of convergence for Gibbs sampling for variance components models. Ann. Statist. 23, 740–761.CrossRefGoogle Scholar
Rosenthal, J. S. (1995b). Minorization conditions and convergence rates for Markov chain Monte Carlo. J. Amer. Statist. Assoc. 90, 558–566.Google Scholar
Roberts, G.O., and Polson, N.G. (1994). On the geometric convergence of the Gibbs sampler. J. R. Statist. Soc. Ser. B 56, 377–384.Google Scholar
Roberts, G.O., and Tweedie, R.L. (1999). Bounds on regeneration times and convergence rates for Markov chains. Stoch. Proc. Appl. 80, 211–229.CrossRefGoogle Scholar
Rudin, W. 1976 Principals of Mathematical Analysis NewYork McGraw-Hill Google Scholar
Schervish, M. J., and Carlin, B. P. (1992). On the convergence of successive substitution sampling. J. Comput. Graph. Statist. 1, 111–127.Google Scholar
Tanner, M. A. (1996). Tools for Statistical Inference. Springer, Heidelberg.CrossRefGoogle Scholar
Tierney, L. (1994). Markov chains for exploring posterior distributions. Ann. Statist. 22, 1701–1762 Google Scholar