The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Adaptive proposal distribution for random walk Metropolis algorithm
Open accessOverview
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
Cites
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Monte Carlo sampling methods using Markov chains and their applications.
Hastings, W. K. (1970) · Biometrika · doi:10.1093/biomet/57.1.97 · Cited by 15,195
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
Adaptive Rejection Sampling for Gibbs Sampling
Gilks, W. R., & Wild, P. (1992) · Applied Statistics · doi:10.2307/2347565 · Cited by 1,642
Efficient Metropolis Jumping Rules
Gelman*, A., Roberts**, G. O., & Gilks***, W. R. (1996) · Bayesian Statistics 5 · doi:10.1093/oso/9780198523567.003.0038 · Cited by 796
Adaptive Rejection Metropolis Sampling within Gibbs Sampling
Gilks, W. R., Best, N. G., & Tan, K. K. C. (1995) · Applied Statistics · doi:10.2307/2986138 · Cited by 671
Introducing Markov chain Monte Carlo
(1995) · Markov Chain Monte Carlo in Practice · doi:10.1201/b14835-6 · Cited by 510
Adaptive Markov Chain Monte Carlo through Regeneration
Gilks, W. R., Roberts, G. O., & Sahu, S. K. (1998) · Journal of the American Statistical Association · doi:10.1080/01621459.1998.10473766 · Cited by 297
Research works printed but not linked: 9
- Gelfand, A. E. & Smith, A. F. M. (1990), ‘Sampling-based approaches to calculate marginal densities’, J. Am. Stat. Ass. 85, 853–409.
- Gilks, W. R., Roberts, G. O. & George, E. I. (1994), ‘Adaptive direction sampling’, Statistical Science 43, 179–189.
- Gilks, W. & Roberts, G. (1995), Stategies for improving MCMC, in W. R. Gilks, S. Richardson & D. J. Spiegelhalter, eds, ‘Markov Chain Monte Carlo in Practice’, Chapman & Hall, pp. 75–88.
- Haario, H., Saksman, E. & Tamminen, J. (1998a), Adaptive proposal distribution for random walk Metropolis algorithm. Reports of the Department of Mathematics, University of Helsinki, Preprint 176.
- Haario, H., Saksman, E. & Tamminen, J. (1998b), An Adaptive Metropolis algorithm. Reports of the Department of Mathematics, University of Helsinki, Preprint 187.
- Kyrölä, E., Sihvola, E., Kotivuori, Y., Tikka, M., Tuomi, T. & Haario, H. (1993), ‘Inverse Theory for Occultation Measurements, 1. Spectral Inversion’, J. Geophys. Res. 98, 7367–7381. · doi:10.1029/92jd02678
- Press, W. H., Teukolsky, S. A., Vetterling, W. T. & Flannery, B. P. (1992), Numerical Recipes in FORTRAN, The art of scientific computing, Clasendon Press, Oxford.
- Sahu, S. K. & Zhigljavsky, A. A. (1998a), Self regenerative Markov chain Monte Carlo. Preprint. URL: https://doi.org/www.stats.bris.ac.uk/MCMC/
- Sahu, S. K. & Zhigljavsky, A. A. (1998b), Adaptation for self regenerative MCMC. Preprint. URL: https://doi.org/www.stats.bris.ac.uk/MCMC/
Cited by
Cai, C., Rodet, T., & Lambert, M. (2014) · Journal of Physics: Conference Series · doi:10.1088/1742-6596/542/1/012009 · Cited by 12,185
An Adaptive Metropolis Algorithm
Haario, H., Saksman, E., & Tamminen, J. (2001) · Bernoulli · doi:10.2307/3318737 · Cited by 2,631
Self-citationRiemann manifold langevin and hamiltonian monte carlo methods
Girolami, M., & Calderhead, B. (2011) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2010.00765.x · Cited by 1,473
Haario, H., Laine, M., Mira, A., & Saksman, E. (2006) · Statistics and Computing · doi:10.1007/s11222-006-9438-0 · Cited by 1,498
Self-citationVrugt, J. A., Gupta, H. V., Bouten, W., & Sorooshian, S. (2003) · Water Resources Research · doi:10.1029/2002wr001642 · Cited by 1,196
Metadata
- Authors
- Haario, H., Saksman, E., & Tamminen, J.
- Venue
- Computational Statistics
- Published
- 1999-09
- Volume
- 14
- Issue
- 3
- Pages
- 375-395
- ISSN
- 0943-4062 (ISSN-L)
- 1613-9658
- OpenAlex
- W1971670438
- Cited by
- 417
- References
- 8
- FWCI
- 3.26
- Type
- journal article
- Language
- en
- Open access
- green
- Licence
- www.springer.com/tdm (tdm)
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
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.