Comment: On Random Scan Gibbs Samplers
Richard A. Levine and George Casella
Source: Statist. Sci. Volume 23, Number 2 (2008), 192-195.
Full-text: Access denied (no subscription detected)
We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber.
If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.ss/1219339111
Digital Object Identifier: doi:10.1214/08-STS252B
References
Amit, Y. (1996). Convergence properties of the Gibbs sampler for perturbations of Gaussians. Ann. Statist. 24 122–140.
Mathematical Reviews (MathSciNet):
MR1389883
Digital Object Identifier: doi:10.1214/aos/1033066202
Project Euclid: euclid.aos/1033066202
Chen, R., Liu, J. S. and Wang, X. (2002). Convergence analyses and comparisons of Markov chain Monte Carlo algorithms in digital communications. IEEE Trans. Signal Process. 50 255–270.
Diaconis, P., Khare, K. and Saloff-Coste, L. (2006). Gibbs sampling, exponential families and coupling. Preprint, Dept. Statistics, Stanford Univ.
Frigessi, A., Di Stefano, P., Hwang, C.-R. and Sheu, S.-J. (1993). Convergence rates of the Gibbs sampler, the Metropolis algorithm and other single-site updating dynamics. J. Roy. Statist. Soc. Ser. B 55 205–219.
Mathematical Reviews (MathSciNet):
MR1210432
JSTOR: links.jstor.org
Goodman, J. and Sokal, A. (1989). Multigrid Monte Carlo method conceptual foundations. Phys. Rev. D 40 2035–2071.
Khare, K. and Zhou, H. (2008). Rates of convergence of some multivariate Markov chains with polynomial eigenfunctions. Technical report, Dept. Statistics, Stanford Univ.
Levine, R. A. (2005). A note on Markov chain Monte Carlo sweep strategies. J. Stat. Comput. Simul. 75 253–262.
Mathematical Reviews (MathSciNet):
MR2134639
Digital Object Identifier: doi:10.1080/0094965042000223671
Levine, R. A. and Casella, G. (2006). Optimizing random scan Gibbs samplers. J. Multivariate Anal. 97 2071–2100.
Mathematical Reviews (MathSciNet):
MR2301627
Digital Object Identifier: doi:10.1016/j.jmva.2006.05.008
Levine, R. A., Yu, Z., Hanley, W. G. and Nitao, J. J. (2005). Implementing random scan Gibbs samplers. Comput. Statist. 20 177–196.
Mathematical Reviews (MathSciNet):
MR2162541
Digital Object Identifier: doi:10.1007/BF02736129
Liu, J., Wong, W. and Kong, A. (1995). Covariance structure and convergence rates of the Gibbs sampler with various scans. J. Roy. Statist. Soc. Ser. B 57 157–169.
Mathematical Reviews (MathSciNet):
MR1325382
JSTOR: links.jstor.org
Mira, A. (2001). Ordering and improving performance of Monte Carlo Markov chains. Statist. Sci. 16 340–350.
Mathematical Reviews (MathSciNet):
MR1888449
Digital Object Identifier: doi:10.1214/ss/1015346319
Project Euclid: euclid.ss/1015346319
Peskun, P. H. (1973). Optimum Monte-Carlo sampling using Markov chains. Biometrika 60 607–612.
Mathematical Reviews (MathSciNet):
MR362823
Digital Object Identifier: doi:10.1093/biomet/60.3.607
JSTOR: links.jstor.org
Roberts, G. O. and Sahu, S. K. (2001). Approximate predetermined convergence properties of the Gibbs sampler. J. Comput. Graph. Statist. 10 216–229.
Mathematical Reviews (MathSciNet):
MR1939698
Digital Object Identifier: doi:10.1198/10618600152627915
JSTOR: links.jstor.org
