This Title All WIREs
How to cite this WIREs title:
WIREs Comp Stat

Optimal Markov chain Monte Carlo sampling

Full article on Wiley Online Library:   HTML PDF

Can't access this content? Tell your librarian.

This article is a review article on the optimal Markov chain Monte Carlo (MCMC) sampling. The focus is on homogeneous Markov chains. This article first reviews the problem of finding the optimal transition matrix, which is defined to minimize the asymptotic variance of MCMC estimators. The article later reviews the locally optimal sampler (LOS), an MCMC sampling that performs local updates based on the optimal transition matrix. We conducted a simulation study to compare the LOS with the Metropolis–Hastings and the Gibbs Sampler. The LOS was shown to provide an improved rate of convergence over these two most popular sampling schemes. The implementation of the LOS requires only minor modifications in existing Gibbs sampling code. WIREs Comput Stat 2013. doi: 10.1002/wics.1265 This article is categorized under: Statistical and Graphical Methods of Data Analysis > Markov Chain Monte Carlo (MCMC)
The sample variances of the four MCMC algorithms for the following statistics: (a) the longest run length, (b) the number of runs, (c) the number of sites being 1, and (d) the longest run length of state 5.
[ Normal View | Magnified View ]

Browse by Topic

Statistical and Graphical Methods of Data Analysis > Markov Chain Monte Carlo (MCMC)

Access to this WIREs title is by subscription only.

Recommend to Your
Librarian Now!

The latest WIREs articles in your inbox

Sign Up for Article Alerts