Metropolis-Hastings alogrithm is a Markov chain Monte Carlo method for
obtaining a sequence of random samples from a probability distribution
for which direct sampling is difficult. Thi sequence can be used to
approximate the distribution.