Markov Chain Monte Carlo Sampling (MCMC)

Marcel van Oijen

Chapter Chapter 6 in Bayesian Compendium, 2024, pp 35-40 from Springer

Abstract: Abstract The Bayesian approach to parameter estimation requires modellers to make a major mental shift: we no longer aim to find a single ‘best’ parameter vector—instead we aim to determine the posterior probability distribution for the parameters. Only the full probability distribution adequately represents our state of knowledge. Although this shift in thinking has made rigorous uncertainty quantification possible, it has also created computational problems. When models have many parameters, the distribution will be high-dimensional and may not be available in closed form, i.e. we cannot derive a formula for it. Often, all we can do is generate a sample from the distribution, and even that can be difficult. A solution for the problem of sampling from probability distributions that are not in closed form was provided by Metropolis et al. (J Chem Phys 21:1087–1092, 1953). They introduced the so-called Markov Chain Monte Carlo (MCMC) method. MCMC is the workhorse of computational Bayesian statistics, and by now, many different MCMC algorithms exist.

Date: 2024
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-031-66085-6_6

Ordering information: This item can be ordered from
http://www.springer.com/9783031660856

DOI: 10.1007/978-3-031-66085-6_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().