Jump Markov Chains and Rejection-Free Metropolis Algorithms

N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller (1953), Equations of state calculations by fast computing machines. J. Chem. Phys. 21

1953

Earlier work this paper cites.

W.K. Hastings (1970), Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57

1970

Earlier work this paper cites.

A.B. Bortz, M.H. Kalos, and J.L. Lebowitz (1975), A New Algorithm for Monte Carlo Simulation of Ising Spin Systems. J. Comp. Phys. 17

1975

Earlier work this paper cites.

R.H. Swendsen and J.S. Wang (1986), Replica Monte Carlo simulation of spin glasses. Phys. Rev. Lett. 57

1986

Earlier work this paper cites.

B.D. Lubachevsky (1988), Efficient Parallel Simulations of Dynamic Ising Spin Systems. J. Comp. Phys. 75(1)

1988

Earlier work this paper cites.

C.J. Geyer (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, 156–163

1991

Earlier work this paper cites.

S.P. Meyn and R.L. Tweedie (1993), Markov chains and stochastic stability. Springer-Verlag, London. Available at: http://probability.ca/MT/

1993

Earlier work this paper cites.

G.O. Roberts, A. Gelman, and W.R. Gilks (1997), Weak convergence and optimal scaling of random walk Metropolis algorithms. Ann. Appl. Prob. 7

1997

Earlier work this paper cites.

R. Durrett (1999), Essentials of stochastic processes. Springer, New York

1999

Cited alongside, same era.

G. Kornissa, M.A. Novotnya, and P.A. Rikvoldab (1999), Parallelization of a Dynamic Monte Carlo Algorithm: A Partially Rejection-Free Conservative Approach. J. Comp. Phys. 153(2)

1999

Cited alongside, same era.

G.O. Roberts and J.S. Rosenthal (2001), Optimal scaling for various Metropolis-Hastings algorithms. Stat. Sci. 16

2001

Cited alongside, same era.

National Center for Education Statistics (2002), Education Longitudinal Study of 2002. Available at: https://nces.ed.gov/surveys/els2002/

2002

Cited alongside, same era.

J.S. Rosenthal (2006), A first look at rigorous probability theory, 2nd ed. World Scientific Publishing, Singapore

2006

Cited alongside, same era.

S. Brooks, A. Gelman, G.L. Jones, and X.-L. Meng, eds. (2011), Handbook of Markov chain Monte Carlo. Chapman & Hall / CRC Press

2011

Later among the works it cites.

R. Douc and C.P. Robert (2011), A vanilla Rao-Blackwellization of Metropolis-Hastings algorithms. Ann. Stat. 39

2011

Later among the works it cites.

G. Iliopoulos and S. Malefaki (2013), Variance reduction of estimators arising from Metropolis-Hastings algorithms. Stat. Comput. 23

2013

Later among the works it cites.

G.O. Roberts and J.S. Rosenthal (2014), Minimising MCMC Variance via Diffusion Limits, with an Application to Simulated Tempering. Ann. Appl. Prob. 24

2014

Later among the works it cites.

A. Doucet, M.K. Pitt, G. Deligiannidis, and R. Kohn (2015), Efficient implementation of Markov chain Monte Carlo when using an unbiased likelihood estimator. Biometrika 102(2)

2015