Coordinate selection rules for Gibbs sampling

Annals of Applied Probability

Volumn 6, Issue 2, 1996, Pages 444-465

  Fishman, George S ^a  

^a University of North Carolina at Chapel Hill   (United States)

Author keywords

Coordinate selection; Gibbs sampling; Markov random field; Monte Carlo

Indexed keywords

EID: 0030518377     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/aoap/1034968139     Document Type: Article

References (19)

1. AMIT, Y. (1991). On rates of convergence of stochastic relaxation for Gaussian and non-Gaussian distributions. J. Multivariate Anal. 38 82-89.
2. AMIT, Y. and GRENANDER, U. (1989). Comparing sweeping strategies for stochastic relaxation. J. Multivariate Anal. 37 197-222.
3. BARONE, P. and FRIGESSI, A. (1990). Improving stochastic relaxation for Gaussian random fields. Problems in the Informational Sciences 4 369-389.
4. FAN, K. (1949). On a theorem of Weyl concerning eigenvalues of linear transformations. I. Proc. Nat. Acad. Sci. U.S.A. 35 652-655.
5. FAN, K. and HOFFMAN, A. (1955). Some metric inequalities in the space of matrices. Proc. Amer. Math. Soc. 6 111-116.
6. FISHMAN, G. S. (1994). Coordinate selection rules for Gibbs sampling. Report UNC/OR TR-92/15, Operations Research Dept., Univ. North Carolina at Chapel Hill.
7. FRIGESSI, A., HWANG, C.-R., SHEU, S.-J. and DI STEFANO, P. (1993). Convergence rates of the Gibbs sampler, Metropolis algorithm and other single-site updating dynamics. J. Roy. Statist. Soc. Ser. B 55 205-219.
8. GELFAND, A. E. and SMITH, A. F. M. (1990). Sample-based approaches to calculating marginal densities. J. Amer. Statist. Assoc. 85 398-409.
9. HORN, R. A. and JOHNSON, C. A. (1985). Matrix Analysis. Cambridge Univ. Press.
10. JOHNSON, V. (1989). On statistical image reconstruction. Ph.D. dissertation, Dept. Statistics, Univ. Chicago.
11. KEMENY, J. G. and SNELL, J. L. (1960). Finite Markov Chains. Van Nostrand, New York.
12. LIU, J., WONG, W. H. and KONG, A. (1994). Covariance structure of the Gibbs sampler with applications to the comparison of estimators and augmentation schemes. Biometrika 81 27-40.
13. LIU, J., WONG, W. H. and KONG, A. (1995). Covariance structure and convergence rate of the Gibbs sampler with various scans. J. Roy. Statist. Soc. Ser. B 57 157-169.
14. MACEACHERN, S. and BERLINER, L. M. (1994). Subsampling the Gibbs sampler. Amer. Statist. 48 188-190.
15. MARCUS, M. and MINC, H. (1964). A Survey of Matrix Theory and Matrix Inequalities. Allyn and Bacon, Boston.
16. MARSHALL, A. W. and OLKIN, I. (1979). Inequalities: Theory of Majorization and Its Applications. Academic Press, New York.
17. ROBERTS, G. O. and POLSON, N. G. (1991). A note on the geometric convergence of the Gibbs sampler. Dept. Mathematics, Univ. Nottingham.
18. ROBERTS, G. O. and SMITH, A. F. M. (1992). Simple conditions for the convergence of the Gibbs sampler and Metropolis-Hastings algorithms. Research Report 92-30, Statistical Laboratory, Univ. Cambridge.
19. SCHERVISH, M. J. and CARLIN, B. P. (1993). On the convergence of successive substitution sampling. Dept. Statistics, Carnegie Mellon Univ.