Probability Theory & Statistics
Time limit: 2 hours 30 minutes Total marks: 60 Instructions: Answer all three questions. Full rigour is expected: state theorems used, justify limit interchanges, and give clean derivations. Coding answers may be written in Python/NumPy-style pseudocode but must be executable-precise.
Question 1 — MGFs, CLT and a Monte Carlo estimator (20 marks)
Let be i.i.d. random variables with , i.e. density for .
(a) Derive the moment generating function , stating its domain of convergence. Use it to obtain and . (4)
(b) Let . Prove from MGFs that , and hence write down and . (4)
(c) State the Central Limit Theorem for . Using the MGF (or characteristic function) approach, give a proof sketch that the standardized sum converges to , being explicit about the Taylor expansion step and where the i.i.d. assumption is used. (6)
(d) A colleague estimates for some bounded function by Monte Carlo: . Prove is unbiased and consistent, and show its standard error scales as . Write a short vectorized code snippet that returns and an approximate 95% confidence interval for . (6)
Question 2 — Estimation, information and confidence (20 marks)
Let be i.i.d. .
(a) Write the log-likelihood, derive the MLE , and confirm it via the method of moments. (4)
(b) Show is unbiased. Compute the Fisher information for the sample and state the Cramér–Rao lower bound. Is efficient? Justify. (6)
(c) Using the CLT, derive an approximate confidence interval for based on . Then give the numeric 95% interval when and (use ). (5)
(d) A Bayesian analyst places a prior on (shape , rate ). Derive the posterior distribution, identify the posterior mean, and show it is a weighted average of the prior mean and the MLE. State the limiting behaviour as . (5)
Question 3 — Joint distributions, transformation and regression (20 marks)
Let have joint density and otherwise.
(a) Find , the marginal , and determine whether and are independent. (4)
(b) Compute , , and the correlation . (6)
(c) Let . Using the change-of-variable / convolution technique, derive the density on . Verify it integrates to 1. (5)
(d) In a simple linear regression with i.i.d., derive the least-squares estimators and prove is unbiased. State (no full proof needed) the sampling distribution of used to test . (5)
End of paper.
Answer keyMark scheme & solutions
Question 1
(a) [4] for (integral converges only then). [2] , so . , , hence . [2]
(b) [4] By independence . [2] This is exactly the MGF of (shape , rate ); MGFs uniquely determine distributions, so . [1] Thus , . [1]
(c) [6] CLT statement: with . [2] Sketch: Let , mean 0, variance 1. MGF (from Taylor expansion, using ). [2] By independence the MGF of is , the MGF; convergence of MGFs on a neighbourhood of 0 convergence in distribution (Lévy/continuity theorem). The i.i.d. assumption is used to factor the joint MGF into the -th power and to use a common . [2]
(d) [6] Unbiased: . [1] Consistency: where (bounded ); by WLLN (or Chebyshev) . [2] SE . [1] Code: [2]
import numpy as np
def mc_estimate(g, sampler, N, rng):
x = sampler(N, rng) # draws X_i
vals = g(x) # vectorized g
theta_hat = vals.mean()
se = vals.std(ddof=1)/np.sqrt(N)
ci = (theta_hat - 1.96*se, theta_hat + 1.96*se)
return theta_hat, ciQuestion 2
(a) [4] . [2] . Second derivative so it is a max. [1] MoM: population mean , set equal to sample mean — same. [1]
(b) [6] ⇒ unbiased. [1] Per-observation info: . , , . So and . [3] CRLB . [1] attains the bound ⇒ is efficient (MVUE). [1]
(c) [5] By CLT , and . [1] CI: . [2] Numeric: , SE . Margin . CI . [2]
(d) [5] Posterior likelihood prior . [2] So posterior . [1] Posterior mean — a convex combination of prior mean and MLE . [1] As the weight on , posterior mean (data dominates). [1]
Question 3
(a) [4] . [2] (same form for ). [1] Since , they are not independent. [1]
(b) [6] . [1] ; . [2] . [1] . [1] . [1]
(c) [5] over valid region. For : , integrand ⇒ . [2] For : , length , integrand ⇒ . [2] Check: ✓ [1]
(d) [5] Minimize . Normal equations give , . [2] Unbiasedness: with , . Then . [2] Distribution: ; test via . [1]
[
{"claim":"Exponential MGF gives mean 1/lambda, var 1/lambda^2","code":"t,lam,x=symbols('t lam x',positive=True); M=integrate(lam*exp(-(lam-t)*x),(x,0,oo)); M=simplify(M.rewrite(Piecewise)); Mf=lam/(lam-t); mean=diff(Mf,t).subs(t,0); ex2=diff(Mf,t,2).subs(t,0); var=simplify(ex2-mean**2); result=(simplify(mean-1/lam)==0 and simplify(var-1/lam**2)==0)"},
{"claim":"Poisson 95% CI endpoints ~ (2.190,2.810)","code":"mu=Rational(25,10); se=sqrt(mu/100); lo=float(mu-1.96*se); hi=float(mu+1.96*se); result=(abs(lo-2.190)<0.01 and abs(hi-2.810)<0.01)"},
{"claim":"Joint density: Var(X)=11/144, Cov=-1/144, rho=-1/11","code":"x,y=symbols('x y'); fX=x+Rational(1,2); EX=integrate(x*fX,(x,0,1)); EX2=integrate(x**2*fX,(x,0,1)); VarX=EX2-EX**2; EXY=integrate(integrate(x*y*(x+y),(x,0,1)),(y,