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−xp(x) \propto x e^{-x} on x>0x>0 (a Gamma(2,1) shape with its normalising constant omitted, since only ratios of pp are needed). Proposed moves are multiplicative: from the current point xx the candidate is y=xeZy = x e^{Z} with Z∼N(0,σ2)Z \sim \mathcal{N}(0,\sigma^2), so the proposal density is q(y∣x)=1yσ2πexp⁡[−(ln⁡y−ln⁡x)22σ2],y>0.q(y\mid x) = \frac{1}{y\sigma\sqrt{2\pi}}\exp\left[-\frac{(\ln y - \ln x)^2}{2\sigma^2}\right], \qquad y>0. This proposal is asymmetric: q(y∣x)≠q(x∣y)q(y\mid x) \ne q(x\mid y) in general, because of the leading factor 1/y1/y. ((a)) Starting from detailed balance p(x)K(x,y)=p(y)K(y,x)p(x)K(x,y) = p(y)K(y,x) for the Metropolis-Hastings kernel K(x,y)=q(y∣x) α(x,y)K(x,y) = q(y\mid x)\,\alpha(x,y) (for y≠xy \ne x), derive the general Metropolis-Hastings acceptance probability α(x,y)=min⁡(1,p(y) q(x∣y)p(x) q(y∣x)).\alpha(x,y) = \min\left(1, \frac{p(y)\,q(x\mid y)}{p(x)\,q(y\mid x)}\right). ((b)) Show that for the multiplicative proposal above the ratio q(x∣y)/q(y∣x)q(x\mid y)/q(y\mid x) reduces to y/xy/x, independent of σ\sigma, and hence write α(x,y)\alpha(x,y) for this target and proposal as a function of xx and yy alone. ((c)) Evaluate the acceptance probability for a move proposed from x=2x=2 to y=3y=3.

Browse the problem library