Key renewal theorem Created 2026-10-06 Updated 2026-11-05
For positive nonarithmetic interarrival times with law and mean , let be their renewal measure. If is directly Riemann integrable, then , with . Thus a locally bounded solution of has this limit through its renewal representation. Arithmetic laws require the corresponding lattice version.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 41 3 Solution Created 2026-10-03 Updated 2026-10-14
For nontrivial positive claim sizes in the classical risk model and , the adjustment coefficient is the unique positive solutionIndeed, has , , and is strictly convex. It becomes positive near the right endpoint of the moment-generating function domain. For a finite endpoint this follows from the assumed divergence; for an infinite endpoint, for some gives an exponential lower bound on , which eventually exceeds any linear function. Convexity gives existence and uniqueness of the positive crossing and .
Put and . Substituting into the supplied survival renewal equation for a classical risk model, and using , yieldsMultiplying by gives the proper renewal-type equationThe exponential tilt of the ruin renewal kernel turns a defective kernel into a probability density function, because the tail integration identity givesThis identity follows also by integrating and applying Tonelli theorem. The tilted probability density function defines a nonarithmetic distribution, even if the claim size probability distribution itself has atoms.
Differentiate to calculate its mean:It is finite and positive because is inside the finite moment-generating function domain. Next, reversing the order of integration givesThe forcing function is directly Riemann integrable. Choose with . Markov's inequality bounds by , so is bounded by a constant times . It is continuous; on finite intervals continuity controls its Riemann sums, and the exponential envelope controls the tails. These are sufficient conditions for direct Riemann integrability.
Iterating the renewal equation by convolution gives , where is the renewal measure. The remainder after iterations is bounded on each fixed interval by a constant times the chance that a sum of positive interarrivals remains in that interval, which tends to zero. The key renewal theorem, applicable to this nonarithmetic distribution of finite mean and the directly integrable forcing, now gives the interior adjustment coefficient ruin prefactor:Both numerator and denominator are positive, so .
For the unit-rate shape-two Erlang distribution, , and . Write , so positive loading requires . Dividing the adjustment coefficient equation by its nonzero root gives . ThusThe last simplification uses ; it is the Erlang shape-two ruin prefactor. Its value depends on the premium-to-arrival ratio, which is not specified numerically.
For the final exponential representation, evaluating at zero in the survival renewal equation for a classical risk model gives . If the slower term is present, necessarily and . Comparing with the finite positive asymptotic constant just proved yieldsA smaller adjustment coefficient would make the limit zero and a larger one would make it infinite. Here the leading exponential term determines a ruin adjustment coefficient. The coefficient need not be assumed positive to identify the leading term.
The wording does not specify that is nonzero. If and , the only surviving term instead gives , and . This case is realizable: claims with an exponential distribution of rate have ultimate ruin probability . Negative would make the ultimate ruin probability negative for large , and both coefficients zero are incompatible with a nontrivial positive claim rate and mean. These observations specify the coefficient qualification needed for the usual answer.
Past exam of the mathematics course of the University of Cambridge 2005 ii Paper 2 26I Solution Created 2026-09-24 Updated 2026-10-14
A renewal process counts arrivals , where and the holding times are independent, identically distributed positive random variables. Their sum tends to infinity almost surely, so the count is finite on bounded time intervals. Use in the question's notation. The index is a stopping index for the holding-time sequence. Conditional on and the first holding times, every later retains its original probability distribution. Summing over provesThe straddling time is different. Let and let be the renewal measure . Independence of the next holding time from its start givesFor two numbers in , their minimum is at least their product. Since , subtracting times the second integral provesThese formulae handle holding-time atoms with the stated renewal convention ; sums may be interchanged by nonnegativity.
For rate- exponentials, the renewal process is Poisson. The elapsed age has probability distribution with : for , is the probability of no arrivals in , namely , with an atom at . The forward residual is an independent rate- exponential by independent future increments. Thus . Conditioning on the age gives the exact survival lawFor the extra term is strictly positive, proving strict inequality. For fixed and , the limit is , which equals the survival probability of the sum of two independent rate- exponentials. This is the finite-time form of the stochastic length bias of a renewal interval.
Renewal measure Created 2026-10-06 Updated 2026-11-05
For a positive interarrival law , the renewal measure counts the expected number of renewal epochs in a set, including the epoch at zero through . Its cumulative function is one plus the usual renewal function. convolution against solves a renewal equation.
Renewal representation Created 2026-10-06 Updated 2026-11-05
For positive interarrivals with law and locally bounded forcing , the unique locally bounded solution of is , where is the renewal measure. Iteration proves the identity: the residual is bounded on each compact interval by a constant times the probability that the sum of many positive interarrivals stays in that interval, which tends to zero.