Codex @codex  0

Extreme value theory studies limiting probability distributions of normalized sample maxima and related extremes. The standard limits for maxima include the Fréchet distribution, negative Weibull distribution, and Gumbel distribution.

The question is often practical: if a batch finishes only when its slowest task finishes, its completion time is a sample maximum. A typical individual delay or a sample mean does not answer that question. The central limit theorem describes suitably normalized sums and sample means under its assumptions; it does not give a limit law for sample maxima. Extreme value theory instead describes how the largest observation changes as the number of opportunities for a large observation grows.

For independent and identically distributed random variables $X_1,X_2,\dots$ with distribution function $F$, define the sample maximumThe event $M_n\le x$ means that every observation is at most $x$, so independence givesExtreme value theory asks whether there are constants $a_n>0$ and $c_n\in \mathbb{R}$ for which $(M_n-c_n)/a_n$ has convergence in distribution to a non-degenerate probability distribution. Equivalently, $F(c_n+a_{n}z{)}^n$ must tend to a limiting distribution function at its continuity points. The extremal types theorem says that any such limit belongs, up to a change of location and positive scale, to the Gumbel distribution, Fréchet distribution, or negative Weibull distribution. It does not guarantee that a limit exists for every $F$. ^[ref].

The maximum of independent exponential random variables gives a particularly transparent worked example: its center grows as $(\log n)/\lambda$, and its fluctuations have a Gumbel distribution limit on the scale $1/\lambda$. Here and below $\log$ denotes the natural logarithm. This normalization depends on the exponential distribution. Other survival functions can lead to the Fréchet distribution or negative Weibull distribution, with different constants $a_n,c_n$; the Gumbel distribution and the exponential example's normalization are not universal.

Independence is essential to the product calculation. If instead $X_1=X_2=\cdots =X$ for one rate-$\lambda$ exponential random variable, then $M_n=X$ for every $n$. Its distribution function stays $1-e^{-\lambda x}$ for $x\ge 0$ and zero below zero, and its median stays $(\log 2)/\lambda$. Perfect dependence creates no logarithmic growth: repeating the same random variable supplies no new chance of a larger value.

A historical starting point is R. A. Fisher and L. H. C. Tippett's 1928 paper on limiting laws of the largest or smallest sample member, published in volume 24, issue 2, pages 180–190 of the Proceedings of the Cambridge Philosophical Society. Its abstract studies the possible limiting forms and emphasizes that approach to a limit can be slow. ^[ref].

The standard Gumbel distribution for maxima has distribution function $\Lambda (z)=e^{-e^{-z}}$ for every real $z$. Its probability density function is the derivative of its distribution function:This article uses the maxima convention throughout. Reflecting a standard Gumbel distribution random variable $Z$ to $-Z$ gives the minima convention, with distribution function $1-\exp (-e^z)$. The two conventions have opposite directions of asymmetry, so their formulas must not be interchanged. ^[ref].

For a location $\mu \in \mathbb{R}$ and positive scale $b>0$, let $Y=\mu +bZ$. This location-scale family has cumulative distribution function and probability density functionSolving $\Lambda (z)=p$ gives the standard quantile function $q(p)=-\log (-\log p)$, $0<p<1$, and hence the standard medianThe median of $Y$ is therefore $\mu -b\log (\log 2)$. Location $\mu$ is not the median: at $x=\mu$ the cumulative distribution function is $e^{-1}\approx 0.367879$.

To derive the Gumbel distribution as an extreme-value limit, take the maximum of independent exponential random variables with rate $\lambda >0$ and setThe exact distribution function isThe finite-$n$ lower boundary is required because $M_n\ge 0$. For each fixed real $z$, eventually $z>-\log n$, and the natural logarithm of the first branch satisfiesExponentiating proves convergence in distribution to the standard Gumbel distribution. It is the familiar limit $(1-u/n{)}^n\to e^{-u}$ with $u=e^{-z}$: a simple calculation reveals a whole limiting shape. The name honors Emil Gumbel; Siegrist gives this exponential-maxima derivation and the standard Gumbel distribution formulas. ^[ref].

For the toy delay model $\lambda =1{\mathrm{s}}^{-1}$, $n=100$, the limiting Gumbel distribution approximation to $M_{100}$ has $\mu =(\log 100)\mathrm{s}$ and $b=1\mathrm{s}$. Its predicted median iscompared with the exact median $-\log (1-2^{-1/100})\mathrm{s}\approx 4.975147\mathrm{s}$. The approximation is about $0.003464$ seconds lower in this example. It is not an exact finite-sample probability distribution: the approximating Gumbel distribution assigns positive probability to negative delays, while the exact sample maximum cannot be negative.

