A Markov-chain Monte Carlo sampler targets the unnormalised density on (a Gamma(2,1)…
PHYSICS · Multi-part · Fermi University Physics · Computational Physics · Monte Carlo and lattice simulation of physical systems · Monte Carlo and lattice simulation of physical systems
Error, Chance and the Machine, Ch Markov-chain Monte Carlo
Problem
A Markov-chain Monte Carlo sampler targets the unnormalised density p(x)∝xe−x on x>0 (a Gamma(2,1) shape with its normalising constant omitted, since only ratios of p are needed). Proposed moves are multiplicative: from the current point x the candidate is y=xeZ with Z∼N(0,σ2), so the proposal density is q(y∣x)=yσ2π1exp[−2σ2(lny−lnx)2],y>0. This proposal is asymmetric: q(y∣x)=q(x∣y) in general, because of the leading factor 1/y.
((a)) Starting from detailed balance p(x)K(x,y)=p(y)K(y,x) for the Metropolis-Hastings kernel K(x,y)=q(y∣x)α(x,y) (for y=x), derive the general Metropolis-Hastings acceptance probability α(x,y)=min(1,p(x)q(y∣x)p(y)q(x∣y)).
((b)) Show that for the multiplicative proposal above the ratio q(x∣y)/q(y∣x) reduces to y/x, independent of σ, and hence write α(x,y) for this target and proposal as a function of x and y alone.
((c)) Evaluate the acceptance probability for a move proposed from x=2 to y=3.