Chapter 11: Introduction to MCMC
Once the problems get to a sufficient complexity, the analytical tools and approximations we have employed in previous chapters will no longer work well. In those cases, we turn to simulation techniques, one of which is Markov Chain Monte Carlo (MCMC). It is well beyond this book to talk about the details of this process, but the basic process is the following.
We start with a model of the system, such as the bent coin model in Section 6.4. In that system, we try to estimate the probability that a particular doing will flip heads, quantified by the parameter which can take on values from (i.e. a coin which only flips tails) through (i.e. a “fair” coin which flips tails and heads equally) up to (i.e. a coin which only flips heads). Our data consists of a total number of flips, , and how many are heads, . Although this problem can be done analytically, it is instructive to walk through the solved problem with the new method before looking at more complex models.
MCMC proceeds, roughly, with the following steps
Adapted from Statistical Inference for Everyone, by Brian Blais (Bryant University), licensed under CC BY-SA 4.0 (dual-licensed under the GNU FDL 1.2 or later; this adaptation uses the CC BY-SA grant). Changes were made; this adaptation is distributed under the same license. License: CC-BY-SA-4.0.