This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.Find sources: "Discrete uniform distribution" – news · newspapers · books · scholar · JSTOR (October 2022) (Learn how and when to remove this template message)

Probability mass function n = 5 where n = b − a + 1 | |||

Cumulative distribution function | |||

Notation | or | ||
---|---|---|---|

Parameters |
integers with | ||

Support | |||

PMF | |||

CDF | |||

Mean | |||

Median | |||

Mode | N/A | ||

Variance | |||

Skewness | |||

Ex. kurtosis | |||

Entropy | |||

MGF | |||

CF | |||

PGF |

In probability theory and statistics, the **discrete uniform distribution** is a symmetric probability distribution wherein a finite number of 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 outcomes equally likely to happen".

A simple example of the discrete uniform distribution is throwing a fair die. The possible values 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 resulting distribution is no longer uniform because not all sums have equal probability. Although it is convenient to describe discrete uniform distributions over integers, such as this, one can also consider discrete uniform distributions over any finite set. For instance, a random permutation is a permutation generated uniformly from the permutations of a given length, and a uniform spanning tree is a spanning tree generated uniformly from the spanning trees of a given graph.

The discrete uniform distribution itself is inherently non-parametric. It is convenient, however, to represent its values generally by all integers in an interval [*a*,*b*], so that *a* and *b* become the main parameters of the distribution (often one simply considers the interval [1,*n*] with the single parameter *n*). With these conventions, the cumulative distribution function (CDF) of the discrete uniform distribution can be expressed, for any *k* ∈ [*a*,*b*], as

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 , 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 uniformly minimum variance unbiased (UMVU) estimator for the maximum is given by

where *m* is the sample maximum and *k* is the sample size, sampling without replacement.^{[1]} This can be seen as a very simple case of maximum spacing estimation.

This has a variance of^{[1]}

so a standard deviation of approximately , the (population) average size of a gap between samples; compare 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.

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.

The family of uniform distributions over ranges of integers (with one or both bounds unknown) has a finite-dimensional sufficient statistic, namely the triple of the sample maximum, sample minimum, and sample size, but is not an exponential family of distributions, because the support varies with the parameters. For families whose support does not depend on the parameters, the Pitman–Koopman–Darmois theorem states that only exponential families have a sufficient statistic whose dimension is bounded as sample size increases. The uniform distribution is thus a simple example showing the limit of this theorem.