Skip to main content

The Metropolis—Hastings Algorithm

  • Chapter
Monte Carlo Statistical Methods

Part of the book series: Springer Texts in Statistics ((STS))

Abstract

It was shown in Chapter 3 that it is not necessary to use a sample from the distribution f to approximate the integral

$$ \int {h(x)f(x)dx,} $$

since importance sampling techniques can be used.

“What’s changed, except what needed changing?” And there was something in that, Cadfael reflected. What was changed was the replacement of falsity by truth…

—Ellis Peter, The Confession of Brother Haluin

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 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer Science+Business Media New York

About this chapter

Cite this chapter

Robert, C.P., Casella, G. (1999). The Metropolis—Hastings Algorithm. In: Monte Carlo Statistical Methods. Springer Texts in Statistics. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3071-5_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-3071-5_6

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4757-3073-9

  • Online ISBN: 978-1-4757-3071-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics