{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T14:24:06Z","timestamp":1762179846626,"version":"build-2065373602"},"reference-count":34,"publisher":"The Open Journal","issue":"115","license":[{"start":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T00:00:00Z","timestamp":1762128000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T00:00:00Z","timestamp":1762128000000},"content-version":"am","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T00:00:00Z","timestamp":1762128000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JOSS"],"published-print":{"date-parts":[[2025,11,3]]},"DOI":"10.21105\/joss.08594","type":"journal-article","created":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T13:34:07Z","timestamp":1762176847000},"page":"8594","source":"Crossref","is-referenced-by-count":0,"title":["rmcmc: Robust Markov chain Monte Carlo methods in R"],"prefix":"10.21105","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9104-7960","authenticated-orcid":false,"given":"Matthew M.","family":"Graham","sequence":"first","affiliation":[{"id":[{"id":"https:\/\/ror.org\/02jx3x895","id-type":"ROR","asserted-by":"publisher"}],"name":"University College London"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7277-086X","authenticated-orcid":false,"given":"Samuel","family":"Livingstone","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/02jx3x895","id-type":"ROR","asserted-by":"publisher"}],"name":"University College London"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"8722","reference":[{"key":"andrieu2008tutorial","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-008-9110-y","article-title":"A tutorial on adaptive MCMC","volume":"18","author":"Andrieu","year":"2008","unstructured":"Andrieu, C., & Thoms, J. (2008). A tutorial on adaptive MCMC. Statistics and Computing, 18, 343\u2013373. https:\/\/doi.org\/10.1007\/s11222-008-9110-y","journal-title":"Statistics and Computing"},{"issue":"2","key":"barker1965monte","doi-asserted-by":"publisher","DOI":"10.1071\/ph650119","article-title":"Monte Carlo calculations of the radial distribution functions for a proton electron plasma","volume":"18","author":"Barker","year":"1965","unstructured":"Barker, A. A. (1965). Monte Carlo calculations of the radial distribution functions for a proton electron plasma. Australian Journal of Physics, 18(2), 119\u2013134. https:\/\/doi.org\/10.1071\/ph650119","journal-title":"Australian Journal of Physics"},{"issue":"4","key":"besag1994comments","article-title":"Comments on \"Representations of knowledge in complex systems\" by U. Grenander and MI Miller","volume":"56","author":"Besag","year":"1994","unstructured":"Besag, J. (1994). Comments on \"Representations of knowledge in complex systems\" by U. Grenander and MI Miller. Journal of the Royal Statistical Society: Series B (Methodological), 56(4), 549\u2013581.","journal-title":"Journal of the Royal Statistical Society: Series B (Methodological)"},{"issue":"5a","key":"beskos2013optimal","doi-asserted-by":"publisher","DOI":"10.3150\/12-bej414","article-title":"Optimal tuning of the Hybrid Monte-Carlo algorithm","volume":"19","author":"Beskos","year":"2013","unstructured":"Beskos, A., Pillai, N. S., Roberts, G. O., Sanz-Serna, J., & Stuart, A. (2013). Optimal tuning of the Hybrid Monte-Carlo algorithm. Bernoulli, 19(5a), 1501\u20131534. https:\/\/doi.org\/10.3150\/12-bej414","journal-title":"Bernoulli"},{"key":"betancourt2017conceptual","article-title":"A conceptual introduction to Hamiltonian Monte Carlo","author":"Betancourt","year":"2017","unstructured":"Betancourt, M. (2017). A conceptual introduction to Hamiltonian Monte Carlo. arXiv Preprint arXiv:1701.02434.","journal-title":"arXiv preprint arXiv:1701.02434"},{"key":"burkner2024posterior","doi-asserted-by":"publisher","DOI":"10.32614\/cran.package.posterior","article-title":"posterior: Tools for working with posterior distributions","author":"B\u00fcrkner","year":"2024","unstructured":"B\u00fcrkner, P.-C., Gabry, J., Kay, M., & Vehtari, A. (2024). posterior: Tools for working with posterior distributions. https:\/\/doi.org\/10.32614\/cran.package.posterior"},{"key":"carpenter2017stan","doi-asserted-by":"crossref","DOI":"10.18637\/jss.v076.i01","article-title":"Stan: A probabilistic programming language","volume":"76","author":"Carpenter","year":"2017","unstructured":"Carpenter, B., Gelman, A., Hoffman, M. D., Lee, D., Goodrich, B., Betancourt, M., Brubaker, M., Guo, J., Li, P., & Riddell, A. (2017). Stan: A probabilistic programming language. Journal of Statistical Software, 76, 1\u201332.","journal-title":"Journal of Statistical Software"},{"issue":"2","key":"duane1987hybrid","doi-asserted-by":"crossref","DOI":"10.1016\/0370-2693(87)91197-X","article-title":"Hybrid Monte Carlo","volume":"195","author":"Duane","year":"1987","unstructured":"Duane, S., Kennedy, A. D., Pendleton, B. J., & Roweth, D. (1987). Hybrid Monte Carlo. Physics Letters B, 195(2), 216\u2013222.","journal-title":"Physics letters B"},{"key":"geyer2023mcmc","article-title":"mcmc: Markov chain Monte Carlo","author":"Geyer","year":"2023","unstructured":"Geyer, C. J., & Johnson, L. T. (2023). mcmc: Markov chain Monte Carlo (R package version 0.9.8). https:\/\/github.com\/cjgeyer\/mcmc"},{"issue":"2","key":"haario2001adaptive","doi-asserted-by":"crossref","DOI":"10.2307\/3318737","article-title":"An adaptive Metropolis algorithm","volume":"7","author":"Haario","year":"2001","unstructured":"Haario, H., Saksman, E., & Tamminen, J. (2001). An adaptive Metropolis algorithm. Bernoulli, 7(2), 223\u2013242.","journal-title":"Bernoulli"},{"issue":"1","key":"hastings1970monte","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198509936.003.0015","article-title":"Monte Carlo sampling methods using Markov chains and their applications","volume":"57","author":"Hastings","year":"1970","unstructured":"Hastings, W. K. (1970). Monte Carlo sampling methods using Markov chains and their applications. Biometrika, 57(1), 97\u2013109. https:\/\/doi.org\/10.1093\/oso\/9780198509936.003.0015","journal-title":"Biometrika"},{"key":"helske2021ramcmc","doi-asserted-by":"publisher","DOI":"10.32614\/cran.package.ramcmc","volume-title":"ramcmc: Robust adaptive Metropolis algorithm","author":"Helske","year":"2021","unstructured":"Helske, J. (2021). ramcmc: Robust adaptive Metropolis algorithm. https:\/\/doi.org\/10.32614\/cran.package.ramcmc"},{"key":"hird2020fresh","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-98319-2_8","article-title":"A fresh take on \u2018Barker dynamics\u2019 for MCMC","author":"Hird","year":"2020","unstructured":"Hird, M., Livingstone, S., & Zanella, G. (2020). A fresh take on \u201cBarker dynamics\u201d for MCMC. International Conference on Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing, 169\u2013184. https:\/\/doi.org\/10.1007\/978-3-030-98319-2_8","journal-title":"International conference on monte carlo and quasi-monte carlo methods in scientific computing"},{"issue":"1","key":"hoffman2014no","article-title":"The No-U-Turn sampler: Adaptively setting path lengths in Hamiltonian Monte Carlo.","volume":"15","author":"Hoffman","year":"2014","unstructured":"Hoffman, M. D., & Gelman, A. (2014). The No-U-Turn sampler: Adaptively setting path lengths in Hamiltonian Monte Carlo. Journal of Machine Learning Research, 15(1), 1593\u20131623.","journal-title":"Journal of Machine Learning Research"},{"key":"johnson2012variable","doi-asserted-by":"publisher","DOI":"10.1214\/12-aos1048","article-title":"Variable transformation to obtain geometric ergodicity in the random-walk Metropolis algorithm","author":"Johnson","year":"2012","unstructured":"Johnson, L. T., & Geyer, C. J. (2012). Variable transformation to obtain geometric ergodicity in the random-walk Metropolis algorithm. The Annals of Statistics, 3050\u20133076. https:\/\/doi.org\/10.1214\/12-aos1048","journal-title":"The Annals of Statistics"},{"issue":"2","key":"livingstone2022barker","doi-asserted-by":"publisher","DOI":"10.1111\/rssb.12482","article-title":"The Barker proposal: Combining robustness and efficiency in gradient-based MCMC","volume":"84","author":"Livingstone","year":"2022","unstructured":"Livingstone, S., & Zanella, G. (2022). The Barker proposal: Combining robustness and efficiency in gradient-based MCMC. Journal of the Royal Statistical Society Series B: Statistical Methodology, 84(2), 496\u2013523. https:\/\/doi.org\/10.1111\/rssb.12482","journal-title":"Journal of the Royal Statistical Society Series B: Statistical Methodology"},{"issue":"9","key":"martin2011mcmcmpack","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v042.i09","article-title":"MCMCpack: Markov chain Monte Carlo in R","volume":"42","author":"Martin","year":"2011","unstructured":"Martin, A. D., Quinn, K. M., & Park, J. H. (2011). MCMCpack: Markov chain Monte Carlo in R. Journal of Statistical Software, 42(9), 22. https:\/\/doi.org\/10.18637\/jss.v042.i09","journal-title":"Journal of Statistical Software"},{"issue":"6","key":"metropolis1953equation","doi-asserted-by":"publisher","DOI":"10.1007\/s12045-022-1419-x","article-title":"Equation of state calculations by fast computing machines","volume":"21","author":"Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953). Equation of state calculations by fast computing machines. The Journal of Chemical Physics, 21(6), 1087\u20131092. https:\/\/doi.org\/10.1007\/s12045-022-1419-x","journal-title":"The Journal of Chemical Physics"},{"key":"neal2011mcmc","doi-asserted-by":"publisher","DOI":"10.1201\/b10905-6","article-title":"MCMC using Hamiltonian dynamics","author":"Neal","year":"2011","unstructured":"Neal, R. M. (2011). MCMC using Hamiltonian dynamics. In Handbook of Markov chain Monte Carlo (pp. 113\u2013162). Chapman; Hall\/CRC. https:\/\/doi.org\/10.1201\/b10905-6","journal-title":"Handbook of Markov chain Monte Carlo"},{"issue":"1","key":"nesterov2009primal","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.912637","article-title":"Primal-dual subgradient methods for convex problems","volume":"120","author":"Nesterov","year":"2009","unstructured":"Nesterov, Y. (2009). Primal-dual subgradient methods for convex problems. Mathematical Programming, 120(1), 221\u2013259. https:\/\/doi.org\/10.2139\/ssrn.912637","journal-title":"Mathematical programming"},{"key":"perry2017programming","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2016.1172487","article-title":"Programming with models: Writing statistical algorithms for general model structures with NIMBLE","volume":"26","author":"de Valpine","year":"2017","unstructured":"de Valpine, P., Turek, D., Paciorek, C., Anderson-Bergman, C., Temple Lang, D., & Bodik, R. (2017). Programming with models: Writing statistical algorithms for general model structures with NIMBLE. Journal of Computational and Graphical Statistics, 26, 403\u2013413. https:\/\/doi.org\/10.1080\/10618600.2016.1172487","journal-title":"Journal of Computational and Graphical Statistics"},{"key":"perry2024nimble","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.1211190","volume-title":"NIMBLE: MCMC, particle filtering, and programmable hierarchical modeling","author":"de Valpine","year":"2024","unstructured":"de Valpine, P., Paciorek, C., Turek, D., Michaud, N., Anderson-Bergman, C., Obermeyer, F., Wehrhahn Cortes, C., Rodr\u00ecguez, A., Temple Lang, D., & Paganin, S. (2024). NIMBLE: MCMC, particle filtering, and programmable hierarchical modeling (Version 1.3.0) [Computer software]. https:\/\/doi.org\/10.5281\/zenodo.1211190"},{"key":"rcoreteam2024r","doi-asserted-by":"publisher","DOI":"10.32614\/r.manuals","volume-title":"R: A language and environment for statistical computing","author":"R Core Team","year":"2024","unstructured":"R Core Team. (2024). R: A language and environment for statistical computing. R Foundation for Statistical Computing. https:\/\/doi.org\/10.32614\/r.manuals"},{"issue":"4","key":"roberts1996exponential","doi-asserted-by":"publisher","DOI":"10.2307\/3318418","article-title":"Exponential convergence of Langevin distributions and their discrete approximations","volume":"2","author":"Roberts","year":"1996","unstructured":"Roberts, G. O., & Tweedie, R. L. (1996). Exponential convergence of Langevin distributions and their discrete approximations. Bernoulli, 2(4), 341\u2013363. https:\/\/doi.org\/10.2307\/3318418","journal-title":"Bernoulli"},{"issue":"1","key":"roberts1998optimal","doi-asserted-by":"publisher","DOI":"10.1111\/1467-9868.00123","article-title":"Optimal scaling of discrete approximations to Langevin diffusions","volume":"60","author":"Roberts","year":"1998","unstructured":"Roberts, G. O., & Rosenthal, J. S. (1998). Optimal scaling of discrete approximations to Langevin diffusions. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 60(1), 255\u2013268. https:\/\/doi.org\/10.1111\/1467-9868.00123","journal-title":"Journal of the Royal Statistical Society: Series B (Statistical Methodology)"},{"issue":"10","key":"rossky1978brownian","doi-asserted-by":"publisher","DOI":"10.1063\/1.436415","article-title":"Brownian dynamics as smart Monte Carlo simulation","volume":"69","author":"Rossky","year":"1978","unstructured":"Rossky, P. J., Doll, J. D., & Friedman, H. L. (1978). Brownian dynamics as smart Monte Carlo simulation. The Journal of Chemical Physics, 69(10), 4628\u20134633. https:\/\/doi.org\/10.1063\/1.436415","journal-title":"The Journal of Chemical Physics"},{"issue":"87","key":"roualdes2023bridgestan","doi-asserted-by":"publisher","DOI":"10.21105\/joss.05236","article-title":"BridgeStan: Efficient in-memory access to the methods of a Stan model","volume":"8","author":"Roualdes","year":"2023","unstructured":"Roualdes, E. A., Ward, B., Carpenter, B., Seyboldt, A., & Axen, S. D. (2023). BridgeStan: Efficient in-memory access to the methods of a Stan model. Journal of Open Source Software, 8(87), 5236. https:\/\/doi.org\/10.21105\/joss.05236","journal-title":"Journal of Open Source Software"},{"key":"stan2024rstan","article-title":"RStan: The R interface to Stan","author":"Stan Development Team","year":"2024","unstructured":"Stan Development Team. (2024). RStan: The R interface to Stan. https:\/\/mc-stan.org\/"},{"issue":"99","key":"turek2024nimblehmc","doi-asserted-by":"publisher","DOI":"10.21105\/joss.06745","article-title":"nimbleHMC: An R package for Hamiltonian Monte Carlo sampling in nimble","volume":"9","author":"Turek","year":"2024","unstructured":"Turek, D., Valpine, P. de, & Paciorek, C. J. (2024). nimbleHMC: An R package for Hamiltonian Monte Carlo sampling in nimble. Journal of Open Source Software, 9(99), 6745. https:\/\/doi.org\/10.21105\/joss.06745","journal-title":"Journal of Open Source Software"},{"issue":"5","key":"vihola2012robust","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-011-9269-5","article-title":"Robust adaptive Metropolis algorithm with coerced acceptance rate","volume":"22","author":"Vihola","year":"2012","unstructured":"Vihola, M. (2012). Robust adaptive Metropolis algorithm with coerced acceptance rate. Statistics and Computing, 22(5), 997\u20131008. https:\/\/doi.org\/10.1007\/s11222-011-9269-5","journal-title":"Statistics and Computing","ISSN":"https:\/\/id.crossref.org\/issn\/1573-1375","issn-type":"print"},{"issue":"3","key":"vogrinc2023optimal","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/asac056","article-title":"Optimal design of the Barker proposal and other locally balanced Metropolis\u2013Hastings algorithms","volume":"110","author":"Vogrinc","year":"2023","unstructured":"Vogrinc, J., Livingstone, S., & Zanella, G. (2023). Optimal design of the Barker proposal and other locally balanced Metropolis\u2013Hastings algorithms. Biometrika, 110(3), 579\u2013595. https:\/\/doi.org\/10.1093\/biomet\/asac056","journal-title":"Biometrika"},{"issue":"39","key":"yon2019fmcmc","doi-asserted-by":"publisher","DOI":"10.21105\/joss.01427","article-title":"fmcmc: A friendly MCMC framework","volume":"4","author":"Yon","year":"2019","unstructured":"Yon, G. G. V., & Marjoram, P. (2019). fmcmc: A friendly MCMC framework. Journal of Open Source Software, 4(39), 1427. https:\/\/doi.org\/10.21105\/joss.01427","journal-title":"Journal of Open Source Software"},{"key":"zanella2019barker","article-title":"Code for the paper Livingstone and Zanella (2019) \"On the robustness of gradient-based MCMC\"","author":"Zanella","year":"2019","unstructured":"Zanella, G. (2019). Code for the paper Livingstone and Zanella (2019) \"On the robustness of gradient-based MCMC\". https:\/\/github.com\/gzanella\/barker"},{"issue":"1","key":"plummer2015coda","article-title":"CODA: Convergence diagnosis and output analysis for MCMC","volume":"6","author":"Plummer","year":"2006","unstructured":"Plummer, M., Best, N., Cowles, K., & Vines, K. (2006). CODA: Convergence diagnosis and output analysis for MCMC. R News, 6(1), 7\u201311. https:\/\/journal.r-project.org\/archive\/","journal-title":"R News"}],"container-title":["Journal of Open Source Software"],"original-title":[],"link":[{"URL":"https:\/\/joss.theoj.org\/papers\/10.21105\/joss.08594.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T13:34:08Z","timestamp":1762176848000},"score":1,"resource":{"primary":{"URL":"https:\/\/joss.theoj.org\/papers\/10.21105\/joss.08594"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,3]]},"references-count":34,"journal-issue":{"issue":"115","published-online":{"date-parts":[[2025,11]]}},"alternative-id":["10.21105\/joss.08594"],"URL":"https:\/\/doi.org\/10.21105\/joss.08594","relation":{"has-review":[{"id-type":"uri","id":"https:\/\/github.com\/openjournals\/joss-reviews\/issues\/8594","asserted-by":"subject"}],"references":[{"id-type":"doi","id":"10.5281\/zenodo.17383113","asserted-by":"subject"}]},"ISSN":["2475-9066"],"issn-type":[{"type":"electronic","value":"2475-9066"}],"subject":[],"published":{"date-parts":[[2025,11,3]]}}}