10.1093/oso/9780198523567.003.0038
Crossref book-chapter
Oxford University PressOxford
Bayesian Statistics 5 (286)
Abstract

Abstract The algorithm of Metropolis et al. (1953) and its generalizations have been increasingly popular in computational physics and, more recently, statistics, for sampling from intractable multivariate distributions. Much recent research has been devoted to increasing the efficiency of simulation algorithms by altering the jumping rules for Metropolis-like algorithms. We study a very specific question: What are the most efficient symmetric jumping kernels for simulating a normal target distribution using the Metropolis algorithmã We provide a general theoretical result as the dimension of a class of canonical problems goes to ∞ and numerical approximations and simulations for low-dimensional Gaussian target distributions that show that the limiting results provide extremely accurate approximations in six and higher dimensions.

Bibliography

Gelman*, A., Roberts**, G. O., & Gilks***, W. R. (1996). Efficient Metropolis Jumping Rules. Bayesian Statistics 5, 599–608.

Authors 3
  1. A Gelman* (first)
  2. G O Roberts** (additional)
  3. W R Gilks*** (additional)
References 0 Referenced 511

None

Dates
Type When
Created 1 year, 10 months ago (Nov. 3, 2023, 9:40 a.m.)
Deposited 1 year, 10 months ago (Nov. 3, 2023, 9:40 a.m.)
Indexed 19 minutes ago (Sept. 7, 2025, 3:34 p.m.)
Issued 29 years, 3 months ago (May 9, 1996)
Published 29 years, 3 months ago (May 9, 1996)
Published Print 29 years, 3 months ago (May 9, 1996)
Funders 0

None

@inbook{Gelman__1996, title={Efficient Metropolis Jumping Rules}, ISBN={9781383023947}, url={http://dx.doi.org/10.1093/oso/9780198523567.003.0038}, DOI={10.1093/oso/9780198523567.003.0038}, booktitle={Bayesian Statistics 5}, publisher={Oxford University PressOxford}, author={Gelman*, A and Roberts**, G O and Gilks***, W R}, year={1996}, month=may, pages={599–608} }