Convergence in the Wasserstein Metric for Markov Chain Monte Carlo Algorithms with Applications to Image Restoration

References

• Aldous , D. and Diaconis , P. 1987 . Strong uniform times and finite random walks . Adv. Appl. Math. , 8 : 69 – 97 .
   Web of Science ®Google Scholar
• Besag , J. 1986 . On the statistical analysis of dirty pictures, with discussion . J. R. Statist. Soc. B , 48 : 259 – 302 .
   Google Scholar
• Besag , J. , Green , P. , Higdon , D. and Mengerson , K. 1995 . Bayesian computation and stochastic systems . Statist. Sci. , 10 : 3 – 66 .
   Web of Science ®Google Scholar
• Casella , G. , Lavine , M. and Robert , C. 2001 . Explaining the perfect sampler . Am. Statist. , 55 : 299 – 305 . [CROSSREF]
   Web of Science ®Google Scholar
• Cowles , M.K. , Roberts , G.O. and Rosenthal , J.S. 1997 . Possible biases induced by MCMC convergence diagnostics . J. Statist. Comput. Simul. , 64 : 87 – 104 .
   Google Scholar
• Diaconis , P. and Stroock , D. 1991 . Geometric bounds for eigenvalues of Markov chains . Ann. Appl. Probab. , 1 : 36 – 61 .
   Google Scholar
• Dudley , R.M. 1989 . Real Analysis and Probability New York : Chapman and Hall .
   Google Scholar
• Fill , J.A. 1998 . An interruptible algorithm for perfect sampling via Markov chains . Ann. Appl. Probab. , 8 : 131 – 162 . [CROSSREF]
   Web of Science ®Google Scholar
• Fishman , G. 1996 . Monte Carlo: Concepts, Algorithms, and Applications New York : Springer-Verlag .
   Google Scholar
• Gibbs , A.L. 2000 . Bounding the convergence time of the Gibbs sampler in Bayesian image restoration . Biometrika , 87 : 749 – 766 . [CROSSREF]
   Web of Science ®Google Scholar
• Green , P.J. 1996 . “ MCMC in image analysis ” . In Markov Chain Monte Carlo in Practice Edited by: Gilks , W.R. , Richardson , S. and Spiegelhalter , D. J. 381 – 400 . London : Chapman and Hall .
   Google Scholar
• Häggström , O. and Nelander , K. 1999 . On exact simulation of Markov random fields using coupling from the past . Scand. J. Statist. , 26 : 395 – 411 . [CROSSREF]
   Web of Science ®Google Scholar
• Huber , M.L. 1998 . “ Exact sampling and approximate counting techniques ” . In Proceedings of the 30th ACM Symposium on the Theory of Computing 31 – 40 .
   Google Scholar
• Jerrum , M. 1995 . A very simple algorithm for estimating the number of k-colorings of a low-degree graph . Random Structures and Algorithms , 7 : 157 – 165 .
   Web of Science ®Google Scholar
• Jerrum , M. and Sinclair , A. 1993 . Polynomial-time approximation algorithms for the Ising model . SIAM J. Comput. , 22 : 1087 – 1116 . [CSA]
   Web of Science ®Google Scholar
• Luby , M. , Randall , D. and Sinclair , A. 1995 . “ Markov chain algorithms for planar lattice structures (extended abstract) ” . In 36th Annual Symposium on Foundations of Computer Science 150 – 159 .
   Google Scholar
• Martinelli , F. and Olivieri , E. 1994 . Approach to equilibrium of Glauber dynamics in the one phase region I: The attractive case . Comm. Math. Phys. , 161 : 447 – 486 .
   Google Scholar
• Møller , J. 1999 . Perfect simulation of conditionally specified models . J. R. Statist. Soc. B , 61 : 251 – 264 . [CROSSREF]
   Google Scholar
• Murdoch , D.J. and Green , P. J. 1998 . Exact sampling from a continuous state space . Scand. J. Statist. , 25 : 483 – 502 . [CROSSREF]
   Web of Science ®Google Scholar
• Neal , R. Circularly-Coupled Markov Chain Sampling, Technical Report 9910, Department of Statistics, University of Toronto, 1999
   Google Scholar
• Propp , J.G. and Wilson , D. B. 1996 . Exact sampling with coupled Markov chains and applications to statistical mechanics . Random Structures and Algorithms , 9 : 223 – 252 .
   Web of Science ®Google Scholar
• Rachev , S.T. 1991 . Probability Metrics and the Stability of Stochastic Models New York : John Wiley and Sons .
   Google Scholar
• Roberts , G.O. and Rosenthal , J. S. 1999 . Convergence of slice sampler Markov chains . J. R. Statist. Soc. B. , 61 : 643 – 660 . [CROSSREF]
   Google Scholar
• Rosenthal , J.S. 1995 . Minorization conditions and convergence rates for Markov chain Monte Carlo . J. Am. Statist. Assoc. , 90 : 558 – 566 .
   Web of Science ®Google Scholar
• Thisted , R. 1988 . Elements of Statistical Computing New York : Chapman-Hall .
   Google Scholar
• Tierney , L. 1994 . Markov chains for exploring posterior distributions, with discussion . Ann. Statist. , 22 : 1701 – 1762 .
   Web of Science ®Google Scholar
• Tierney , L. 1996 . “ Introduction to general state-space Markov chain theory ” . In Markov Chain Monte Carlo in Practice Edited by: Gilks , W.R. , Richardson , S. and Spiegelhalter , D.J. 59 – 74 . London : Chapman and Hall .
   Google Scholar
• Wilson , D.B. 2000 . “ Layered multishift coupling for use in perfect sampling algorithms (with a primer on CFTP) ” . In Monte Carlo Methods; Vol. 26 of Fields Institute Communications Edited by: Madras , N. Vol. 26 , 141 – 176 . American Mathematical Society .
   Google Scholar