Markov chain Monte Carlo (MCMC) draws from a density known up to a constant by running a Markov chain whose stationary distribution is . The Metropolis–Hastings algorithm proposes from the current state and accepts it with probability , staying at otherwise; with a symmetric random-walk proposal the ratio is . The Gibbs sampler updates one block of coordinates at a time by a draw from its conditional law given the others.
Quantitative Finance · المسرد
ما معنى Markov chain Monte Carlo, Metropolis–Hastings, Gibbs sampler؟
يُعرف أيضًا باسم: Markov chain Monte Carlo · Metropolis--Hastings algorithm · Gibbs sampler