Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 43 3 c Solution Created 2026-10-03 Updated 2026-10-14
The marginal Metropolis–Hastings algorithm avoids storing allocation labels, but each component update changes every mixture likelihood term. Cache component contributions, calculate log-likelihoods stably and tune the proposal scale and random-walk Metropolis efficiency during a pilot run; then fix proposal scales or use a justified adaptive scheme. Means and variances may be strongly dependent, making separate random walks inefficient. Weight proposals must respect the simplex, variance proposals must respect positivity, and the displayed acceptance ratios must retain all relevant priors and proposal corrections.
The augmented Gibbs sampler uses elementary conditionals and typically costs order for a label sweep, followed by sufficient-statistic updates. It avoids Metropolis rejections in these conditional draws, but does not remove slow mixing: ambiguous allocations can lock means, variances and labels into strongly coupled configurations. Empty components must be updated from their priors, not deleted automatically. The proper inverse-gamma scale suppresses arbitrarily small variances even though an unregularized Gaussian-mixture likelihood can be singular.
With exchangeable component priors, label switching creates equivalent posterior modes. Ordering component means is an identification constraint, not an innocuous change unless the intended inferential model is made explicit. Predictive density and permutation-invariant summaries avoid arbitrary labelling; component-specific summaries require an appropriate relabelling convention. If the Dirichlet parameters differ between components, exact label symmetry may be broken, but substantial multimodality can remain.
Use dispersed initial states, multiple chains and diagnostics on several scientifically relevant functions. Report effective sample size of a Markov chain and Monte Carlo error estimates, not just a large iteration count. Burn-in can reduce initialization bias but does not prove convergence; thinning cannot by itself cure poor exploration. Closed-form Gibbs updates simplify computation, while reliable inference still requires adequate exploration of the posterior.
Past exam of the mathematics course of the University of Cambridge 2010 iii Paper 36 4 f Solution Created 2026-10-03 Updated 2026-10-14
The PDF output places inside the 95% credible interval for the time slope, whose endpoints are approximately and , and places inside the baseline slope interval, approximately to . Relative to their posterior standard deviations, the proposed fixed values are onlyfrom the posterior means. Thus the simpler choice is compatible with the fitted coefficient summaries and has a natural proportional-decay interpretation. It is a reasonable constrained model to compare, not proof of the exact equalities: separate marginal intervals do not establish a joint constraint, and a continuous posterior distribution assigns a specified point probability zero.
The reported Monte Carlo errors measure numerical uncertainty in the estimated posterior means, not uncertainty about the coefficients themselves. In particular, the baseline slope's Monte Carlo error is about 9% of its posterior standard deviation, appreciably larger than the corresponding proportion for the time slope. Longer or better-mixed chains may be needed for precise summaries.
Past exam of the mathematics course of the University of Cambridge 2010 iii Paper 36 4 g Solution Created 2026-10-03 Updated 2026-10-14
The reported deviance information criterion differs byModel 3 has a mean Bayesian deviance worse by only , but its effective parameter count in DIC is lower by . The small fit cost is more than offset by the reduced complexity penalty, so the criterion gives a mild preference to Model 3. A difference this small should not be presented as decisive evidence, especially without the Monte Carlo error of the criterion difference.
The counts and are effective rather than literal parameter numbers. The likelihood includes child-specific intercepts and uncertain true baselines as well as global coefficients. With 106 of each local quantity and seven global parameters, Model 2 has 219 stochastic unknowns in a natural full representation, but partial pooling and other prior information reduce their effective contribution. Fixing two slopes lowers the effective count by about two, with a further small change from the fitted posterior. There is no reason for to be an integer, or to equal just the number of population-level regression coefficients.
For illustration, the deviances evaluated at posterior means implied by the table are for Model 2 and for Model 3. These differ from the average deviances because averaging a nonlinear deviance is not the same as evaluating it at an averaged parameter. This interpretation presumes the same observed-data likelihood convention in both fits; integrating local variables out before forming the deviance would define a different comparison. The DIC difference is not a Bayes factor.
Past exam of the mathematics course of the University of Cambridge 2024 iii Paper 218 1 d Solution Created 2026-09-24 Updated 2026-09-25
The variance approaches the Poisson distribution variance when . Equivalently, with , the Poisson model is the boundary value . The usual Wilks theorem for a likelihood-ratio test assumes that the null parameter is an interior point of a smooth parameter space, so comparing the statistic with an ordinary law is invalid here.
A valid parametric bootstrap proceeds as follows. First fit the null Poisson model and retain its fitted means . For each bootstrap repetition , independently simulateusing the original doses, refit both the Poisson and negative-binomial models to that simulated data, and calculateFor the observations calculate the analogous . The bootstrap -valueuses the null distribution with its boundary and finite-sample fitting behaviour automatically reproduced. A large controls the Monte Carlo error of this estimate.