the metropolis-hastings algorithm is a widely applicable procedure for drawing samples from a specified distribution on a large finite set. the talk will describe the metropolis-hastings algorithm and some of its properties. there will be a discussion of some of the applications and an example.