{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T22:06:39Z","timestamp":1762034799387,"version":"build-2065373602"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,3,13]],"date-time":"2021-03-13T00:00:00Z","timestamp":1615593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,13]],"date-time":"2021-03-13T00:00:00Z","timestamp":1615593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Science and Engineering Research Council of Canada","doi-asserted-by":"crossref","award":["RGPIN-2019-04142"],"award-info":[{"award-number":["RGPIN-2019-04142"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003393","name":"Fujitsu","doi-asserted-by":"publisher","award":["0000302977"],"award-info":[{"award-number":["0000302977"]}],"id":[{"id":"10.13039\/501100003393","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Stat"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s00180-021-01095-2","type":"journal-article","created":{"date-parts":[[2021,3,13]],"date-time":"2021-03-13T10:02:27Z","timestamp":1615629747000},"page":"2789-2811","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Jump Markov chains and rejection-free Metropolis algorithms"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5118-6808","authenticated-orcid":false,"given":"Jeffrey S.","family":"Rosenthal","sequence":"first","affiliation":[]},{"given":"Aki","family":"Dote","sequence":"additional","affiliation":[]},{"given":"Keivan","family":"Dabiri","sequence":"additional","affiliation":[]},{"given":"Hirotaka","family":"Tamura","sequence":"additional","affiliation":[]},{"given":"Sigeng","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Ali","family":"Sheikholeslami","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,13]]},"reference":[{"issue":"2","key":"1095_CR1","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1214\/07-AOS574","volume":"37","author":"C Andrieu","year":"2009","unstructured":"Andrieu C, Roberts GO (2009) The pseudo-marginal approach for efficient Monte Carlo computations. Ann Stat 37(2):697\u2013725","journal-title":"Ann Stat"},{"key":"1095_CR2","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/0021-9991(75)90060-1","volume":"17","author":"AB Bortz","year":"1975","unstructured":"Bortz AB, Kalos MH, Lebowitz JL (1975) A new algorithm for Monte Carlo simulation of Ising spin systems. J Comp Phys 17:10\u201318","journal-title":"J Comp Phys"},{"volume-title":"Handbook of Markov chain Monte Carlo","year":"2011","key":"1095_CR3","unstructured":"Brooks S, Gelman A, Jones GL, Meng X-L (eds) (2011) Handbook of Markov chain Monte Carlo. Chapman and Hall\/CRC Press, Boca Raton"},{"issue":"4","key":"1095_CR4","doi-asserted-by":"publisher","first-page":"2309","DOI":"10.1214\/17-AAP1358","volume":"28","author":"G Deligiannidis","year":"2018","unstructured":"Deligiannidis G, Lee A (2018) Which ergodic averages have finite asymptotic variance? Ann Appl Prob 28(4):2309\u20132334","journal-title":"Ann Appl Prob"},{"key":"1095_CR5","first-page":"261","volume":"39","author":"R Douc","year":"2011","unstructured":"Douc R, Robert CP (2011) A vanilla Rao-Blackwellization of Metropolis\u2013Hastings algorithms. Ann Stat 39:261\u2013277","journal-title":"Ann Stat"},{"issue":"2","key":"1095_CR6","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1093\/biomet\/asu075","volume":"102","author":"A Doucet","year":"2015","unstructured":"Doucet A, Pitt MK, Deligiannidis G, Kohn R (2015) Efficient implementation of Markov chain Monte Carlo when using an unbiased likelihood estimator. Biometrika 102(2):295\u2013313","journal-title":"Biometrika"},{"key":"1095_CR7","volume-title":"Essentials of Stochastic Processes","author":"R Durrett","year":"1999","unstructured":"Durrett R (1999) Essentials of Stochastic Processes. Springer, New York"},{"key":"1095_CR8","unstructured":"National Center for Education Statistics (2002) Education Longitudinal Study of 2002. Available at: https:\/\/nces.ed.gov\/surveys\/els2002\/"},{"key":"1095_CR9","unstructured":"Geyer CJ (1991) Markov chain Monte Carlo maximum likelihood. In: Computing Science and Statistics, Proceedings of the 23rd Symposium on the Interface, American Statistical Association, New York, pp 156\u2013163"},{"key":"1095_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1093\/biomet\/57.1.97","volume":"57","author":"WK Hastings","year":"1970","unstructured":"Hastings WK (1970) Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57:97\u2013109","journal-title":"Biometrika"},{"key":"1095_CR11","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/s11222-012-9331-y","volume":"23","author":"G Iliopoulos","year":"2013","unstructured":"Iliopoulos G, Malefaki S (2013) Variance reduction of estimators arising from Metropolis\u2013Hastings algorithms. Stat Comput 23:577\u2013587","journal-title":"Stat Comput"},{"issue":"2","key":"1095_CR12","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1006\/jcph.1999.6291","volume":"153","author":"G Kornissa","year":"1999","unstructured":"Kornissa G, Novotnya MA, Rikvoldab PA (1999) Parallelization of a dynamic Monte Carlo algorithm: a partially rejection-free conservative approach. J Comp Phys 153(2):488\u2013508","journal-title":"J Comp Phys"},{"issue":"1","key":"1095_CR13","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0021-9991(88)90101-5","volume":"75","author":"BD Lubachevsky","year":"1988","unstructured":"Lubachevsky BD (1988) Efficient parallel simulations of dynamic ising spin systems. J Comp Phys 75(1):103\u2013122","journal-title":"J Comp Phys"},{"key":"1095_CR14","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.1016\/j.jspi.2007.05.030","volume":"138","author":"S Malefaki","year":"2008","unstructured":"Malefaki S, Iliopoulos G (2008) On convergence of properly weighted samples to the target distribution. J Stat Plan Inference 138:1210\u20131225","journal-title":"J Stat Plan Inference"},{"key":"1095_CR15","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis N, Rosenbluth A, Rosenbluth M, Teller A, Teller E (1953) Equations of state calculations by fast computing machines. J Chem Phys 21:1087\u20131091","journal-title":"J Chem Phys"},{"key":"1095_CR16","doi-asserted-by":"crossref","unstructured":"Meyn SP, Tweedie RL (1993) Markov chains and stochastic stability. Springer, London. Available at: http:\/\/probability.ca\/MT\/","DOI":"10.1007\/978-1-4471-3267-7"},{"key":"1095_CR17","first-page":"110","volume":"7","author":"GO Roberts","year":"1997","unstructured":"Roberts GO, Gelman A, Gilks WR (1997) Weak convergence and optimal scaling of random walk Metropolis algorithms. Ann Appl Prob 7:110\u2013120","journal-title":"Ann Appl Prob"},{"key":"1095_CR18","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1214\/ss\/1015346320","volume":"16","author":"GO Roberts","year":"2001","unstructured":"Roberts GO, Rosenthal JS (2001) Optimal scaling for various Metropolis\u2013Hastings algorithms. Stat Sci 16:351\u2013367","journal-title":"Stat Sci"},{"key":"1095_CR19","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1214\/12-AAP918","volume":"24","author":"GO Roberts","year":"2014","unstructured":"Roberts GO, Rosenthal JS (2014) Minimising MCMC variance via diffusion limits, with an application to simulated tempering. Ann Appl Prob 24:131\u2013149","journal-title":"Ann Appl Prob"},{"key":"1095_CR20","doi-asserted-by":"publisher","DOI":"10.1142\/6300","volume-title":"A first look at rigorous probability theory","author":"JS Rosenthal","year":"2006","unstructured":"Rosenthal JS (2006) A first look at rigorous probability theory, 2nd edn. World Scientific Publishing, Singapore","edition":"2"},{"key":"1095_CR21","doi-asserted-by":"publisher","DOI":"10.1142\/11488","volume-title":"A first look at stochastic processes","author":"JS Rosenthal","year":"2019","unstructured":"Rosenthal JS (2019) A first look at stochastic processes. World Scientific Publishing, Singapore"},{"key":"1095_CR22","doi-asserted-by":"publisher","first-page":"2607","DOI":"10.1103\/PhysRevLett.57.2607","volume":"57","author":"RH Swendsen","year":"1986","unstructured":"Swendsen RH, Wang JS (1986) Replica Monte Carlo simulation of spin glasses. Phys Rev Lett 57:2607\u20132609","journal-title":"Phys Rev Lett"}],"container-title":["Computational Statistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00180-021-01095-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00180-021-01095-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00180-021-01095-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T07:03:48Z","timestamp":1637219028000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00180-021-01095-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,13]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["1095"],"URL":"https:\/\/doi.org\/10.1007\/s00180-021-01095-2","relation":{},"ISSN":["0943-4062","1613-9658"],"issn-type":[{"type":"print","value":"0943-4062"},{"type":"electronic","value":"1613-9658"}],"subject":[],"published":{"date-parts":[[2021,3,13]]},"assertion":[{"value":"25 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}