Skip to main content
SpringerLink
Log in

Markov chain Monte Carlo

1. Examples

  • General Article
  • Published:
Resonance Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Suggested Reading

  1. S Chib and E Greenberg, Understanding the Metropolis-Hastings algorithm,The American Statistician, Vol. 49, pp. 327–335, 1995.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Statistics, Stanford University, California, USA

    Arnab Chakraborty

Authors
  1. Arnab Chakraborty
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Arnab Chakraborty did his BStat (Hons.) and MStat degrees from the Indian Statistical Institute (Calcutta). He is now a PhD student in the Department of Statistics at Stanford University, California. His research interest lies in areas of statistics and computational algebra. Apart from that he is interested in playing the piano and wishes he could really play well.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chakraborty, A. Markov chain Monte Carlo. Reson 7, 25–34 (2002). https://doi.org/10.1007/BF02896305

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02896305

Key words

Search

Navigation