The DOI matches its Crossref record.
Efficient Metropolis Jumping Rules
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Dunkley, J., Komatsu, E., Nolta, M. R., Spergel, D. N., Larson, D., Hinshaw, G., Page, L., Bennett, C. L., Gold, B., Jarosik, N., et al. (2009) · The Astrophysical Journal Supplement Series · doi:10.1088/0067-0049/180/2/306 · Cited by 1,787
Weak convergence and optimal scaling of random walk Metropolis algorithms
Roberts, G. O., Gelman, A., & Gilks, W. R. (1997) · The Annals of Applied Probability · doi:10.1214/aoap/1034625254 · Cited by 1,693
Self-citationBayesian Selection of Continuous-Time Markov Chain Evolutionary Models
Suchard, M. A., Weiss, R. E., & Sinsheimer, J. S. (2001) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a003872 · Cited by 791
A comparison of Bayesian and likelihood-based methods for fitting multilevel models
Browne, W. J., & Draper, D. (2006) · Bayesian Analysis · doi:10.1214/06-ba117 · Cited by 603
Parsimonious Bayesian Markov chain Monte Carlo inversion in a nonlinear geophysical problem
Malinverno, A. (2002) · Geophysical Journal International · doi:10.1046/j.1365-246x.2002.01847.x · Cited by 470
Metadata
- Authors
- Gelman*, A., Roberts**, G. O., & Gilks***, W. R.
- Venue
- Bayesian Statistics 5
- Publisher
- Oxford University PressOxford
- Published
- 1996-05-09
- Pages
- 599-608
- OpenAlex
- W4388320111
- Cited by
- 796
- References
- 0
- FWCI
- 47.21
- Type
- book chapter
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Efficient Metropolis Jumping Rules. https://app.cochat.ai/papers/10.1093/oso/9780198523567.003.0038
- The paper
- Gelman*, A., Roberts**, G. O., & Gilks***, W. R. (1996). Efficient Metropolis Jumping Rules. Bayesian Statistics 5. https://doi.org/10.1093/oso/9780198523567.003.0038
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.