{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T06:40:09Z","timestamp":1781246409372,"version":"3.54.1"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,6,24]],"date-time":"2020-06-24T00:00:00Z","timestamp":1592956800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,24]],"date-time":"2020-06-24T00:00:00Z","timestamp":1592956800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1513040"],"award-info":[{"award-number":["DMS-1513040"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1308918"],"award-info":[{"award-number":["DMS-1308918"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stat Comput"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s11222-020-09948-4","type":"journal-article","created":{"date-parts":[[2020,6,24]],"date-time":"2020-06-24T10:02:44Z","timestamp":1592992964000},"page":"1325-1345","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Markov chain Monte Carlo algorithms with sequential proposals"],"prefix":"10.1007","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4493-7730","authenticated-orcid":false,"given":"Joonha","family":"Park","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yves","family":"Atchad\u00e9","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,6,24]]},"reference":[{"key":"9948_CR1","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1214\/ECP.v12-1320","volume":"12","author":"C Andrieu","year":"2007","unstructured":"Andrieu, C., Atchade, Y.: On the efficiency of adaptive MCMC algorithms. Electron. Commun. Probab. 12, 336\u2013349 (2007)","journal-title":"Electron. Commun. Probab."},{"key":"9948_CR2","unstructured":"Andrieu, C., Livingstone, S.: Peskun-Tierney ordering for Markov chain and process Monte Carlo: beyond the reversible scenario. (2019). arXiv preprint arXiv:1906.06197"},{"key":"9948_CR3","doi-asserted-by":"crossref","first-page":"1462","DOI":"10.1214\/105051606000000286","volume":"16","author":"C Andrieu","year":"2006","unstructured":"Andrieu, C., Moulines, \u00c9.: On the ergodicity properties of some adaptive MCMC algorithms. Ann. Appl. Probab. 16, 1462\u20131505 (2006)","journal-title":"Ann. Appl. Probab."},{"key":"9948_CR4","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s11222-008-9110-y","volume":"18","author":"C Andrieu","year":"2008","unstructured":"Andrieu, C., Thoms, J.: A tutorial on adaptive MCMC. Stat. Comput. 18, 343\u2013373 (2008)","journal-title":"Stat. Comput."},{"key":"9948_CR5","doi-asserted-by":"crossref","first-page":"116","DOI":"10.3150\/09-BEJ199","volume":"16","author":"Y Atchad\u00e9","year":"2010","unstructured":"Atchad\u00e9, Y., Fort, G.: Limit theorems for some adaptive MCMC algorithms with subgeometric kernels. Bernoulli 16, 116\u2013154 (2010)","journal-title":"Bernoulli"},{"key":"9948_CR6","doi-asserted-by":"crossref","first-page":"975","DOI":"10.3150\/11-BEJ360","volume":"18","author":"YF Atchad\u00e9","year":"2012","unstructured":"Atchad\u00e9, Y.F., Fort, G.: Limit theorems for some adaptive MCMC algorithms with subgeometric kernels: Part II. Bernoulli 18, 975\u20131001 (2012)","journal-title":"Bernoulli"},{"key":"9948_CR7","doi-asserted-by":"crossref","first-page":"815","DOI":"10.3150\/bj\/1130077595","volume":"11","author":"YF Atchad\u00e9","year":"2005","unstructured":"Atchad\u00e9, Y.F., Rosenthal, J.S.: On adaptive Markov chain Monte Carlo algorithms. Bernoulli 11, 815\u2013828 (2005)","journal-title":"Bernoulli"},{"key":"9948_CR8","doi-asserted-by":"crossref","first-page":"1501","DOI":"10.3150\/12-BEJ414","volume":"19","author":"A Beskos","year":"2013","unstructured":"Beskos, A., Pillai, N., Roberts, G., Sanz-Serna, J.-M., Stuart, A.: Optimal tuning of the hybrid Monte Carlo algorithm. Bernoulli 19, 1501\u20131534 (2013)","journal-title":"Bernoulli"},{"key":"9948_CR9","unstructured":"Betancourt, M.: A conceptual introduction to Hamiltonian Monte Carlo. (2017). arXiv preprint arXiv:1701.02434"},{"key":"9948_CR10","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1080\/01621459.2017.1294075","volume":"113","author":"A Bouchard-C\u00f4t\u00e9","year":"2018","unstructured":"Bouchard-C\u00f4t\u00e9, A., Vollmer, S.J., Doucet, A.: The bouncy particle sampler: a nonreversible rejection-free Markov chain Monte Carlo method. J. Am. Stat. Assoc. 113, 855\u2013867 (2018)","journal-title":"J. Am. Stat. Assoc."},{"key":"9948_CR11","doi-asserted-by":"crossref","first-page":"17408","DOI":"10.1073\/pnas.1408184111","volume":"111","author":"B Calderhead","year":"2014","unstructured":"Calderhead, B.: A general construction for parallelizing Metropolis-Hastings algorithms. Proc. Natl. Acad. Sci. 111, 17408\u201317413 (2014)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"9948_CR12","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/j.jcp.2014.09.037","volume":"281","author":"CM Campos","year":"2015","unstructured":"Campos, C.M., Sanz-Serna, J.: Extra chance generalized hybrid Monte Carlo. J. Comput. Phys. 281, 365\u2013374 (2015)","journal-title":"J. Comput. Phys."},{"key":"9948_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.18637\/jss.v076.i01","volume":"76","author":"B 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.: Stan: a probabilistic programming language. J. Stat. Softw. 76, 1 (2017)","journal-title":"J. Stat. Softw."},{"key":"9948_CR14","unstructured":"Dua, D., Graff, C.: UCI machine learning repository. (2017). http:\/\/archive.ics.uci.edu\/ml. Accessed 17 Jan 2020"},{"key":"9948_CR15","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0370-2693(87)91197-X","volume":"195","author":"S Duane","year":"1987","unstructured":"Duane, S., Kennedy, A.D., Pendleton, B.J., Roweth, D.: Hybrid Monte Carlo. Phys. Lett. B 195, 216\u2013222 (1987)","journal-title":"Phys. Lett. B"},{"key":"9948_CR16","doi-asserted-by":"crossref","first-page":"174108","DOI":"10.1063\/1.4874000","volume":"140","author":"Y Fang","year":"2014","unstructured":"Fang, Y., Sanz-Serna, J.M., Skeel, R.D.: Compressible generalized hybrid Monte Carlo. J. Chem. Phys. 140, 174108 (2014)","journal-title":"J. Chem. Phys."},{"key":"9948_CR17","unstructured":"Flegal, J.M., Hughes, J., Vats, D., Dai, N.: mcmcse: Monte Carlo Standard Errors for MCMC. Riverside, CA, Denver, CO, Coventry, UK, and Minneapolis, MN. R package version 1.3-2 (2017)"},{"key":"9948_CR18","unstructured":"Geyer, C.J.: Markov chain Monte Carlo maximum likelihood. Retrieved from the University of Minnesota Digital Conservancy, Interface Foundation of North America (1991)"},{"key":"9948_CR19","doi-asserted-by":"crossref","first-page":"65","DOI":"10.2140\/camcos.2010.5.65","volume":"5","author":"J Goodman","year":"2010","unstructured":"Goodman, J., Weare, J.: Ensemble samplers with affine invariance. Commun. Appl. Math. Comput. Sci. 5, 65\u201380 (2010)","journal-title":"Commun. Appl. Math. Comput. Sci."},{"key":"9948_CR20","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1093\/biomet\/88.4.1035","volume":"88","author":"PJ Green","year":"2001","unstructured":"Green, P.J., Mira, A.: Delayed rejection in reversible jump Metropolis-Hastings. Biometrika 88, 1035\u20131053 (2001)","journal-title":"Biometrika"},{"key":"9948_CR21","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/0370-2693(90)91790-I","volume":"242","author":"S Gupta","year":"1990","unstructured":"Gupta, S., Irb\u00e4c, A., Karsch, F., Petersson, B.: The acceptance probability in the hybrid Monte Carlo method. Phys. Lett. B 242, 437\u2013443 (1990)","journal-title":"Phys. Lett. B"},{"key":"9948_CR22","doi-asserted-by":"crossref","first-page":"223","DOI":"10.2307\/3318737","volume":"7","author":"H Haario","year":"2001","unstructured":"Haario, H., Saksman, E., Tamminen, J.: An adaptive Metropolis algorithm. Bernoulli 7, 223\u2013242 (2001)","journal-title":"Bernoulli"},{"key":"9948_CR23","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1093\/biomet\/57.1.97","volume":"57","author":"WK Hastings","year":"1970","unstructured":"Hastings, W.K.: Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57, 97\u2013109 (1970)","journal-title":"Biometrika"},{"key":"9948_CR24","first-page":"1593","volume":"15","author":"MD Hoffman","year":"2014","unstructured":"Hoffman, M.D., Gelman, A.: The No-U-turn sampler: adaptively setting path lengths in Hamiltonian Monte Carlo. J. Mach. Learn. Res. 15, 1593\u20131623 (2014)","journal-title":"J. Mach. Learn. Res."},{"key":"9948_CR25","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0370-2693(91)90812-5","volume":"268","author":"AM Horowitz","year":"1991","unstructured":"Horowitz, A.M.: A generalized guided Monte Carlo algorithm. Phys. Lett. B 268, 247\u2013252 (1991)","journal-title":"Phys. Lett. B"},{"key":"9948_CR26","doi-asserted-by":"crossref","first-page":"1604","DOI":"10.1143\/JPSJ.65.1604","volume":"65","author":"K Hukushima","year":"1996","unstructured":"Hukushima, K., Nemoto, K.: Exchange Monte Carlo method and application to spin glass simulations. J. Phys. Soc. Jpn. 65, 1604\u20131608 (1996)","journal-title":"J. Phys. Soc. Jpn."},{"key":"9948_CR27","first-page":"1581","volume":"34","author":"S Kou","year":"2006","unstructured":"Kou, S., Zhou, Q., Wong, W.H., et al.: Equi-energy sampler with applications in statistical inference and statistical mechanics. Ann. Stat. 34, 1581\u20131619 (2006)","journal-title":"Ann. Stat."},{"key":"9948_CR28","volume-title":"Simulating Hamiltonian dynamics","author":"B Leimkuhler","year":"2004","unstructured":"Leimkuhler, B., Reich, S.: Simulating Hamiltonian dynamics, vol. 14. Cambridge University Press, Cambridge (2004)"},{"key":"9948_CR29","first-page":"342","volume":"3","author":"J Liouville","year":"1838","unstructured":"Liouville, J.: Note on the theory of the variation of arbitrary constants. Journal de Math\u00e9matiques Pures et Appliqu\u00e9es 3, 342\u2013349 (1838)","journal-title":"Journal de Math\u00e9matiques Pures et Appliqu\u00e9es"},{"key":"9948_CR30","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1080\/01621459.2000.10473908","volume":"95","author":"JS Liu","year":"2000","unstructured":"Liu, J.S., Liang, F., Wong, W.H.: The multiple-try method and local optimization in Metropolis sampling. J. Am. Stat. Assoc. 95, 121\u2013134 (2000)","journal-title":"J. Am. Stat. Assoc."},{"key":"9948_CR31","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1209\/0295-5075\/19\/6\/002","volume":"19","author":"E Marinari","year":"1992","unstructured":"Marinari, E., Parisi, G.: Simulated tempering: a new Monte Carlo scheme. EPL (Europhys. Lett.) 19, 451 (1992)","journal-title":"EPL (Europhys. Lett.)"},{"key":"9948_CR32","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21, 1087\u20131092 (1953)","journal-title":"J. Chem. Phys."},{"key":"9948_CR33","first-page":"231","volume":"59","author":"A Mira","year":"2001","unstructured":"Mira, A.: On metropolis-hastings algorithms with delayed rejection. Metron 59, 231\u2013241 (2001)","journal-title":"Metron"},{"key":"9948_CR34","doi-asserted-by":"crossref","unstructured":"Mira, A., M\u00f8ller, J., Roberts, G.O.: Perfect slice samplers. J. R. Stat. Soc. Ser. B (Stat. Methodol.) 63, 593\u2013606 (2001)","DOI":"10.1111\/1467-9868.00301"},{"key":"9948_CR35","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1006\/jcph.1994.1054","volume":"111","author":"RM Neal","year":"1994","unstructured":"Neal, R.M.: An improved acceptance procedure for the hybrid Monte Carlo algorithm. J. Comput. Phys. 111, 194\u2013203 (1994)","journal-title":"J. Comput. Phys."},{"key":"9948_CR36","first-page":"705","volume":"31","author":"RM Neal","year":"2003","unstructured":"Neal, R.M.: Slice sampling. Ann. Stat. 31, 705\u2013767 (2003)","journal-title":"Ann. Stat."},{"key":"9948_CR37","doi-asserted-by":"crossref","unstructured":"Neal, R.M.: MCMC using Hamiltonian dynamics. In: Brooks, S., Gelman, A., Jones, G., Meng, X.-L. (eds.) Handbook of Markov chain Monte Carlo, pp. 113\u2013162. CRC press (2011)","DOI":"10.1201\/b10905-6"},{"key":"9948_CR38","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1093\/biomet\/60.3.607","volume":"60","author":"PH Peskun","year":"1973","unstructured":"Peskun, P.H.: Optimum Monte-Carlo sampling using markov chains. Biometrika 60, 607\u2013612 (1973)","journal-title":"Biometrika"},{"key":"9948_CR39","doi-asserted-by":"crossref","first-page":"026703","DOI":"10.1103\/PhysRevE.85.026703","volume":"85","author":"EA Peters","year":"2012","unstructured":"Peters, E.A., et al.: Rejection-free Monte Carlo sampling for general potentials. Phys. Rev. E 85, 026703 (2012)","journal-title":"Phys. Rev. E"},{"key":"9948_CR40","first-page":"7","volume":"6","author":"M Plummer","year":"2006","unstructured":"Plummer, M., Best, N., Cowles, K., Vines, K.: CODA: convergence diagnosis and output analysis for MCMC. R News 6, 7\u201311 (2006)","journal-title":"R News"},{"key":"9948_CR41","unstructured":"R Core Team.: R: a Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna (2018). https:\/\/www.R-project.org\/"},{"key":"9948_CR42","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1111\/1467-9868.00123","volume":"60","author":"GO Roberts","year":"1998","unstructured":"Roberts, G.O., Rosenthal, J.S.: Optimal scaling of discrete approximations to Langevin diffusions. J. R. Stat. Soc. Ser. B (Stat. Methodol.) 60, 255\u2013268 (1998)","journal-title":"J. R. Stat. Soc. Ser. B (Stat. Methodol.)"},{"key":"9948_CR43","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1111\/1467-9868.00198","volume":"61","author":"GO Roberts","year":"1999","unstructured":"Roberts, G.O., Rosenthal, J.S.: Convergence of slice sampler Markov chains. J. R. Stat. Soc. Ser. B (Stat. Methodol.) 61, 643\u2013660 (1999)","journal-title":"J. R. Stat. Soc. Ser. B (Stat. Methodol.)"},{"key":"9948_CR44","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1239\/jap\/1183667414","volume":"44","author":"GO Roberts","year":"2007","unstructured":"Roberts, G.O., Rosenthal, J.S.: Coupling and ergodicity of adaptive Markov chain Monte Carlo algorithms. J. Appl. Probab. 44, 458\u2013475 (2007)","journal-title":"J. Appl. Probab."},{"key":"9948_CR45","first-page":"110","volume":"7","author":"GO Roberts","year":"1997","unstructured":"Roberts, G.O., Gelman, A., Gilks, W.R.: Weak convergence and optimal scaling of random walk Metropolis algorithms. Ann. Appl. Probab. 7, 110\u2013120 (1997)","journal-title":"Ann. Appl. Probab."},{"key":"9948_CR46","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1016\/0550-3213(92)90263-B","volume":"380","author":"J Sexton","year":"1992","unstructured":"Sexton, J., Weingarten, D.: Hamiltonian evolution for the hybrid Monte Carlo algorithm. Nucl. Phys. B 380, 665\u2013677 (1992)","journal-title":"Nucl. Phys. B"},{"key":"9948_CR47","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1214\/10-STS327","volume":"25","author":"C Sherlock","year":"2010","unstructured":"Sherlock, C., Fearnhead, P., Roberts, G.O.: The random walk Metropolis: Linking theory and practice through a case study. Stat. Sci. 25, 172\u2013190 (2010)","journal-title":"Stat. Sci."},{"key":"9948_CR48","unstructured":"Sohl-Dickstein, J., Mudigonda, M., DeWeese, M.R.: Hamiltonian Monte Carlo without detailed balance. (2014). arXiv preprint arXiv:1409.5191"},{"key":"9948_CR49","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1214\/aoap\/1027961031","volume":"8","author":"L Tierney","year":"1998","unstructured":"Tierney, L.: A note on Metropolis-Hastings kernels for general state spaces. Ann. Appl. Probab. 8, 1\u20139 (1998)","journal-title":"Ann. Appl. Probab."},{"key":"9948_CR50","doi-asserted-by":"crossref","first-page":"2507","DOI":"10.1002\/(SICI)1097-0258(19990915\/30)18:17\/18<2507::AID-SIM272>3.0.CO;2-J","volume":"18","author":"L Tierney","year":"1999","unstructured":"Tierney, L., Mira, A.: Some adaptive Monte Carlo methods for Bayesian inference. Stat. Med. 18, 2507\u20132515 (1999)","journal-title":"Stat. Med."},{"key":"9948_CR51","unstructured":"Vanetti, P., Bouchard-C\u00f4t\u00e9, A., Deligiannidis, G., Doucet, A.: Piecewise deterministic Markov chain Monte Carlo. (2017) arXiv preprint arXiv:1707.05296"}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-020-09948-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11222-020-09948-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-020-09948-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,23]],"date-time":"2021-06-23T23:33:23Z","timestamp":1624491203000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11222-020-09948-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,24]]},"references-count":51,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["9948"],"URL":"https:\/\/doi.org\/10.1007\/s11222-020-09948-4","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"value":"0960-3174","type":"print"},{"value":"1573-1375","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,24]]},"assertion":[{"value":"19 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 May 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The source codes used in this work are available at .","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}