Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 40 2 a i Solution Created 2026-10-03 Updated 2026-10-14
Assume independent samples , , and wherever can contribute. The importance weight is , and the ordinary importance sampling estimator isIts expectation is , by cancellation of in the expectation integral. The strong law of large numbers gives almost-sure convergence to . Common probability support is sufficient; the precise support condition for importance sampling only requires covering the nonzero integrand for this particular expectation.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 40 2 b iv Solution Created 2026-10-03 Updated 2026-10-14
For , the indicator is always one, and the importance weight reduces toAveraging these independent contributions givesAs a direct normalization check, its expectation is . For this equals , the exact standard Cauchy distribution tail probability. The substitution , rather than with the same symbol left unchanged, explains why the displayed denominator contains .
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 40 4 i Solution Created 2026-10-03 Updated 2026-10-14
Assume the draws are independent from , that the target-weighted integrand is covered by its support, and that . Define the importance weight . The change-of-density identity isTherefore importance sampling uses the unbiased estimatorThe strong law of large numbers gives consistency. A finite second moment of the weighted integrand additionally gives finite variance and a usual independent-sample central limit theorem. A useful proposal places enough probability where is large and avoids tiny proposal probability density function there; common support alone does not guarantee finite variance.
Past exam of the mathematics course of the University of Cambridge 2023 iii Paper 216 2 c Solution 2026-09-28
Let be the importance weight. The two normalized densities giveSince , there is a finite constant such that everywhere. The Independence Metropolis–Hastings algorithm has an accepted transition density satisfyingConsequently the whole state space is a small set, with the one-step minorization condition . Iterating this Doeblin condition gives uniform geometric convergence in total variation distance, so the chain is geometrically ergodic.