Skip to main content

A Comparison of Simulated Annealing of Gibbs Sampler and Metropolis Algorithms

  • Conference paper
Stochastic Models, Statistical Methods, and Algorithms in Image Analysis

Part of the book series: Lecture Notes in Statistics ((LNS,volume 74))

Abstract

We prove that Gibbs sampler and Metropolis algorithm are asymptotically equivalent in annealing for lattices. They are not equivalent in general if there is no lattice structure of the state space.

Work done while the author was at the Center for Stochastic Processes. He is grateful for their hospitality.

Partially supported by National Science Council, Taiwan and the Air Force Office of Scientific Research Contract No. F49620 85C 0144.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Azencott (1989), Simulated annealing, Seminaire Bourbaki, 1987–88, no. 697.

    Google Scholar 

  2. O. Catoni (1988), Grandes déviations et décroissance de la temperature dans les algorithmes de recuit, C.R. Acad. Sci. Paris, t. 307, Serie I, 535–539.

    Google Scholar 

  3. T.-S. Chiang, Y. Chow (1989), A limit theorem for a class of inhomogeneous Markov processes, Ann. Probab. 17, 1483–1502.

    Article  MathSciNet  MATH  Google Scholar 

  4. T.-S. Chiang, Y. Chow (1990), Asymptotic behavior of eigenvalues and random updating schemes. Center for Stochastic Processes, University of North Carolina Technical Report No. 307.

    Google Scholar 

  5. A. Frigessi, C.R. Hwang, S.J. Sheu, P. Stefano (1990), On the Gibbs sampler, the Metropolis algorithm and other single-site updating dynamics, preprint.

    Google Scholar 

  6. S. Geman, D. Geman (1984), Stochastic relaxation, Gibbs distribution, and the Beysian restoration of images, IEEE Trans. Pattern Analysis and Machine Intelligence 6, 721–741.

    Article  MATH  Google Scholar 

  7. B. Hajek (1985), Cooling schedules for optimal annealing, Math. Oper. Res. 13, 311–329.

    Article  MathSciNet  Google Scholar 

  8. C.-R. Hwang, S.-J. Sheu (1988), Singular perturbed Markov chains and exact behaviors of simulated annealing process, Technical Report, Institute of Math., Academia Sinica.

    Google Scholar 

  9. P.M. van Laarhoven, E.H.L. Aarts (1987), Simulated Annealing: Theory and Applications, D. Reidel, Dordrecht.

    Google Scholar 

  10. D. Mitra, F. Romeo, A. Sangiovanni-Vincentelli (1986), Convergence and finite time behavior of simulated annealing, Adv. Appl. Prob. 18, 747–771.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tzuu-Shuh, C., Yunshyong, C. (1992). A Comparison of Simulated Annealing of Gibbs Sampler and Metropolis Algorithms. In: Barone, P., Frigessi, A., Piccioni, M. (eds) Stochastic Models, Statistical Methods, and Algorithms in Image Analysis. Lecture Notes in Statistics, vol 74. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2920-9_7

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-2920-9_7

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97810-9

  • Online ISBN: 978-1-4612-2920-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics