Advanced search
Publication Cover
Journal of Statistical Computation and Simulation Volume 77, 2007 - Issue 10
Submit an article Journal homepage
69
Views
2
CrossRef citations to date
0
Altmetric
Original Articles

An upper bound on the convergence time of the Gibbs sampler in Ising models

Yuichi Shiraishi Department of Statistical Science, The Institute of Statistical Mathematics, The Graduate University for Advanced Studies, Minami-Azabu, Tokyo, 10-8569, JapanView further author information
Pages 839-850 | Published online: 18 Sep 2007

References

  • Cowles , M. K. and Carlin , B. P. 1996 . Markov chain Monte Carlo convergence diagnostics: a comparative review . Journal of the American Statistical Association , 91 : 883 – 904 .
  • Rosenthal , J. S. 1995 . Minorization conditions and convergence rates for Markov chain Monte Carlo . Journal of the American Statistical Association , 90 : 558 – 566 .
  • Frigessi , A. , Martinelli , F. and Stander , A. 1997 . Computational complexity of Markov chain Monte Carlo methods for finite Markov random fields . Biometrika , 84 : 1 – 18 .
  • Gibbs , A. L. 2000 . Bounding the convergence time of the Gibbs sampler in Bayesian image restoration . Biometrika , 87 : 749 – 766 .
  • Luby , M. , Randall , D. and Sinclair , A. 2001 . Markov chain algorithms for planar lattice structures . SIAM Journal on Computing , 31 : 167 – 192 .
  • Häggström , O. and Nelander , K. 1999 . On exact simulation of Markov random fields using coupling from the past . Scandinavian Journal of Statistics , 26 : 395 – 411 .
  • Gibbs , A. L. 2004 . Convergence in the Wasserstein metric for Markov chain Monte Carlo algorithms with applications to image restoration . Stochastic Models , 20 : 473 – 492 .
  • Amit , A. and Grenander , U. 1991 . Comparing sweep strategies for stochastic relaxation . Journal of Multivariate Analysis , 37 : 82 – 100 .
  • Fishman , G. S. 1996 . Coordinate selection rules for Gibbs sampling . Annals of Applied Probability , 6 : 444 – 465 .
  • Jerrum , M. 1995 . A very simple algorithm for estimating the number of k-colourings of a low-degree graph . SIAM Journal on Computing , 22 : 1087 – 1116 .
  • Huber , M. 2004 . Perfect sampling using bounding chains . Annals of Applied Probability , 14 ( 2 ) : 734 – 753 .
  • Rosenthal , J. S. 1997 . Faithful coupling of Markov chains: now equals forever . Advances in Applied Mathematics , 18 : 372 – 381 .
  • Aldous , D. 1983 . “ Random walks on finite groups and rapidly mixing Markov chains ” . In Séminarie de Probabilitiés XVII 1981/1982 , Edited by: Azema , J. and Yor , M. Vol. 986 , 243 – 297 . New York : Springer-Verlag . Lecture Notes in Mathematics
  • Durrett , R. 1996 . Probability: Theory and Examples , 2nd , Belmont, CA : Wadsworth and Brooks/Cole .
  • 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 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.