The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Langevin Diffusions and Metropolis-Hastings Algorithms
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
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
Brownian Motion and Stochastic Calculus
(2007) · Springer Finance · doi:10.1007/978-1-84628-696-4_13 · Cited by 7,422
Markov Chains and Stochastic Stability
Meyn, S. P., & Tweedie, R. L. (1993) · Springer eBooks · doi:10.1007/978-1-4471-3267-7 · Cited by 5,041
Multidimensional Diffusion Processes
Stroock, D. W., & Varadhan, S. R. S. (1997) · Springer eBooks · doi:10.1007/3-540-28999-2 · Cited by 2,009
Simulated Tempering: A New Monte Carlo Scheme
Marinari, E., & Parisi, G. (1992) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/19/6/002 · Cited by 1,818
Nineteen Dubious Ways to Compute the Exponential of a Matrix
Moler, C., & Van Loan, C. (1978) · SIAM Review · doi:10.1137/1020098 · Cited by 1,526
Diffusions, Markov Processes and Martingales
Rogers, L. C. G., & Williams, D. (2000) · Cambridge University Press eBooks · doi:10.1017/cbo9780511805141 · Cited by 1,135
Optimal scaling for various Metropolis-Hastings algorithms
Roberts, G. O., & Rosenthal, J. S. (2001) · Statistical Science · doi:10.1214/ss/1015346320 · Cited by 1,103
Self-citationExponential Convergence of Langevin Distributions and Their Discrete Approximations
Roberts, G. O., & Tweedie, R. L. (1996) · Bernoulli · doi:10.2307/3318418 · Cited by 998
Self-citationOptimal Scaling of Discrete Approximations to Langevin Diffusions
Roberts, G. O., & Rosenthal, J. S. (1998) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00123 · Cited by 632
Self-citationBrownian dynamics as smart Monte Carlo simulation
Rossky, P. J., Doll, J. D., & Friedman, H. L. (1978) · The Journal of Chemical Physics · doi:10.1063/1.436415 · Cited by 509
Roberts, G. (1996) · Biometrika · doi:10.1093/biomet/83.1.95 · Cited by 417
Self-citationSampling from multimodal distributions using tempered transitions
Neal, R. M. (1996) · Statistics and Computing · doi:10.1007/bf00143556 · Cited by 343
Kent, J. T. (1978) · Advances in Applied Probability · doi:10.2307/1426661 · Cited by 91
Langevin-Type Models II: Self-Targeting Candidates for MCMC Algorithms*
Stramer, O., & Tweedie, R. L. (1999) · Methodology And Computing In Applied Probability · doi:10.1023/a:1010090512027 · Cited by 73
Self-citationLangevin-Type Models I: Diffusions with Given Stationary Distributions and their Discretizations*
Stramer, O., & Tweedie, R. L. (1999) · Methodology And Computing In Applied Probability · doi:10.1023/a:1010086427957 · Cited by 68
Self-citation
Cited by
Particle Markov Chain Monte Carlo Methods
Andrieu, C., Doucet, A., & Holenstein, R. (2010) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2009.00736.x · Cited by 1,971
Riemann 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
A survey of uncertainty in deep neural networks
Gawlikowski, J., Tassi, C. R. N., Ali, M., Lee, J., Humt, M., Feng, J., Kruspe, A., Triebel, R., Jung, P., Roscher, R., et al. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-023-10562-9 · Cited by 1,406
Theoretical Guarantees for Approximate Sampling from Smooth and Log-Concave Densities
Dalalyan, A. S. (2017) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/rssb.12183 · Cited by 315
Single-trial spike trains in parietal cortex reveal discrete steps during decision-making
Latimer, K. W., Yates, J. L., Meister, M. L. R., Huk, A. C., & Pillow, J. W. (2015) · Science · doi:10.1126/science.aaa4056 · Cited by 306
Metadata
- Authors
- Roberts, G. O., & Stramer, O.
- Venue
- Methodology And Computing In Applied Probability
- Published
- 2002-12
- Volume
- 4
- Issue
- 4
- Pages
- 337-357
- ISSN
- 1387-5841 (ISSN-L)
- 1573-7713
- OpenAlex
- W1556278552
- Cited by
- 261
- References
- 17
- FWCI
- 0.72
- Type
- journal article
- 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
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.