Convergence properties of pseudo-marginal Markov chain Monte Carlo algorithms

Metropolis, NicholasN., Rosenbluth, Arianna W.A. W., Rosenbluth, Marshall N.M. N., Teller, Augusta H.A. H. andTeller, EdwardE. (1953). Equations of state calculations by fast computing machines. J. Chem. Phys. 21 1087–1092

1953

Earlier work this paper cites.

Meyer, Paul A.P. A. (1966). Probability and Potentials. Blaisdell, Waltham, MA

1966

Earlier work this paper cites.

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

1970

Earlier work this paper cites.

Peskun, P. H.P. H. (1973). Optimum Monte-Carlo sampling using Markov chains. Biometrika 60 607–612

1973

Earlier work this paper cites.

Caracciolo, SergioS., Pelissetto, AndreaA. andSokal, Alan D.A. D. (1990). Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints. J. Stat. Phys. 60 1–53

1990

Earlier work this paper cites.

Mengersen, K. L.K. L. andTweedie, R. L.R. L. (1996). Rates of convergence of the Hastings and Metropolis algorithms. Ann. Statist. 24 101–121

1996

Earlier work this paper cites.

Roberts, G. O.G. O. andTweedie, R. L.R. L. (1996). Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms. Biometrika 83 95–110

1996

Earlier work this paper cites.

Roberts, Gareth O.G. O. andRosenthal, Jeffrey S.J. S. (1997). Geometric ergodicity and hybrid Markov chains. Electron. Commun. Probab. 2 13–25 (electronic)

1997

Earlier work this paper cites.

Tierney, LukeL. (1998). A note on Metropolis–Hastings kernels for general state spaces. Ann. Appl. Probab. 8 1–9

Original

1998

Earlier work this paper cites.

Jarner, Søren FiigS. F. andHansen, ErnstE. (2000). Geometric ergodicity of Metropolis algorithms. Stochastic Process. Appl. 85 341–361

2000

Earlier work this paper cites.

Jarner, Søren F.S. F. andRoberts, Gareth O.G. O. (2002). Polynomial convergence rates of Markov chains. Ann. Appl. Probab. 12 224–247

2002

Earlier work this paper cites.

Lindvall, TorgnyT. (2002). Lectures on the Coupling Method. Dover, Mineola, NY

2002

Earlier work this paper cites.

Nummelin, EsaE. (2002). MC’s for MCMC’ists. Int. Statist. Rev. 70 215–240

2002

Cited alongside, same era.

Beaumont, Mark A.M. A. (2003). Estimation of population growth or decline in genetically monitored populations. Genetics 164 1139–1160

2003

Cited alongside, same era.

Douc, RandalR., Fort, GersendeG., Moulines, EricE. andSoulier, PhilippeP. (2004). Practical drift conditions for subgeometric rates of convergence. Ann. Appl. Probab. 14 1353–1377

2004

Cited alongside, same era.

Andrieu, ChristopheC. andFort, GersendeG. (2005). Explicit control of subgeometric ergodicity. Research Report No. 05:17, Univ. Bristol

2005

Cited alongside, same era.

Baxendale, Peter H.P. H. (2005). Renewal theory and computable convergence rates for geometrically ergodic Markov chains. Ann. Appl. Probab. 15 700–738

2005

Cited alongside, same era.

Andrieu, ChristopheC., Doucet, ArnaudA. andHolenstein, RomanR. (2010). Particle Markov chain Monte Carlo methods. J. R. Stat. Soc. Ser. B Stat. Methodol. 72 269–342

2010

Later among the works it cites.

Saksman, EeroE. andVihola, MattiM. (2010). On the ergodicity of the adaptive Metropolis algorithm on unbounded domains. Ann. Appl. Probab. 20 2178–2203

2010

Later among the works it cites.

Lee, AnthonyA., Andrieu, ChristopheC. andDoucet, ArnaudA. (2012). Discussion of “Constructing summary statistics for approximate Bayesian computation: semi-automatic approximate Bayesian computation” by Fearnhead and Prangle. J. R. Stat. Soc. Ser. B Stat. Methodol. 74 449–450

2012

Closest in time.

Lee, AnthonyA. andŁatuszyński, KrzysztofK. (2012). Variance bounding and geometric ergodicity of Markov chain Monte Carlo kernels for approximate Bayesian computation. Available at \arxivurl

Original

2012

Closest in time.