Cumulant generating function — where it appears
Named by 2 essays across one field — each of them below, with the objects they name alongside it.
Also named here as exponential tilting, saddlepoint approximation — the same set of essays touches all of them, so they are one junction rather than several.
An approximation built at the threshold
The saddlepoint approximation reads the tail of a sum of five exponential draws to within 0.19% six standard deviations out, where the normal is short by a factor of more than sixty thousand. It is within 2.2% out to ten standard deviations on a single draw, where there is nothing to average, and within 1.1% on a binomial whose expected count is one. It works because it is built where the tail is read rather than at the mean.
A tail the sample never saw
Given the source, the saddlepoint reads the tail of a sum of thirty exponential draws to within a fifth of a per cent six standard deviations out. Given only a sample of thirty from that source, the same tilt reads it at a median of 0.061 of the truth, and nine samples in ten read it low. The error has moved from the approximation to the sample: thirty draws put the skewness at a median of 1.30 against a true 2, and hold nothing past their largest value.
Named alongside it
The objects these essays reach for when they reach for this one.
Exponential tiltingNormal approximationSaddlepoint approximationTail probabilityApproximation errorBootstrapDiscretenessEdgeworth expansionSample sizeSkewness