# Connection Between Hypergeometric Distribution and Series

### What’s the connection between the hypergeometric distributions, hypergeometric functions, and hypergeometric series?

· Big Data Zone · Opinion
Save
4.00K Views

the hypergeometric distribution is a probability distribution with parameters n , m , and n . suppose you have an urn containing n balls, m red and the rest, n m blue and you select n balls at a time. the hypergeometric distribution gives the probability of selecting k red balls.

the probability generating function for a discrete distribution is the series formed by summing over the probability of an outcome k and x k . so the probability generating function for a hypergeometric distribution is given by the summation is over all integers, but the terms are only non-zero for k between 0 and m inclusive. (this may be more general than the definition of binomial coefficients you’ve seen before. if so, see these notes on the general definition of binomial coefficients .)

it turns out that f is a hypergeometric function of x because it is can be written as a hypergeometric series . (strictly speaking, f is a constant multiple of a hypergeometric function. more on that in a moment.)

a hypergeometric function is defined by a pattern in its power series coefficients. the hypergeometric function f ( a, b ; c ; x ) has a the power series where ( n ) k is the k th rising power of n . it’s a sort of opposite of factorial. start with n and multiply consecutive increasing integers for k terms. ( n ) 0 is an empty product , so it is 1. ( n ) 1 = n , ( n ) 2 = n ( n +1), etc.

if the ratio of the k +1st term to the k th term in a power series is a polynomial in k , then the series is a (multiple of) a hypergeometric series, and you can read the parameters of the hypergeometric series off the polynomial. this ratio for our probability generating function works out to be: and so the corresponding hypergeometric function is f (- m , – n ; n m n + 1; x ). the constant term of a hypergeometric function is always 1, so evaluating our probability generating function at 0 tells us what the constant is multiplying f (- m , – n ; n m n + 1; x ). now: and so: the hypergeometric series above gives the original hypergeometric function as defined by gauss, and may be the most common form in application. but the definition has been extended to have any number of rising powers in the numerator and denominator of the coefficients. the classical hypergeometric function of gauss is denoted 2 f 1 because it has two falling powers on top and one on bottom. in general, the hypergeometric function p f q has p rising powers in the denominator and q rising powers in the denominator.

the cdf of a hypergeometric distribution turns out to be a more general hypergeometric function: where a = 1, b = k +1- m , c = k +1- n , d = k +2, and e = n + k +2- m n .

thanks to jan galkowski for suggesting this topic via a comment on an earlier post, hypergeometric bootstrapping .

Topics:
simulation, statistics, contest

Published at DZone with permission of John Cook, DZone MVB.

Opinions expressed by DZone contributors are their own.