STAT 330 October 4, 2012

Here is the next problem set, due on Thursday, October 11.

Today we spent some time discussing Markov chains and stationary distributions. It is our goal to simulate a sample by constructing our Markov chain so that we approach the stationary distribution (hopefully rapidly).

We then looked at a simple Metropolis-Hastings MCMC sampler for generating a sample from a standard normal distribution. The code is in the charts. We saw how varying the proposal distribution’s width can affect the samples: Too narrow, and although the acceptance rated is high, it takes a long time for the sampler to get anywhere because successive samples are highly correlated; too broad and the acceptance rate goes way down to the point where the sampler hardly moves at all. Something in the middle works best. We also saw that if we start very far away from the peak of the distribution, it takes a while for the program, which is “hill-climbing”, to get to where there is a significant amount of probability. This is why people frequently discard the first part of the Markov chain as “burn-in”

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s


%d bloggers like this: