Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2026/iii/paper-219/3/b/solution

With and ,
A Random-walk Metropolis algorithm proposes from a symmetric multivariate normal increment, conveniently using logarithmic coordinates for , and accepts with probability
After burn-in, retain a suitably long chain and assess convergence and effective sample size of a Markov chain.

New to topics? Read the docs here!