Markov Chains, Data Science.
Metropolis Hasting Algorithm MCMC taps on the metropolis hasting algorithm when sampling from the distribution. The metropolis hasting method addresses this issue by using proposal distribution Q that depend on the current state. A simple example is for a given state x, the proposal can be a