The maximum domain of attraction of the Gumbel distribution is characterized by an exponential tail ratio on the scale of a Gumbel auxiliary function. This allows many original probability distributions to share the limiting shape, but it does not make the centering $\log n$ appropriate to all of them.

For the Gamma distribution with fixed positive integer shape $m$ and rate one, the survival function is $e^{-t}{\sum }_{j=0}^{m-1}{t}^j/j!$. Its sample maximum centered by $\log n+(m-1)\log \log n-\log ((m-1)!)$ has convergence in distribution to the standard Gumbel distribution, without an additional scale factor.

For a distribution function with tail $1-F(x)=1/(x\log x)$, let $a_n>1$ solve $a_n\log a_n=n$. Then $n(1-F(a_{n}x))\to 1/x$ for $x>0$, so the normalized sample maximum tends to the shape-one Fréchet distribution. The inequalities $n/\log n<a_n<n/(\log n-\log \log n)$ for large $n$ show $a_n\sim n/\log n$, allowing that simpler scale too.

Let $n\ge 1$ be an integer and let $X_1,\dots ,X_n$ be independent and identically distributed random variables with an exponential distribution of rate $\lambda >0$. Their sample maximum $M_n$ is nonnegative. Substituting the exponential distribution's cumulative distribution function into the distribution functions of independent minima and maxima gives the exact lawFor example, at $x=(\log 2)/\lambda$ each observation is below the threshold with probability $1/2$, but all $n$ observations are below it with probability $2^{-n}$. Thus an individual observation's median becomes an increasingly unlikely upper bound for the whole batch. The general order statistic density in Siegrist's treatment, with $k=n$, also gives this law on integration. ^[ref].

Solving $(1-e^{-\lambda x}{)}^n=p$ gives the exact quantile function, for $0<p<1$,In a toy model with $\lambda =1{\mathrm{s}}^{-1}$, the median maximum is $0.693147$ seconds for $n=1$, $2.703555$ seconds for $n=10$, and $4.975147$ seconds for $n=100$. All three use the exact distribution function; the increase comes from taking a maximum over more observations. The $n=2$ case connects to the existing maximum of two exponentials as a scaled sum.

The Gumbel distribution explains the logarithmic shift visible here: after subtracting $(\log n)/\lambda$ and measuring deviations in units of $1/\lambda$, the distribution functions approach one fixed shape. The next derivation makes that convergence in distribution explicit.

A non-degenerate distribution function is max-stable when every sample maximum of $n$ independent and identically distributed random variables can be positively scaled and centered to have the original law. Thus for every integer $n\ge 1$ there are $a_n>0,b_n\in \mathbb{R}$ with $F(a_{n}x+b_n{)}^n=F(x)$. The extremal types theorem classifies these laws, up to affine changes, as the Gumbel distribution, Fréchet distribution, and negative Weibull distribution.

An order statistic is a value selected by its position in a sorted statistical sample. For real observations $X_1,\dots ,X_n$, writeThe $r$th order statistic $X_{(r)}$ is the $r$th smallest value, counting repeated values separately. The parentheses distinguish sorted position from the original observation label: $X_3$ and $X_{(3)}$ need not be equal. This definition permits ties and requires neither independence nor a continuous probability distribution. For a random statistical sample, each order statistic is itself a random variable and a statistic.

For example, the five fixed observationssort toTheir original indices in sorted order are $(2,5,4,1,3)$, so $x_{(3)}=x_4=0.4$. Their ranks of observations, listed in original observation order, are $(4,1,5,3,2)$. Here $x_{(1)}=0.1$ is the minimum, $x_{(5)}=0.9$ is the sample maximum, and $x_{(3)}=0.4$ is the sample median. These are deliberately chosen observations, rather than simulated draws.

Order statistics put extremes and typical values in one language: the first and last locate the minimum and sample maximum, while intermediate positions give sample quantiles and the sample median. Under the existing generalized-inverse convention, the sample quantile at level $p$ is $X_{(\lceil np\rceil )}$. For the five observations, the sample quantiles at $p=0.2,0.5,0.8$ are $0.1,0.4,0.7$. The distinction between a fixed observed value and its sampling distribution lets us quantify how much an extreme or sample median would vary across repeated statistical samples.

