Quantile derivative identity Created 2026-10-06 Updated 2026-11-05
If is the quantile function of an absolutely continuous probability distribution with probability density function , then for almost every . Gaps in the support may give jumps in , so the identity concerns its ordinary almost-everywhere derivative. It follows by differentiating the inverse relation to the cumulative distribution function.
Quantile endpoint at probability one Created 2026-10-14 Updated 2026-11-05
The quantile function is finite at every probability strictly between zero and one, but need not be finite at one. For any unbounded-above normal distribution, for every real , so its generalized inverse at one is . Inverse transform sampling still produces a real random variable almost surely because a continuous uniform distribution puts zero mass at that endpoint. A real-valued implementation may discard endpoint draws or assign an arbitrary finite value there without changing the sampled law.
Quantile function Created 2026-09-24 Updated 2026-10-14
The quantile function converts a cumulative probability level into a value. For a cumulative distribution function and , use the generalized inverseIt selects the first threshold reaching the requested level. The infimum handles jumps and flat portions, so this construction does not require an ordinary inverse function. Other endpoint conventions are possible at or ; the open probability interval avoids those issues. NIST introduces the inverse-direction question as the percent point function. [ref]
https://itl.nist.gov/div898/handbook/eda/section3/eda362.htm. NIST: cumulative distribution and percent point functions
.For the finite example under probability distribution,Thus , , . The value at is still zero, because already reaches that level. For on , the quantile function is , giving .
A median is a central threshold; supplies one, though a median need not be unique. The same quantile function becomes a sampling algorithm through inverse transform sampling. Jumps in become flat bands in , precisely the mechanism needed to assign positive probability to one outcome.
Quartile 2026-10-14
Quartiles are the quantiles at probability levels ; is a median. For a population we can use its quantile function, for . Finite-sample conventions differ. Our box plot uses linear interpolation between order statistics: for and , setThen . This is R's type-7 convention, described in the documentation authored by Ivan Frohne and Rob J Hyndman. It differs from the generalized-inverse sample quantile defined elsewhere in this wiki: for the twelve toy values, that rule selects ranks and gives , rather than . These are different stated conventions, not arithmetic disagreements. [ref]
https://stat.ethz.ch/R-manual/R-devel/library/stats/html/quantile.html. Frohne and Hyndman, R stats documentation, sample quantile types
Rayleigh radial thresholds and quantiles 2026-10-18
For , integration gives the survival function and cumulative distribution functionSolving gives the quantile function[ref]
The Rayleigh Distribution. Random: Probability, Mathematical Statistics, Stochastic Processes by Kyle Siegrist; The General Rayleigh Distribution, Distribution Functions: CDF, quantile and survival functions
For the chosen positioning model ,The disk of radius one component standard deviation therefore contains about 39.35% of outcomes; the familiar one-dimensional normal interval percentage does not apply to a two-dimensional disk. The 95% and 99% radial thresholds areA circle defined by itself still has probability zero; its enclosed disk carries the stated probability.
The closed-form quantile function also gives inverse transform sampling: if has uniform distribution on , then has Rayleigh distribution. Using instead gives the same law. Endpoints are excluded so that the logarithm stays finite.
Return level Created 2026-10-06 Updated 2026-10-14
A return level answers the inverse question to a return period: which threshold has the specified rarity? Let be the common cumulative distribution function of annual sample maxima in a model with stationarity. For a continuous, strictly increasing and , the -year return level isIt has the same units as , whereas is a count of annual blocks. Independence between years is unnecessary for this one-year quantile definition; it is needed for the geometric waiting and multi-year formulas under return period. For a discrete probability distribution, use the generalized quantile function . Then , with equality not guaranteed at jumps; an exact requested exceedance probability may be unattainable.
For a concrete standard model, choose the maxima convention of the Gumbel distribution, with location and scale :The second formula follows by taking logarithms twice and solving . The maxima cumulative distribution function and its inverse are given in NIST: extreme value type I distribution, maximum case. With the deliberately chosen toy values and in arbitrary units, , , and , rounded to three decimals. In particular, is approximately the annual quantile at cumulative probability ; it is not a prediction of the largest observation in the next 100 years. Under independence, the probability that all those annual sample maxima stay below the exact is .
The time block matters. If a toy year contains independent daily blocks, each with exceedance probability at one fixed threshold, its annual exceedance probability is , giving annual return period . The reciprocal counts daily blocks. Dependence among daily exceedances requires their joint law instead; a threshold crossed on several successive days still produces only one exceedance indicator for that year's sample maximum. The peaks-over-threshold method and declustering of extremes address a different choice of extreme-event sampling.
Sampling a discrete uniform distribution 2026-10-14
Let the numerical support of a probability distribution be . Its cumulative distribution function counts how many values have been passed:It is zero below , equals on for , and is one at and above . Every jump is , even when the horizontal gaps differ.
For inverse transform sampling, take an ideal continuous uniform distribution for on . Partition that interval into intervals of width and outputEach interval has probability , proving the desired discrete uniform distribution. Using the floor function, the index is ; for consecutive integer values the output is . With the usual quantile function convention , one instead writes for , using the ceiling function. The endpoint conventions differ only at a finite set of points with probability zero under the ideal continuous uniform distribution.
For , the four intervals , , , and select , respectively. Thus selects , while selects . The upper half of the interval selects values at least four, recovering probability . Equal widths refer to the sampling probability coordinate, not to distances between output values. This is an exact mathematical construction assuming an ideal continuous uniform distribution; a finite computer random-number source needs its own justification of equal output chances.
Tail probability Created 2026-10-03 Updated 2026-10-14
For a real random variable , an upper-tail probability has the form and a lower-tail probability has the form . Each is the probability of an event lying beyond a chosen threshold in one direction. A tail probability need not be small: the threshold determines how much of the probability distribution it includes. A concentration inequality bounds such probabilities, often for deviations from an expected value.
Endpoint conventions matter. Write for the cumulative distribution function and . The complement rule of probability gives four distinct formulas:The strict upper-tail convention is the survival function . Its value differs from the inclusive upper tail probability by exactly the probability mass at the threshold:A singleton with positive probability mass is an atom of a measure. Thus excludes an atom of a measure at , whereas includes it. These endpoint identities follow directly from the cumulative distribution function properties in Kyle Siegrist, Distribution and Quantile Functions: endpoint probabilities and right tails.
As the threshold increases, both upper tail probabilities are nonincreasing functions. The strict survival function is a right-continuous function; the inclusive upper tail probability takes the upper endpoint value at a downward jump, equal to the left limit of the survival function. Both tend to zero as for a real random variable, but the speed of that decay differs across probability distributions. The cumulative distribution function properties and their proof from continuity of probability measures are given in MIT 6.436J, Lecture 4: random variables and cumulative distribution function properties.
For a fair six-sided die , the discrete uniform distribution assigns probability mass to each of . At threshold four,Between four and five, both upper tail probabilities equal . At the largest possible outcome the distinction is especially visible: , but . The diagram shows exact probabilities for this mathematical model; its dots specify which endpoints belong to each step function.
If a probability distribution has a probability density function , then every singleton has zero probability mass andFor an exponential distribution of rate two, for and zero otherwise, so for and for . Hence . This tail probability is an integral of the probability density function, not its height . A mixed probability distribution retains endpoint jumps even with a smooth component: give zero probability mass and choose this exponential distribution with probability . Then , , and for .
A two-sided tail probability can measure the absolute value of displacement from a specified center . For , the two extreme events are disjoint events, soFor strict displacement , replace the last expression by . The condition prevents overlap; at adding inclusive tails double-counts any probability mass at . For a uniform distribution on , take and : the two tail probabilities are each and their sum is . Equal tails follow from this symmetric probability distribution, not from the phrase two-sided alone; for a uniform distribution on with , the two tail probabilities are zero and .
The tail-sum formula for expectation turns a whole curve of tail probabilities into an expected value. For any nonnegative random variable , without assuming a probability density function or a finite expected value,For a proof outline, write pointwise and exchange the expected value and Lebesgue integral using Tonelli theorem; is an indicator function. The inclusive version has the same Lebesgue integral: positive probability masses occur at only a countable set of thresholds, which has Lebesgue measure zero. For a nonnegative integer-valued random variable , the tail-sum formula instead gives . The integer hypothesis is essential for these sums. The integral identity, its indicator function proof, and the integer version appear in Kyle Siegrist, Additional Properties of Expected Value: integration and summation of right tails.
For the fair die, this tail-sum formula yields , equal to the direct weighted arithmetic mean . For the rate-two exponential distribution, the area under the survival function is , its expected value. The first panel below shades an integral of the probability density function for a single threshold; the second shades an integral of the survival function across all nonnegative thresholds. These are analytical illustrations, with the displayed curves truncated at three; their exact total areas use an infinite integration range.
Nonnegativity is essential to interpreting the upper tail probability area as : for a general real random variable that area equals the expected value of its positive part. An integrable random variable satisfies , subtracting the expected value of its negative part; infinite terms cannot be canceled. Even when is finite almost surely, its expected value can be infinite. For the shape-one Pareto distribution on , on and for , so the area is . The finite versus infinite expected value distinction is illustrated in Kyle Siegrist, Definitions and Basic Properties: exponential and Pareto expected values.
Why are tail probabilities useful? They answer threshold questions directly, and a concentration inequality can bound them without knowing the full probability distribution. For nonnegative with finite expected value, Markov inequality gives for : a large threshold relative to the expected value forces rarity. The quantile function reverses the question by choosing a threshold for a prescribed cumulative level. If with , then ; an atom of a measure may prevent equality. For the die, , with strict upper tail probability zero and inclusive upper tail probability .
A tail probability describes rarity under a specified probability distribution; it is not automatically a conditional probability after extra information. For with ,because the threshold events are nested. Thus the die has but . Conditioning changes the sample space and renormalizes its probability measure; the same extreme outcomes can become common in that restricted population.
Trimmed mean Created 2026-09-28 Updated 2026-11-05
For , an -trimmed mean sorts observations, removes the smallest and largest , and averages the remaining values. It limits the effect of a small number of extreme observations while still averaging a central portion of the data.
For and , removing and gives trimmed mean , compared with sample mean . Replacing by a larger value leaves this trimmed mean unchanged. Replacing enough observations can still move the retained central values arbitrarily far.
For a probability distribution with quantile function , the population statistical functional isThe normalizing denominator is the retained fraction of probability. At a regular symmetric reference probability distribution, the influence function of a trimmed mean is a clipped version of the observation, scaled by this fraction. Centering and symmetry assumptions matter when using that simpler expression.



