Monte Carlo, Markov Chains, Metropolis Hastings.
given data, written as: p(θ|data). It can be calculated using prior and likelihood. p(data) is not associated with parameter-θ, we can think it as a constant, and simplify this equation into: Metropolis hasting The accept and reject rule of Metropolis hasting is: Coin Toss Experiment The algorithm