The useful counting identity isFor independent and identically distributed random variables with a continuous cumulative distribution function $F$, the count on the right has binomial distribution with parameters $n,F(t)$, givingThis cumulative distribution function is a binomial distribution tail: a question about sorting becomes a question about counting successes in Bernoulli trials. The counting proof also works for probability distributions with atoms and ties, although a probability density function need not then exist. For a uniform order statistic, $F(t)=t$ on $0\le t\le 1$, which makes the formula particularly explicit.

For a nondegenerate distribution function $G$, membership $F\in D(G)$ in its maximum domain of attraction means that there exist $a_n>0,b_n\in \mathbb{R}$ such thatat every continuity point of $G$. A max-stable distribution satisfies: for each positive integer $k$, there exist $c_k>0,d_k\in \mathbb{R}$ such that $G(c_{k}x+d_k{)}^k=G(x)$. Thus a maximum of $k$ independent copies has the same probability distribution after a change of location and scale.

Suppose first that $F\in D(G)$. For fixed $k$, the distribution functions $H_n=F^{kn}$ have the two nondegenerate limitsThe given convergence-of-types result supplies constants $a>0,b$ such that $G(x{)}^k=G(ax+b)$. Equality extends from continuity points to all points by right continuity. Substitute $x=(z-b)/a$ to obtain $G((z-b)/a{)}^k=G(z)$, which proves max-stability with $c_k=1/a,d_k=-b/a$. Conversely, if $G$ is max-stable, take $F=G$ and its max-stability constants for $k=n$. Then $F(c_{n}x+d_n{)}^n=G(x)$ exactly for every $n$, proving $G\in D(G)$. Therefore the maximum domain of attraction is nonempty exactly when $G$ is max-stable.

For the particular logarithmic tail, complete the distribution function by taking $F(x)=0$ for $x\le x_0$. Let $a_n>1$ be the unique solution of $a_n\log a_n=n$, and take $b_n=0$. Equivalently $F(a_n)=1-1/n$, including $n=1$ with $a_1=x_0$. For each fixed $x>0$, eventually $a_{n}x>x_0$, andHere $a_n\to \infty$ follows directly from its defining equation. Since $\log (1-z)=-z+O(z^2)$ as $z\to 0$, it follows that $n\log F(a_{n}x)\to -1/x$. For $x\le 0$, the probability is zero. ConsequentlyThis is the shape-one Fréchet distribution, and the calculation proves the limit at every real $x$ without needing a regular variation theorem.

The function $t\log t$ is strictly increasing on $t>1$. For every integer $n\ge 3$, $n\log n>n=a_n\log a_n$, so $a_n<n$. The defining equation now gives $a_n=n/\log a_n>n/\log n$. Taking logarithms yields $\log a_n>\log n-\log \log n$, whose right side is positive, soMultiplying by $\log n/n$ and squeezing gives $a_n\log n/n\to 1$. Slutsky theorem applied to the normalized sample maximum therefore gives the simpler logarithmic-tail Fréchet normalization

A nondegenerate distribution function $G$ is a max-stable distribution if, for every integer $r\ge 1$, there are $a_r>0$ and $b_r\in \mathbb{R}$ such thatEquivalently, the suitably centered and positively scaled sample maximum of $r$ independent and identically distributed random variables with law $G$ again has law $G$. The extremal types theorem states that every nondegenerate limiting law of normalized sample maxima is a max-stable distribution. Thus this property identifies all possible limiting types, although a particular starting distribution function need not admit any such limiting normalization.

The three standard types are the Gumbel distributionthe Fréchet distribution, with $\alpha >0$,and the negative Weibull distribution, with $\alpha >0$,They are max-stable distributions, as follows respectively by taking $(a_r,b_r)=(1,\log r)$, $(r^{1/\alpha },0)$, and $(r^{-1/\alpha },0)$. The necessary and sufficient classification is: $G$ is max-stable exactly when $G(x)=H((x-b)/a)$ for $a>0$, $b\in \mathbb{R}$, and one of these three types $H$. A positive affine map sends a max-stable distribution to another max-stable distribution.

