Uniform distribution (discrete)

discrete uniform

Probability mass function n = 5 where n = b − a + 1
Cumulative distribution function
Parameters	$a \in (\dots,-2,-1,0,1,2,\dots)\,$ $b \in (\dots,-2,-1,0,1,2,\dots), b \ge a$ $n=b-a+1\,$
Support	$k \in \{a,a+1,\dots,b-1,b\}\,$
PMF	$\begin{matrix} \frac{1}{n} & \mbox{for }a\le k \le b\ \\0 & \mbox{otherwise } \end{matrix}$
CDF	$\begin{matrix} 0 & \mbox{for }k<a\\ \frac{\lfloor k \rfloor -a+1}{n} & \mbox{for }a \le k \le b \\1 & \mbox{for }k>b \end{matrix}$
Mean	$\frac{a+b}{2}\,$
Median	$\frac{a+b}{2}\,$
Mode	N/A
Variance	$\frac{(b-a+1)^2-1}{12}=\frac{n^2-1}{12},$
Skewness	$0\,$
Ex. kurtosis	$-\frac{6(n^2+1)}{5(n^2-1)}\,$
Entropy	$\ln(n)\,$
MGF	$\frac{e^{at}-e^{(b+1)t}}{n(1-e^t)}\,$
CF	$\frac{e^{iat}-e^{i(b+1)t}}{n(1-e^{it})}$

In probability theory and statistics, the discrete uniform distribution is a probability distribution whereby a finite number of equally spaced values are equally likely to be observed; every one of n values has equal probability 1/n. Another way of saying "discrete uniform distribution" would be "a known, finite number of equally spaced outcomes equally likely to happen."

If a random variable has any of n possible values $k_1,k_2,\dots,k_n$ that are equally spaced and equally probable, then it has a discrete uniform distribution. The probability of any outcome k_i  is 1 / n. A simple example of the discrete uniform distribution is throwing a fair die. The possible values of k are 1, 2, 3, 4, 5, 6; and each time the die is thrown, the probability of a given score is 1/6. If two dice are thrown and their values added, the uniform distribution no longer fits since the values from 2 to 12 do not have equal probabilities.

The cumulative distribution function (CDF) can be expressed in terms of a degenerate distribution as

$F(k;a,b,n)={1\over n}\sum_{i=1}^n H(k-k_i)$

where the Heaviside step function H(x − x₀) is the CDF of the degenerate distribution centered at x₀, using the convention that H(0) = 1.

Estimation of maximum

Main article: German tank problem

This example is described by saying that a sample of k observations is obtained from a uniform distribution on the integers $1,2,\dots,N$, with the problem being to estimate the unknown maximum N. This problem is commonly known as the German tank problem, following the application of maximum estimation to estimates of German tank production during World War II.

The UMVU estimator for the maximum is given by

$\hat{N}=\frac{k+1}{k} m - 1 = m + \frac{m}{k} - 1$

where m is the sample maximum and k is the sample size, sampling without replacement. This can be seen as a very simple case of maximum spacing estimation.

The formula may be understood intuitively as:

"The sample maximum plus the average gap between observations in the sample",

the gap being added to compensate for the negative bias of the sample maximum as an estimator for the population maximum.

This has a variance of

$\frac{1}{k}\frac{(N-k)(N+1)}{(k+2)} \approx \frac{N^2}{k^2} \text{ for small samples } k \ll N$

so a standard deviation of approximately N / k, the (population) average size of a gap between samples; compare $\frac{m}{k}$ above.

The sample maximum is the maximum likelihood estimator for the population maximum, but, as discussed above, it is biased.

If samples are not numbered but are recognizable or markable, one can instead estimate population size via the capture-recapture method.

Random permutation

Main article: Random permutation

See rencontres numbers for an account of the probability distribution of the number of fixed points of a uniformly distributed random permutation.

See also

• Delta distribution
• Uniform distribution (continuous)