In this paper we perform a spectral analysis for the kernel operator associated with the transition kernel for the Metropolis–Hastings algorithm that uses a fixed, location independent proposal distribution. Our main result is to establish the spectrum of the kernel operator T in the continuous case, thereby generalizing the results obtained by Liu in (Statist. Comput. 6, 113–119 1996) for the finite case.
Similar content being viewed by others
References
Gåsemyr, J. (2005). A theoretical analysis of the performance of the independent Metropolis–Hastings algorithm on continuous state spaces. (In progress).
Hauge, R. (2002). On convergence of independent Metropolis–Hastings. Norwegian Computing Center, P. O. Box 114 Blindern, N–0314 Oslo, Norway.
Holden, L., Hauge, R., and Holden, M. (2002). Adaptive independent Metropolis–Hastings. Norwegian Computing Center, P. O. Box 114 Blindern, N–0314 Oslo, Norway.
Hastings W.K. (1970). Monte Carlo sampling methods using Markov chains and their applications. Biometrica 57:97–109
Liu J.S. (1996). Metropolized independent sampling with comparison to rejection sampling and importance sampling. Statist. Comput. 6:113–119
Metropolis M., Rosenbluth A.W., Rosenbluth M.N., Teller A., and Teller E. (1953). Equation of state calculations by fast computing machines. J. Chem. Phys. 21:1087–1092
Smith R.L., and Tierney L. (1996). Exact transition probabilities for the independence Metropolis sampler. Technical report, Department of Statistics, University of North Carolina, Chapel Hill, N.C. 27599–3260, USA
Tierney L. (1994). Markov chains for exploring posterior distributions. Ann. Statistics 22:1701–1762
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gåsemyr, J. The Spectrum of the Independent Metropolis–Hastings Algorithm. J Theor Probab 19, 152–165 (2006). https://doi.org/10.1007/s10959-006-0009-2
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10959-006-0009-2