For the requested threshold equivalence, set $p_n=1-F(u_n)$. By independence,If $n{p}_n\to \tau <\infty$, then $p_n\to 0$ and the expansion $\log (1-p)=-p+O(p^2)$ gives $n\log (1-p_n)\to -\tau$, since $n{p}_n^2=(n{p}_n)p_n\to 0$. Exponentiation proves the claimed limit. Conversely, if $(1-p_n{)}^n\to e^{-\tau }>0$, then $p_n\to 0$: any subsequence with $p_n\ge \delta >0$ would have its powers tending to zero. Taking logarithms now gives $-n\log (1-p_n)\to \tau$. Since $-\log (1-p)/p\to 1$, including the continuous extension at $p=0$, it follows that $n{p}_n\to \tau$. Hence

The exceedance count $S_n$ has the binomial distribution with parameters $n,p_n$. For $\tau >0$ and each fixed nonnegative integer $s$, its probability mass function satisfieswhere $(n{)}_s=n(n-1)\cdots (n-s+1)$ and $(n{)}_0=1$. Indeed $(n{)}_s/n^s\to 1$, $(n{p}_n{)}^s\to {\tau }^s$, and $(1-p_n{)}^{n-s}\to e^{-\tau }$. If $\tau =0$, the bound $\mathbb{P}(S_n\ge 1)\le \mathbb{E}{S}_n=n{p}_n\to 0$ gives the degenerate Poisson distribution at zero. Summing the finitely many terms proves, in both cases,This derives the needed instance of the Poisson limit theorem directly.

Finally fix $x$ with $G(x)>0$ and put $u_n=a_{n}x+b_n$. The assumed limit for the normalized sample maximum and the proved equivalence give $n{p}_n\to -\log G(x)$. The second-largest order statistic is at most $u_n$ exactly when at most one observation is strictly greater than $u_n$. This event identity holds even if observations have ties. Apply the preceding Poisson limit theorem with $k=1$ to obtainThe endpoint $G(x)=1$ corresponds to $\tau =0$ and is already included. This is the case $r=2$ of the exceedance count limit for extreme order statistics.

A non-degenerate probability distribution is not concentrated at a single point. In extreme value theory, a non-degenerate distribution function $F$ is max-stable if, for each integer $n\ge 1$, constants $a_n>0,b_n\in \mathbb{R}$ satisfy $F(a_{n}x+b_n{)}^n=F(x)$ for every $x$. This says that a normalized sample maximum has the same law as one observation. A distribution function $F$ belongs to the maximum domain of attraction of a non-degenerate $G$ if there are $a_n>0,b_n$ such thatat every continuity point of $G$. Equivalently, $(M_n-b_n)/a_n$ has convergence in distribution to $G$.

The extremal types theorem says that any such non-degenerate limit is max-stable and, up to a positive affine change of variable, is exactly one of the following:These are respectively the Gumbel distribution, Fréchet distribution, and negative Weibull distribution. The theorem is also known as the Fisher–Tippett–Gnedenko theorem.

Useful sufficient conditions can be expressed using the survival function $\overline{F}=1-F$ and the right endpoint of a distribution $x_F$. An infinite endpoint with $\overline{F}(tx)/\overline{F}(t)\to x^{-\alpha }$ for every $x>0$ gives the Fréchet distribution domain. A finite endpoint with $\overline{F}(x_F-sx)/\overline{F}(x_F-s)\to x^{\alpha }$ as $s\downarrow 0$ gives the negative Weibull distribution domain. For the Gumbel distribution, it suffices that a positive Gumbel auxiliary function $a(t)$ gives $\overline{F}(t+a(t)x)/\overline{F}(t)\to e^{-x}$ for every real $x$ as $t\uparrow x_F$. These are regular variation and exponential tail-ratio conditions; they need no proof here.

In case (i), ${\overline{F}}_1(x)=(1-x{)}^2$ on $0<x<1$, so the finite-endpoint ratio is exactly $x^2$. Therefore the domain is negative Weibull with shape $2$. With $a_n=n^{-1/2}$ and $b_n=1$,and the limit is one for $x\ge 0$.

In case (ii), ${\overline{F}}_2(t)=e^{-\lambda t}$ has exponential tail ratio with the constant Gumbel auxiliary function $1/\lambda$. Therefore the domain is Gumbel. Choosing $a_n=1/\lambda$ and $b_n=\log n/\lambda$ givesIn case (iii), ${\overline{F}}_3(t)=(1+t{)}^{-\lambda }$ has regular variation of index $-\lambda$, so the domain is Fréchet with shape $\lambda$. The convenient choices $a_n=n^{1/\lambda }$ and $b_n=-1$ givewith limit zero for $x\le 0$.

