Wikipedia / Multinomial distribution
Wikipedia / Multinomial distribution
In probability theory, the multinomial distribution is a generalization of the binomial distribution. For example, it models the probability of counts for each side of a k-sided die rolled n times. For n independent trials each of which leads to a success for exactly one of k categories, with each category having a given fixed success probability, the multinomial distribution gives the probability of any particular combination of numbers of successes for the various categories.
When k is 2 and n is 1, the multinomial distribution is the Bernoulli distribution. When k is 2 and n is bigger than 1, it is the binomial distribution. When k is bigger than 2 and n is 1, it is the categorical distribution. The term "multinoulli" is sometimes used for the categorical distribution to emphasize this four-way relationship (so n determines the suffix, and k the prefix).
The Bernoulli distribution models the outcome of a single Bernoulli trial. In other words, it models whether flipping a (possibly biased) coin one time will result in either a success (obtaining a head) or failure (obtaining a tail). The binomial distribution generalizes this to the number of heads from performing n independent flips (Bernoulli trials) of the same coin. The multinomial distribution models the outcome of n experiments, where the outcome of each trial has a categorical distribution, such as rolling a (possibly biased) k-sided die n times.
Let k be a fixed finite number. Mathematically, we have k possible mutually exclusive outcomes, with corresponding probabilities p1, ..., pk, and n independent trials. Since the k outcomes are mutually exclusive and one must occur we have pi≥0 for i=1,...,k. Then if the random variables Xi indicate the number of times outcome number i is observed over the n trials, the vector X=(X1,...,Xk) follows a multinomial distribution with parameters n and p, where p=(p1,...,pk). While the trials are independent, their outcomes Xi are dependent because they must sum to n.
Definitions
Probability mass function
Suppose one does an experiment of extracting n balls of k different colors from a bag, replacing the extracted balls after each draw. Balls of the same color are equivalent. Denote the variable which is the number of extracted balls of color i (i = 1, ..., k) as Xi, and denote as pi the probability that a given extraction will be in color i. The probability mass function of this multinomial distribution is:
for non-negative integers x1, ..., xk.
The probability mass function can be expressed using the gamma function as:
This form shows its resemblance to the Dirichlet distribution, which is its conjugate prior.
Example
Suppose that in a three-way election for a large country, candidate A received 20% of the votes, candidate B received 30% of the votes, and candidate C received 50% of the votes. If six voters are selected randomly, what is the probability that there will be exactly one supporter for candidate A, two supporters for candidate B and three supporters for candidate C in the sample?
Note: Since we’re assuming that the voting population is large, it is reasonable and permissible to think of the probabilities as unchanging once a voter is selected for the sample. Technically speaking this is sampling without replacement, so the correct distribution is the multivariate hypergeometric distribution, but the distributions converge as the population grows large in comparison to a fixed sample size.
Properties
Normalization
The multinomial distribution is normalized according to:
.
Expected value and variance
The expected number of times the outcome i was observed over n trials is
The covariance matrix is as follows. Each diagonal entry is the variance of a binomially distributed random variable, and is therefore
The off-diagonal entries are the covariances:
for i, j distinct.
All covariances are negative because for fixed n, an increase in one component of a multinomial vector requires a decrease in another component.
When these expressions are combined into a matrix with i, j the result is a k k positive-semidefinite covariance matrix of rank k1. In the special case where k=n and where the pi are all equal, the covariance matrix is the centering matrix.
The entries of the corresponding correlation matrix are
Note that the number of trials n drops out of this expression.
Each of the k components separately has a binomial distribution with parameters n and pi, for the appropriate value of the subscript i.
The support of the multinomial distribution is the set
Its number of elements is
Matrix notation
with = the row vector transpose of the column vector .
Visualization
As slices of generalized Pascal's triangle
Just like one can interpret the binomial distribution as (normalized) one-dimensional (1D) slices of Pascal's triangle, so too can one interpret the multinomial distribution as 2D (triangular) slices of Pascal's pyramid, or 3D/4D/+ (pyramid-shaped) slices of higher-dimensional analogs of Pascal's triangle. This reveals an interpretation of the range of the distribution: discretized equilateral "pyramids" in arbitrary dimension—i.e. a simplex with a grid.
As polynomial coefficients
Similarly, just like one can interpret the binomial distribution when expanded, noting that just the coefficients must sum up to 1.
Large deviation theory
Asymptotics
By Stirling's formula is the Kullback–Leibler divergence.
This formula can be interpreted as follows.
. It is a simplex.
, the less likely it is to see such an empirical distribution.
, we obtain Sanov's theorem
Concentration at large n
Due to the exponential decay. In this small neighborhood, we can take the first nonzero term in the Taylor expansion This resembles the Gaussian distribution, which suggests the following theorem:
Theorem. converges in distribution to the chi-squared distribution.
is a simplex.
is a constant.
-dimensional plane, we obtain the desired result.
Conditional concentration at large n
The above concentration phenomenon can be easily generalized to the case where we condition upon independent constraints. This is the theoretical justification for Pearson's chi-squared test.
Theorem.
are linearly independent;
;
then for the multinomial distribution conditional on limit.
are equal, this reduces to the concentration of entropies around the maximum entropy.
This theorem can be shown by starting with the previous case, then taking the conditional on the constraints.
Related distributions
In some fields such as natural language processing, categorical and multinomial distributions are synonymous and it is common to speak of a multinomial distribution when a categorical distribution; in this form, a categorical distribution is equivalent to a multinomial distribution over a single trial.
When k = 2, the multinomial distribution is the binomial distribution.
Categorical distribution, the distribution of each trial; for k = 2, this is the Bernoulli distribution.
The Dirichlet distribution is the conjugate prior of the multinomial in Bayesian statistics.
Statistical inference
Equivalence tests for multinomial distributions
The goal of equivalence testing is to establish the agreement between a theoretical multinomial distribution and observed counting frequencies. The theoretical distribution may be a fully specified multinomial distribution or a parametric family of multinomial distributions.
is shown at a given significance level. The equivalence test for Euclidean distance can be found in text book of Wellek (2010). The equivalence test for the total variation distance is developed in Ostrovski (2017). The exact equivalence test for the specific cumulative distance is proposed in Frey (2009).
is usually computed using numerical optimization. The tests for this case are developed recently in Ostrovski (2018).
Confidence intervals for the difference of two proportions
.
for any multinomial distribution. Formulas in the current section will be generalized, while formulas in the next section will focus on the matched-pairs binary data use-case.
Wald's standard error (SE) of the difference of proportion can be estimated using:
approximate confidence interval, the margin of error may incorporate the appropriate quantile from the standard normal distribution, as follows:
) increases, the sample proportions will approximately follow a multivariate normal distribution, thanks to the multidimensional central limit theorem (and it could also be shown using the Cramér–Wold theorem). Therefore, their difference will also be approximately normal. Also, these estimators are weakly consistent and plugging them into the SE estimator makes it also weakly consistent. Hence, thanks to Slutsky's theorem, the pivotal quantity approximately follows the standard normal distribution. And from that, the above approximate confidence interval is directly derived.
The SE can be constructed using the calculus of the variance of the difference of two random variables
A modification which includes a continuity correction to the margin of error as follows:
Another alternative is to rely on a Bayesian estimator using Jeffreys prior which leads to using a dirichlet distribution, with all parameters being equal to 0.5, as a prior. The posterior will be the calculations from above, but after adding 1/2 to each of the k. This was originally developed for a multinomial distribution with four events, and is known as wald+2, for analyzing matched pairs data (see the next section for more details).
This leads to the following SE:
Which can just be plugged into the original Wald formula as follows:
Occurrence and applications
Confidence intervals for the difference in matched-pairs binary data (using multinomial with k=4)
For the case of matched-pairs binary data, a common task is to build the confidence interval of the difference of the proportion of the matched events. For example, we might have a test for some disease, and we may want to check the results of it for some population at two points in time (1 and 2), to check if there was a change in the proportion of the positives for the disease during that time.
Such scenarios can be represented using a two-by-two contingency table with the number of elements that had each of the combination of events. We can use small f, and capital F. These four combinations could be modeled as coming from a multinomial distribution (with four potential outcomes). The sizes of the sample and population can be n and N respectively. And in such a case, there is an interest in building a confidence interval for the difference of proportions from the marginals of the following (sampled) contingency table:. And the difference we want to build confidence intervals for is:
).
Calculating a p-value for such a difference is known as McNemar's test. Building confidence interval around it can be constructed using methods described above for Confidence intervals for the difference of two proportions.
The Wald confidence intervals from the previous section can be applied to this setting, and appears in the literature using alternative notations. Specifically, the SE often presented is based on the contingency table frequencies instead of the sample proportions. For example, the Wald confidence intervals, provided above, can be written as:
Further research in the literature has identified several shortcomings in both the Wald and the Wald with continuity correction methods, and other methods have been proposed for practical application.
One such modification includes Agresti and Min’s Wald+2 (similar to some of their other works added to it. This leads to the Wald+2 confidence intervals. In a Bayesian interpretation, this is like building the estimators taking as prior a dirichlet distribution with all parameters being equal to 0.5 (which is, in fact, the Jeffreys prior). The +2 in the name wald+2 can now be taken to mean that in the context of a two-by-two contingency table, which is a multinomial distribution with four possible events, then since we add 1/2 an observation to each of them, then this translates to an overall addition of 2 observations (due to the prior).
This leads to the following modified SE for the case of matched pairs data:
Which can just be plugged into the original Wald formula as follows:
Other modifications include Bonett and Price’s Adjusted Wald, and Newcombe’s Score.
Computational methods
Random variate generation
such that they are sorted in descending order (this is only to speed up computation and not strictly necessary). Now, for each trial, draw an auxiliary variable X from a uniform (0,1) distribution. The resulting outcome is the component
{Xj = 1, Xk = 0 for k≠j and n=1. A sum of independent repetitions of this experiment is an observation from a multinomial distribution with n equal to the number of such repetitions.
Sampling using repeated conditional binomial samples
, conditioned on any prior samples already taken, repeatedly.
Algorithm: Sequential conditional binomial sampling
Heuristically, each application of the binomial sample reduces the available number to sample from and the conditional probabilities are likewise updated to ensure logical consistency.
Software implementations
The MultinomialCI R package allows the computation of simultaneous confidence intervals for the probabilities of a multinomial distribution given a set of observations.
See also
References
Further reading