Segment 39. MCMC and Gibbs Sampling

Watch this segment

(Don't worry, what you see statically below is not the beginning of the segment. Press the play button to start at the beginning.)

{{#widget:Iframe |url=http://www.youtube.com/v/4gNpgSPal_8&hd=1 |width=800 |height=625 |border=0 }}

Links to the slides: PDF file or PowerPoint file

To Calculate

1. Suppose the domain of a model are the five integers , and that your proposal distribution is: "When , choose with equal probability . For always choose . For always choose . What is the ratio of 's that goes into the acceptance probability for all the possible values of and ?

2. Suppose the domain of a model is and your proposal distribution is (perversely),

Sketch this distribution as a function of . Then, write down an expression for the ratio of 's that goes into the acceptance probability .

1. Suppose an urn contains 7 large orange balls, 3 medium purple balls, and 5 small green balls. When balls are drawn randomly, the larger ones are more likely to be drawn, in the proportions large:medium:small = 6:4:3. You want to draw exactly 6 balls, one at a time without replacement. How would you use Gibbs sampling to learn: (a) How often do you get 4 orange plus 2 of the same (non-orange) color? (b) What is the expectation (mean) of the product of the number of purple and number of green balls drawn?

2. How would you do the same problem computationally but without Gibbs sampling?

3. How would you do the same problem non-stochastically (e.g., obtain answers to 12 significant figures)? (Hint: This is known as the Wallenius non-central hypergeometric distribution.)