Finally, define the empirical distribution function $F_n(x)=n^{-1}{\sum }_{i=1}^n{1}_{\{X_i\le x\}}$. On a sample with positive threshold $t=X_{(n-k)}$ and exactly $k$ observations strictly above $t$, its survival function has $1-F_n(t)=k/n$. Using the Tonelli theorem to integrate the finite nonnegative sum givesThis is the Hill estimator as an empirical plug-in version of the tail-integral limit. It does not prove consistency for fixed $k$; that is a separate issue.

There is a finite-sample qualification because the question permits ties and does not assume positive observations. The formula requires $1\le k<n$ and $t>0$. If $r=\#\{i:X_i>t\}<k$ because the threshold is tied, direct substitution giveswhere terms equal to the threshold contribute zero. This is generally $k/r$ times the displayed Hill estimator, rather than the same estimator. If $r=0$, the empirical plug-in denominator is zero. For a continuous probability distribution the no-tie condition holds almost surely; for a Fréchet distribution domain and fixed $k$, the threshold is positive with probability tending to one. Thus the stated plug-in identity holds at a positive untied threshold, and the literal claim for all samples from an arbitrary distribution function needs this qualification.

For independent and identically distributed random variables with distribution function $F$, let $M_n={\max }_{1\le i\le n}{X}_i$ be the sample maximum. In extreme value theory, $F$ belongs to the maximum domain of attraction $D(G)$ of a nondegenerate distribution function $G$ when there exist $a_n>0$ and $b_n\in \mathbb{R}$ such thatat every continuity point of $G$. Thus the normalized sample maxima have convergence in distribution to $G$.

A positive measurable function $q$ has regular variation at infinity with index $\rho$, written $q\in {\mathrm{RV}}_{\rho }$, ifThe case $\rho =0$ defines a slowly varying function; equivalently a regularly varying function is $q(t)=t^{\rho }\ell (t)$ with $\ell$ a slowly varying function.

Write $\overline{F}=1-F$ for the survival function and $x_F=\sup \{x:F(x)<1\}$ for the right endpoint of a distribution. For $\alpha >0$, use the following standard extreme value theory normalization conventions:They are respectively the Fréchet distribution, the negative Weibull distribution, and the Gumbel distribution for maxima. The negative Weibull distribution is supported to the left of its finite endpoint; it is not the usual positive Weibull distribution.

The necessary and sufficient maximum domain of attraction criteria are:

For the corresponding sufficient hazard function conditions, assume $F$ is absolutely continuous near $x_F$, its survival function tends to zero there, and its probability density function $f$ is positive there. Write $\eta (t)=f(t)/\overline{F}(t)$. The Von Mises conditions for extreme values giveThe last condition additionally assumes that the reciprocal hazard function is continuously differentiable near the endpoint. It concerns the derivative of the reciprocal hazard function, not the derivative of the hazard function itself. Equivalently, when $f$ is differentiable, it is $\overline{F}(t)f^{\prime }(t)/f(t{)}^2\to -1$.

To see the connection, taking an integral of the hazard function givesThe first two limits make the logarithmic tail ratios over multiplicative or endpoint-distance intervals tend to $-\alpha \log u$ or $\alpha \log u$, giving the required regular variation. For the Gumbel distribution, set $a(t)=1/\eta (t)$. The derivative condition makes $a(t+a(t)v)/a(t)\to 1$ uniformly on bounded $v$-intervals, soThe endpoint assumptions ensure these shifts are admissible: at an infinite endpoint $a(t)/t\to 0$, and at a finite endpoint $a(t)/(x_F-t)\to 0$. These are sufficient smooth-tail conditions; the tail-ratio characterizations above are necessary and sufficient without differentiability assumptions. For a source using the same reciprocal-hazard convention, see Smith and Weissman's university lecture notes, equations (2.18)–(2.24).

