Inverse Gaussian mean estimation 2026-10-25
For an independent statistical sample from an Inverse Gaussian distribution with mean and known shape , the maximum-likelihood estimator of is the sample mean. To prove this, expand the log-likelihood function to get . Its score function is , positive below and negative above it. Taking the negative expected second derivative gives one-observation Fisher information . Thus the regular asymptotic normality of a maximum likelihood estimator yields . The same conclusion follows from the central limit theorem and the distribution's variance .
Inverse Gaussian shape estimation and nuisance orthogonality Created 2026-10-14 Updated 2026-10-25
For the Inverse Gaussian distribution parametrized by shape and mean , the joint maximum-likelihood estimators are and . With known , the shape estimator is instead . Parameter orthogonality gives the same Wald test formula in both fits. The two estimators differ by under regular model sampling, so the test statistics agree to first order under the null; they need not be numerically equal in finite samples.
Inverse Gaussian sum closure 2026-10-14
In the parametrization with density proportional to , the Inverse Gaussian distribution has cumulant-generating function . For independent copies, the average has this same family with parameters , while the sum has parameters . These assertions follow by multiplying moment-generating functions and scaling the density. The more usual mean parameter is , so the sum has mean and shape .
For independent Inverse Gaussian distributions with shape and mean , the constrained and full nuisance maximum-likelihood estimates both equal , giving a unit sample-coordinate Jacobian determinant. The nuisance observed information there is . Hence subtracting half its logarithm from the profile log-likelihood replaces the coefficient of by . For a nonconstant sample the modified fit is .
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 32 2 Solution Created 2026-10-03 Updated 2026-10-14
Partition the statistical parameter as , with of interest. For each fixed , maximize over the nuisance parameter to obtain . The profile likelihood and profile log-likelihood areTheir maximizer is the interest component of the joint maximum-likelihood estimator. At a regular nuisance maximum, and its negative Hessian matrix is the Schur complementThe profile likelihood ratio is unchanged by a one-to-one nuisance reparametrization, and transforms naturally under a one-to-one interest reparametrization. Under the regular conditions of Wilks theorem, has a limiting chi-squared distribution with dimension of degrees of freedom. Profiling is maximization, rather than integration or conditioning; need not be a normalized data density, and nuisance fitting can cause appreciable higher-order distortion.
The modified profile likelihood corrects for nuisance curvature and sample-coordinate distortion. In suitable coordinates , with an ancillary statistic, setholding fixed when differentiating the data coordinates. Up to an interest-independent factor, the Barndorff-Nielsen modified profile likelihood isEquivalently, implicit differentiation of the nuisance score equation gives , andThe semicolon denotes sample-coordinate differentiation, not a second parameter derivative. In orthogonal coordinates, the Cox-Reid adjusted profile likelihood uses the information adjustment alone; it agrees with this modification when , as happens below.
For the Inverse Gaussian distribution, write , and . Terms independent of both parameters can be absorbed into , givingThe nuisance score function isIt is positive below and negative above it. Thus its global maximum isindependent of . Put . ThenThe nuisance observed information at this fit isSince the constrained nuisance estimator is literally the full nuisance estimator as a function of the data, in the specified sample coordinates. Hence the modified profile likelihood for inverse Gaussian shape isFor and a nonconstant positive sample, the Cauchy-Schwarz inequality gives . The corresponding fits are and . A constant sample has and no finite profile maximum; under continuous independent sampling this event has probability zero when . In particular, the modified coefficient accounts for the fitted mean nuisance parameter.
Past exam of the mathematics course of the University of Cambridge 2006 iii Paper 42 2 Solution Created 2026-10-03 Updated 2026-10-20
Write and for the individual and total score functions. Under the usual regularity assumptions, and , the nonsingular per-observation Fisher information matrix. The central limit theorem and weak law of large numbers giveRearranging the stipulated score expansion, including its remainder, givesSlutsky theorem therefore proves the asymptotic normality of a maximum likelihood estimator:A consistent plug-in Fisher information matrix yields the Wald statistic . Under the null hypothesis, , so a test of asymptotic size rejects when exceeds the quantile of that chi-squared distribution. A consistent observed Fisher information matrix gives the same limiting test.
With an -dimensional parameter of interest and nuisance parameter , partition accordingly. The marginal asymptotic covariance matrix of is the block of , whose inverse is the efficient informationThus the nuisance-adjusted Wald statistic is , with limiting null distribution . Using alone is generally incorrect when the nuisance parameter is estimated; it is valid when the cross-information vanishes.
For the Inverse Gaussian distribution in this problem, expand the exponent to obtain the log likelihood, up to terms independent of both parameters,Its score functions areFor each positive , the first score changes sign from positive to negative at , so this is the global maximizing mean parameter of an exponential family. Substituting it in the second score givesThe reciprocal function is strictly convex, so the denominator is positive for a nonconstant sample. The profile log likelihood is strictly concave in and tends to minus infinity at both endpoints, proving this is a maximum. Under continuous model sampling, a sample of size at least two is nonconstant almost surely. For a constant sample, including a one-observation sample, no finite joint maximum-likelihood estimator exists: the likelihood increases without bound as at .
For one observation, differentiating again and using givesThis parameter orthogonality proves that estimating does not reduce the efficient information for . The Wald statistic has the same algebraic form in the two cases:Using information evaluated at instead is another first-order equivalent convention.
The printed claim of coincidence needs a first-order interpretation. Known and unknown need not give numerically identical Wald statistics, because their maximum-likelihood estimators differ. With known, direct maximization givesFor example, observations and known give and . At , the displayed Wald convention gives and , respectively. Thus exact equality is false. Under the null hypothesis, however, , hence . Their centered, standardized estimates differ by , so their Wald statistics differ by . This is the valid asymptotic coincidence supplied by inverse Gaussian shape estimation and nuisance orthogonality.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 44 2 Solution Created 2026-10-03 Updated 2026-10-14
Write for the cumulant-generating function in the question's parametrization. Multiplying the density by replaces in the decaying part of its exponent by . For , the remaining integral is the normalizing integral for an Inverse Gaussian distribution with parameters . Comparing the two normalizing constants givesIn particular , so the mean parameter used in the more usual Inverse Gaussian distribution notation is ; it must not be confused with the present parameter .
First compute the cumulant-generating function of the sample average, as requested. Independence givesThis is exactly the cumulant-generating function of an Inverse Gaussian distribution with parameters . The uniqueness theorem for moment-generating functions therefore identifies that law. Scaling and including the density Jacobian givesEquivalently, the inverse Gaussian sum closure is in the parametrization of this question. Its mean is and its variance is , in agreement with addition of independent means and variances.
For a general continuous iid sample with cumulant-generating function , finite near zero, set and choose a real saddle in the interior of the finite moment domain satisfying . With , the saddlepoint density approximation for the sum isUnder the usual smooth nonlattice conditions, at a fixed interior the true density has this leading expression times . This is a relative density approximation; the leading expression is not automatically an exactly normalized probability density in every model.
One way to understand the statistical saddlepoint approximation is through exponential tilting. The tilted one-observation density is , with mean and variance . Undoing this tilt for the sum multiplies its tilted density at by . At , is exactly the tilted mean of the sum. A local version of the central limit theorem gives tilted density there approximately . Multiplying these two factors gives the displayed saddlepoint density approximation. Higher local expansion terms produce the stated relative error order.
For the Inverse Gaussian distribution, differentiation givesThus for every the saddle exists, withAt this saddle,Substitution into the saddlepoint density approximation gives precisely the exact density already found for . ThereforeThis exact saddlepoint density of an inverse Gaussian sum is stronger than a relative claim: the leading formula is exact and needs no renormalization.
For the final distribution, both tails decay polynomially. Any positive exponential tilt makes the positive tail nonintegrable, and any negative tilt makes the negative tail nonintegrable. Its moment-generating function is therefore infinite away from zero, leaving no open interval on which to form the cumulant-generating function and solve a saddle equation. Here polynomial tails prevent exponential tilting, so the conventional saddlepoint density approximation is unavailable. A finite mean and variance, and even an ordinary central limit theorem, do not supply the missing exponential moments.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 38 3 iv Solution Created 2026-10-03 Updated 2026-10-07
For , the corresponding smaller root is . The conditional probability of selecting the larger root isIt is the same weight as a function of the actual selected value . HenceCombining the two open intervals proves the output has the Inverse Gaussian distribution . The event has probability zero, so no atom occurs at ; the limiting density there is finite. The algorithm always selects one of its positive roots, so these branch densities exhaust its probability distribution.
Past exam of the mathematics course of the University of Cambridge 2021 ii Paper 1 5J Solution Created 2026-09-24 Updated 2026-09-25
Expand the exponent in the Inverse Gaussian distribution with unit shape parameter:Consequently its probability density function can be written aswhereIndeed, . This is the canonical form of a one-parameter exponential family, and its natural parameter is therefore
Past exam of the mathematics course of the University of Cambridge 2026 iii Paper 218 1 a Solution Created 2026-09-24 Updated 2026-10-03
Expanding the exponent of the Inverse Gaussian distribution givesThus the exponential dispersion family representationhasandThe standard cumulant identities yieldHence the variance function is , and the canonical link function is .
Expanding the exponent, the log-likelihood function iswhere is independent of . Its score function and second derivative areThe first is positive below and negative above it, so the unique maximum-likelihood estimator isUsing , the one-observation Fisher information is . The support does not depend on the interior parameter , and the regular asymptotic normality of a maximum likelihood estimator givesThis is Inverse Gaussian mean estimation with known shape one. Equivalently, the Inverse Gaussian distribution has variance , so the same result follows directly from the central limit theorem applied to its sample mean.