Scaling analysis of multiple-try MCMC methods
- 31 March 2012
- journal article
- research article
- Published by Elsevier BV in Stochastic Processes and their Applications
- Vol. 122 (3), 758-786
- https://doi.org/10.1016/j.spa.2011.11.004
Abstract
No abstract availableKeywords
Funding Information
- National Sciences and Engineering Research Council of Canada
- Agence Nationale de la Recherche
This publication has 7 references indexed in Scilit:
- Optimal acceptance rates for Metropolis algorithms: Moving beyond 0.234Stochastic Processes and their Applications, 2008
- Weak convergence of Metropolis algorithms for non-i.i.d. target distributionsThe Annals of Applied Probability, 2007
- Acceleration of the Multiple-Try Metropolis algorithm using antithetic and stratified samplingStatistics and Computing, 2007
- Optimal scaling for various Metropolis-Hastings algorithmsStatistical Science, 2001
- The Multiple-Try Method and Local Optimization in Metropolis SamplingJournal of the American Statistical Association, 2000
- Markov‐chain monte carlo: Some practical implications of theoretical resultsThe Canadian Journal of Statistics / La Revue Canadienne de Statistique, 1998
- Weak convergence and optimal scaling of random walk Metropolis algorithmsThe Annals of Applied Probability, 1997