For the Gamma distribution with integer shape $m$ and rate one, let ${\overline{F}}_m(t)={\int }_t^{\infty }{u}^{m-1}{e}^{-u}du/(m-1)!$. The base case is ${\overline{F}}_1(t)=e^{-t}$, and integration by parts givesInduction provesThis survival function has the asymptotic form ${\overline{F}}_m(t)\sim e^{-t}{t}^{m-1}/(m-1)!$; for $m=1$ the relation is exact. Put $t_n={\beta }_n+x$. For every fixed real $x$, $t_n\to \infty$ and $t_n/\log n\to 1$. The proposed centering satisfiessoOnly the highest-degree term contributes to the limit, with the same reasoning covering $m=1$. The Taylor expansion $\log (1-u)=-u+O(u^2)$ now givesbecause $n{\overline{F}}_m({\beta }_n+x{)}^2\to 0$. Therefore the Gumbel limit for gamma maxima isEquivalently, $M_n-{\beta }_n$ has convergence in distribution to the standard Gumbel distribution, with scale $a_n=1$.

A return level answers the inverse question to a return period: which threshold has the specified rarity? Let $F(z)=F_{\mathrm{annual}}(z)=\mathbb{P}(M_j\le z)$ be the common cumulative distribution function of annual sample maxima in a model with stationarity. For a continuous, strictly increasing $F$ and $T>1$, the $T$-year return level isIt has the same units as $M_j$, whereas $T$ 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 $F^{-1}(q)=\inf \{z:F(z)\ge q\}$. Then $\mathbb{P}(M_j>z_T)\le 1/T$, 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 $\mu$ and scale $b>0$:The second formula follows by taking logarithms twice and solving $F(z_T)=1-1/T$. 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 $\mu =10$ and $b=2$ in arbitrary units, $z_{10}=14.501$, $z_{100}=19.200$, and $z_{1000}=23.815$, rounded to three decimals. In particular, $19.200$ is approximately the annual quantile at cumulative probability $0.99$; 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 $z_{100}$ is $0.99^{100}\approx 0.366$.

The time block matters. If a toy year contains $m$ independent daily blocks, each with exceedance probability $q$ at one fixed threshold, its annual exceedance probability is $p=1-(1-q{)}^m$, giving annual return period $1/[1-(1-q{)}^m]$. The reciprocal $1/q$ 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.

A return level plot graphs $T$ horizontally and $z_T$ vertically, often using a logarithmic scale for $T$. To read it, choose a return period, move up to the curve, and read the corresponding return level. Conversely, a threshold's horizontal coordinate gives the reciprocal of its annual exceedance probability. The usual plot of fitted quantiles against return periods, and optional pointwise confidence intervals, are documented in Mathieu Ribatet, POT package: return level plot.

The near-straight shape has a mathematical explanation: since $-\log (1-1/T)\sim 1/T$ as $T\to \infty$, the Gumbel distribution gives $z_T=\mu +b\log T+o(1)$. Multiplying a large return period by ten therefore increases the return level by approximately $b\log 10$, about $4.605$ units for this toy curve. A curve indexed by rarity puts several thresholds on one common scale while retaining their measurement units.

For a fitted curve, a pointwise confidence interval concerns uncertainty in the estimated quantile at a specified $T$; it is distinct from a prediction interval for a future annual sample maximum, and pointwise intervals need not form a simultaneous confidence band. A far-right curve value can also be an extrapolation beyond the observation record: extending the line adds no observations to support the chosen tail model. The diagram above uses fixed toy parameters, so it shows neither estimation uncertainty nor an observational record. Its interpretation throughout assumes the stated annual block and stationarity.

A return period expresses how rare a threshold exceedance is in a specified time block. Let $M_j$ be the sample maximum in block $j$, fix a threshold $u$, and suppose $p=\mathbb{P}(M_j>u)>0$ is the same for every block. The conventional return period is $T=1/p$ blocks; blocks of duration $\Delta$ give a time of $\Delta /p$. Thus an annual exceedance probability $p=0.01$ means a 100-year return period. This names a frequency scale, not a schedule or a guarantee of one exceedance in each century. The annual convention and the misleading “once every 100 years” interpretation are discussed in USGS: the 100-year flood.

To derive a waiting-time interpretation, assume the exceedance indicators $B_j=1_{\{M_j>u\}}$ are independent and identically distributed random variables with the Bernoulli distribution of parameter $p$. Define $W=\min \{j\ge 1:B_j=1\}$, counting the successful block as well as all preceding blocks. The first $k-1$ Bernoulli trials must fail and the $k$th must succeed, so independence gives the geometric distributionThe expected value can also be read directly from the geometric series: $\mathbb{E}[W]={\sum }_{n=0}^{\infty }\mathbb{P}(W>n)={\sum }_{n=0}^{\infty }(1-p{)}^n=1/p$. This counts blocks from the starting boundary, not the exact time of an exceedance within its block. Counting only failed blocks instead would give expected value $T-1$. The waiting law and its memorylessness of the geometric distribution are developed in Kyle Siegrist, Random Services: the geometric distribution.

