Tail probability — where it appears
Named by 18 essays across 9 fields — each of them below, with the objects they name alongside it.
A bound written for a coin
The Berry–Esseen theorem guarantees how far a standardised sum can be from the normal, and the guarantee is true. On an exponential source it is 8.62 times the real worst error at every sample size, the worst error sits at the centre rather than in a tail, and at a hundred draws the bound is larger than the 2.5% tail it would be asked to vouch for.
A threshold in the tail
How much of a threshold's imbalance a balanced covariate removes is a correlation, and the correlation is a closed form. At the median it is exactly 2/π — the same 2/π a median split throws away — and two standard deviations out it is an eighth.
The tail converges last
The central limit theorem is usually shown as a shape arriving. What the demonstration leaves out is the rate — and the rate is wildly different in the middle and in the tail, which is where every approximation in the subject is actually read.
The maximum converges slowly
The rate at which a normalised maximum reaches its limit law is computable rather than simulable, because the exact law of a maximum is always available. For a normal parent the distance falls like one over the logarithm of the block and is still 0.0091 at a million readings; for an exponential parent, with the same limit, it is 2.707×10⁻⁷.
A correction that goes below zero
One Edgeworth term takes the normal approximation's error at two standard deviations from 38% to 8% on ten exponential draws, and stretches the range within 10% of the truth from 1.66 to 3.09 standard deviations at a hundred. It also turns negative in the short tail at every sample size — past 3.13 standard deviations at a hundred draws and 9.83 at a hundred thousand — because the region recedes only as the sixth root of n.
Estimates that are too alike
Posterior means give each group its least-error estimate, and as a set they are too alike: with each group's standard error equal to the population's spread, they spread 0.707 as widely as the truth. Beyond two population widths lie 2.28% of the true effects, 7.86% of the groups' own means, and 0.234% of the posterior means — a tenth of the truth. Rescaling the estimates to the right spread counts the tail exactly and costs 17% more squared error; summing each group's posterior chance of being beyond the line counts it without changing any estimate.
A copula that halves a marginal
Three copulas break nothing on their own and put a factor of two between the same skewed covariate's leaks — 12.118% under a Frank against 23.640% under a t, at the same rank correlation.
Choosing the order
One criterion is consistent and one is not, which is the whole of what gets said about them. At two hundred observations the consistent one is right 95% of the time and the other 70%; at fifty they are both right 54% of the time and wrong in opposite directions, and consistency has not started to mean anything yet.
Measuring a variance rather than a quantile
A resample's implied long-run variance can be computed from the sample with no resampling in it at all. A critical value cannot, and the difference is a factor of three in the draws before any of the resampling is counted.
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.
The shape, and where its mass is
68, 95, 99.7 is recited more often than any other set of numbers in the subject. They are integrals of a specific curve, they are worth computing rather than remembering, and the third one is the one people misuse.
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.
The same correction, inverted
One skewness term added to a tail probability keeps a sum of a hundred exponential draws within 10% of the truth out to 3.09 standard deviations. The same term used to move the critical value instead keeps the test's actual size within 10% of nominal out to 5.10 — a level of about one in six million. In the short tail it has a flaw of its own: below a level of about one in a million at ten draws the corrected critical value turns back, and a test asked for a level of 10⁻⁷ rejects 1,149 times too often.
Shocks that are not normal
Every forecast interval in this field reads a normal quantile, and every series it was scored on had normal shocks. Give a first-order autoregression shocks with heavy tails and the 95% interval still covers about 95%; its 99% interval covers 98.2%. Give it skewed shocks and the 95% interval covers 94.8% one step ahead with every miss on one side — 0.0% below, 5.2% above — and the horizon does not repair it: twelve steps ahead the misses are still 0.0% below and 4.9% above, because a persistence of 0.7 keeps the error's skewness at 1.11 however far out the forecast goes. A two-sided coverage count cannot see any of this.
The draws aimed at the tail
The chance a standard normal exceeds 5 is 2.8665×10⁻⁷, and a plain simulation needs 349 million draws to estimate it to within ten per cent. Draws aimed at the tail and weighted back need 565. Aimed slightly too narrowly, the same method has an infinite variance, an interval that covers 86.0% and gets worse with more draws, and an effective sample size that reads healthier than a proposal that works.
The correction a t test would use
On thirty exponential draws the one skewness term that held a sum's critical value within 10% out to five standard deviations nearly triples a t test's 1% size when the source's skewness is known, and its upper critical value turns back — at a level of 0.89% on ten draws, where a test asked for one in a thousand rejects 121 times too often. Hall's monotone cubic removes the turn and gains a floor. Built from the sample's own skewness it holds the short side within 20% from 10% down to one in a hundred thousand, and leaves the long side, the one a safety limit reads, at twice its level: the samples that fail are the ones that hide their skewness.
A tilt for the ratio
A t statistic is a function of two means, so its saddlepoint tilts the joint law of each draw and its square. On an exponential source every such tilt is a truncated normal, and none has a coefficient of variation above one — the exponential is the edge of its own family. Integrated over the samples a tilt can reach, the saddlepoint reads a t statistic's tails on thirty draws within 2.5% from 10% to one in a million on the long side, with nothing fitted. The samples it cannot reach are a third of all samples, they sit at the centre of the statistic rather than in its tails, and a larger sample has more of them.
A proposal fitted to its own draws
The cross-entropy method fits an importance-sampling proposal from its own pilot draws, and asked to fit a normal's mean and spread to P(Z > 5) it fails before the question of variance arises: the spread halves at every stage, the level stalls near 3.7, and 95% of runs never reach the threshold, so the interval covers 1.1% of the time. Its ideal end point, the normal closest to Z conditioned past 5, is N(5.187, 0.181²), which has an infinite variance inside its own draws' reach and covers 93.7% at a thousand draws and 90.8% at ten thousand. Fitting the mean alone lands within a tenth of the best shift and covers 94.5%.
Named alongside it
The objects these essays reach for when they reach for this one.
SkewnessNormal approximationClosed formEdgeworth expansionMonte CarloCentral limit theoremConvergence rateNormal distributionApproximation errorCornish–Fisher expansionCoverageCritical value