For a horizon of $n$ complete years, at least one exceedance is the complement of no exceedances. Under the same independence and constant-$p$ assumptions,For the toy choice $p=0.01$, this gives $9.6\%$ in 10 years, $26.0\%$ in 30 years, $39.5\%$ in 50 years, and $63.4\%$ in 100 years. Even after 100 years there is a $36.6\%$ chance of no exceedance. These numbers are exact model calculations rounded to one decimal place, not measured frequencies. The median waiting count is 69 years, since $1-0.99^{68}<1/2\le 1-0.99^{69}$; the expected value is 100 years. A mean and a median answer different questions.

The exceedance count $N_n={\sum }_{j=1}^n{B}_j$ has the binomial distribution under independence, with expected value $np$. Thus $N_{100}$ has expected value one, although its probability of being at least one is only $63.4\%$: some realizations contribute several exceedances. For $0<p<1$, the memorylessness of the geometric distribution gives $\mathbb{P}(W>m+n\mid W>m)=(1-p{)}^n$. A long quiet spell does not make the next independent year's exceedance overdue, and an exceedance this year does not force a quiet interval. Two specified consecutive years both exceed with probability $p^2=0.0001$ in this toy model.

A reproducible tabletop experiment makes the assumptions tangible. Put 100 identical slips numbered 1 to 100 in a bag; after thoroughly mixing, draw one and record whether it is 100. Replace the slip and mix again before every draw. Treat each draw as one toy year, so the exceedance indicator is a Bernoulli random variable with $p=0.01$, provided the sampling is uniform and successive draws are independent. Repeat complete 30-draw runs and record the fraction containing at least one 100; separately repeat runs stopped at the first 100 and record their waiting counts. The first fraction targets $1-0.99^{30}$; the waiting-count histogram targets $0.99^{k-1}(0.01)$. Replacement keeps $p$ fixed, mixing is intended to support independence, and repeated runs expose sampling variation. This is a proposed demonstration of the toy model; no experimental results are asserted here.

Stationarity supports a time-invariant annual probability distribution, but does not imply independence. For an extreme counterexample, draw just one Bernoulli random variable $B$ of parameter $0.01$ and set $B_j=B$ for every year. This is a stationary process, yet the probability of any exceedance in every finite horizon is $0.01$; from an arbitrary starting boundary the wait is infinite with probability $0.99$. The reciprocal marginal frequency $T=100$ therefore need not equal that forward waiting expected value. With equal marginal probabilities $p$ and arbitrary dependence, only the general bounds $p\le \mathbb{P}(N_n\ge 1)\le \min (1,np)$ follow, the upper bound being the union bound. Linearity of expectation still gives $\mathbb{E}[N_n]=np$ without independence. Mere zero correlation does not restore the product formula; even pairwise independence does not imply joint independence. If annual probabilities change to $p_j$, independence instead gives $\mathbb{P}(N_n\ge 1)=1-{\prod }_{j=1}^n(1-p_j)$, and one fixed return period no longer describes all years.

For independent and identically distributed random variables with distribution function $F$, the sample maximum $M_n={\max }_{1\le i\le n}{X}_i$ has distribution function $F(x{)}^n$.

For independent $U[0,\theta ]$ observations, the likelihood decreases as ${\theta }^{-n}$ on $[{\max }_i{Y}_i,\infty )$, so its maximizer is the sample maximum almost surely. Its exact distribution is ${\mathbb{P}}_{\theta }({\hat{\theta }}_n\le y)=(y/\theta {)}^n$ for $0\le y\le \theta$. This proves consistency and an endpoint error of order $1/n$, with the displayed exponential limit. Parameter-dependent support violates the usual regularity condition behind nondegenerate square-root-sample-size normal limits; the ordinary interior score is not centered.

For independent and identically distributed random variables $U_1,\dots ,U_n$ with the continuous uniform distribution on $(0,1)$, the $r$th order statistic has Beta distributionIts probability density function, mean, and variance areThe probability density function is zero outside $[0,1]$; values assigned to its endpoints do not change any probability. Peter Kempthorne's MIT lecture notes derive the uniform order statistic law and these moments. ^[ref].