AP Statistics Curriculum 2007 Distrib Dists
From Socr
(→Geometric) 
(→Geometric) 

Line 6:  Line 6:  
*Mass Function: If the probability of successes on each trial is P(success)=p, then the probability that x trials are needed to get one success is <math>P(X = x) = (1  p)^{x1} \times p</math>, for x = 1, 2, 3, 4,....  *Mass Function: If the probability of successes on each trial is P(success)=p, then the probability that x trials are needed to get one success is <math>P(X = x) = (1  p)^{x1} \times p</math>, for x = 1, 2, 3, 4,....  
  * Expectation: The [[AP_Statistics_Curriculum_2007_Distrib_MeanVar  Expected Value]] of a geometrically distributed random variable ''X'' is <math>{1\over p}.</math>  +  * Expectation: The [[AP_Statistics_Curriculum_2007_Distrib_MeanVar  Expected Value]] of a geometrically distributed random variable ''X'' is <math>{1\over p}.</math> This is because [http://en.wikipedia.org/wiki/Geometric_progression geometric series have this property]: 
+  :<math>\sum_{k=0}^{n} p(1p)^k = p(1p)^0+p(1p)^1+p(1p)^2+p(1p)^3+\cdots+p(1p)^n.</math>  
+  : Let r=(1p), then p=(1r) and <math>\sum_{k=0}^{n} p(1p)^k = \begin{align}  
+  (1r) \sum_{k=0}^{n} r^k & = (1r)(r^0 + r^1+r^2+r^3+\cdots+r^n) \\  
+  & = r^0 + r^1+r^2+r^3+\cdots+r^n \\  
+  & ( r^1+r^2+r^3+\cdots +r^n + r^{n+1}) \\  
+  & = r^0  r^{n+1} = 1  r^{n+1}.  
+  \end{align}</math>  
+  : Thus: <math>\sum_{k=0}^{n} p(1p)^k = \frac{p  pr^{n+1}}{1r} = 1pr^{n+1},</math> which converges to 1, as <math>n\longrightarrow \infty,</math>, and hence the above geometric density is well defined.  
+  
+  : Denote the geometric expectation by E = E(X) = <math>\sum_{k=0}^{\infty} kpr^k</math>, where r=1p. Then <math>pE = E  (1p)E = \sum_{k=0}^{\infty} kpr^k  (\sum_{k=0}^{\infty} kpr^{k+1})=</math> <math>\sum_{k=0}^{\infty} pr^k = 1</math>. Therefore, <math>E = \frac{1}{p}</math>.  
*Variance: The [[AP_Statistics_Curriculum_2007_Distrib_MeanVar  Variance]] is <math>{1p\over p^2}.</math>  *Variance: The [[AP_Statistics_Curriculum_2007_Distrib_MeanVar  Variance]] is <math>{1p\over p^2}.</math>  
Line 12:  Line 22:  
*Example: See [[SOCR_EduMaterials_Activities_Binomial_Distributions  this SOCR Geometric distribution activity]].  *Example: See [[SOCR_EduMaterials_Activities_Binomial_Distributions  this SOCR Geometric distribution activity]].  
  * The Geometric distribution gets its name because its probability mass function is a geometric progression. It is the discrete analogue of the Exponential distribution and also known as Furry distribution.  +  * The Geometric distribution gets its name because its probability mass function is a [http://en.wikipedia.org/wiki/Geometric_progression geometric progression]. It is the discrete analogue of the Exponential distribution and also known as Furry distribution. 
===HyperGeometric===  ===HyperGeometric=== 
Revision as of 20:10, 7 May 2010
Contents 
General AdvancePlacement (AP) Statistics Curriculum  Geometric, HyperGeometric, Negative Binomial Random Variables and Experiments
Geometric
 Definition: The Geometric Distribution is the probability distribution of the number X of Bernoulli trials needed to get one success, supported on the set {1, 2, 3, ...}. The name geometric is a direct derivative from the mathematical notion of geometric series.
 Mass Function: If the probability of successes on each trial is P(success)=p, then the probability that x trials are needed to get one success is , for x = 1, 2, 3, 4,....
 Expectation: The Expected Value of a geometrically distributed random variable X is This is because geometric series have this property:
 Let r=(1p), then p=(1r) and
 Thus: which converges to 1, as , and hence the above geometric density is well defined.
 Denote the geometric expectation by E = E(X) = , where r=1p. Then . Therefore, .
 Variance: The Variance is
 Example: See this SOCR Geometric distribution activity.
 The Geometric distribution gets its name because its probability mass function is a geometric progression. It is the discrete analogue of the Exponential distribution and also known as Furry distribution.
HyperGeometric
The hypergeometric distribution is a discrete probability distribution that describes the number of successes in a sequence of n draws from a finite population without replacement. An experimental design for using Hypergeometric distribution is illustrated in this table:
Type  Drawn  NotDrawn  Total 
Defective  k  mk  m 
NonDefective  nk  N+knm  Nm 
Total  n  Nn  N 
 Explanation: Suppose there is a shipment of N objects in which m are defective. The Hypergeometric Distribution describes the probability that in a sample of n distinctive objects drawn from the shipment exactly k objects are defective.
 Mass function: The random variable X follows the Hypergeometric Distribution with parameters N, m and n, then the probability of getting exactly k successes is given by
This formula for the Hypergeometric Mass Function may be interpreted as follows: There are possible samples (without replacement). There are ways to obtain k defective objects and there are ways to fill out the rest of the sample with nondefective objects.
The mean and variance of the hypergeometric distribution have the following closed forms:
 Mean:
 Variance:
Examples
 SOCR Activity: The SOCR Ball and Urn Experiment provides a handson demonstration of the utilization of Hypergeometric distribution in practice. This activity consists of selecting n balls at random from an urn with N balls, R of which are red and the other N  R green. The number of red balls Y in the sample is recorded on each update. The distribution and moments of Y are shown in blue in the distribution graph and are recorded in the distribution table. On each update, the empirical density and moments of Y are shown in red in the distribution graph and are recorded in the distribution table. Either of two sampling models can be selected with the list box: with replacement and without replacement. The parameters N, R, and n can be varied with scroll bars.
 A lake contains 1,000 fish; 100 are randomly caught and tagged. Suppose that later we catch 20 fish. Use SOCR Hypergeometric Distribution to:
 Compute the probability mass function of the number of tagged fish in the sample of 20.
 Compute the expected value and the variance of the number of tagged fish in this sample.
 Compute the probability that this random sample contains more than 3 tagged fish.
 Hypergeometric distribution may also be used to estimate the population size: Suppose we are interested in determining the population size. Let N = number of fish in a particular isolated region. Suppose we catch, tag and release back M=200 fish. Several days later, when the fish are randomly mixed with the untagged fish, we take a sample of n=100 and observe m=5 tagged fish. Suppose p=200/N is the population proportion of tagged fish. Notice that when sampling fish we sample without replacement. Thus, hypergeometric is the exact model for this process. Assuming the samplesize (n) is < 5% of the population size(N), we can use binomial approximation to hypergeometric. Thus if the sample of n=100 fish had 5 tagged, the sampleproportion (estimate of the population proportion) will be . Thus, we can estimate that , and , as shown on the figure below.
 You can also see a manual calculation example using the hypergeometric distribution here.
Negative Binomial
The family of Negative Binomial Distributions is a twoparameter family; p and r with 0 < p < 1 and r > 0. There are two (identical) combinatorial interpretations of Negative Binomial processes (X or Y).
X=Trial index (n) of the r^{th} success, or Total # of experiments (n) to get r successes
 Probability Mass Function: , for n = r,r+1,r+2,.... (n=trial number of the r^{th} success)
 Mean:
 Variance:
Y = Number of failures (k) to get r successes
 Probability Mass Function: , for k = 0,1,2,.... (k=number of failures before the r^{th} successes)
 , the probability of k failures and r successes in n=k+r Bernoulli(p) trials with success on the last trial.
 Mean: .
 Variance: .
 Note that X = Y + r, and E(X) = E(Y) + r, whereas VAR(X)=VAR(Y).
SOCR Negative Binomial Experiment
Application
Suppose Jane is promoting and fundraising for a presidential candidate. She wants to visit all 50 states and she's pledged to get all electoral votes of 6 states before she and the candidate she represents are satisfied. In every state, there is a 30% chance that Jane will be able to secure all electoral votes and 70% chance that she'll fail.
 What's the probability mass function of the number of failures (k=nr) to get r=6 successes?
 In other words, What's the probability mass function that the last 6^{th} state she succeeds to secure all electoral votes happens to be the at the n^{th} state she campaigns in?
NegBin(r, p) distribution describes the probability of k failures and r successes in n=k+r Bernoulli(p) trials with success on the last trial. Looking to secure the electoral votes for 6 states means Jane needs to get 6 successes before she (and her candidate) is happy. The number of trials (i.e., states visited) needed is n=k+6. The random variable we are interested in is X={number of states visited to achieve 6 successes (secure all electoral votes within these states)}. So, n = k+6, and . Thus, for , the mass function (giving the probabilities that Jane will visit n states before her ultimate success is:
 What's the probability that Jane finishes her campaign in the 10^{th} state?
 Let , then
 What's the probability that Jane finishes campaigning on or before reaching the 8^{th} state?
 Suppose the success of getting all electoral votes within a state is reduced to only 10%, then X~NegBin(r=6, p=0.1). Notice that the shape and domain the NegativeBinomial distribution significantly chance now (see image below)!
 What's the probability that Jane covers all 50 states but fails to get all electoral votes in any 6 states (as she had hoped for)?
 SOCR Activity: If you want to see an interactive NegativeBinomial Graphical calculator you can go to this applet (select Negative Binomial) and see this activity.
Negative Multinomial Distribution (NMD)
The Negative Multinomial Distribution is a generalization of the twoparameter Negative Binomial distribution (NB(r,p)) to outcomes. Suppose we have an experiment that generates possible outcomes, , each occurring with probability , respectively, where with 0 < p_{i} < 1 and . That is, . If the experiment proceeds to generate independent outcomes until occur exactly times, then the distribution of the mtuple is Negative Multinomial with parameter vector . Notice that the degreeoffreedom here is actually m, not (m+1). That is why we only have a probability parameter vector of size m, not (m+1), as all probabilities add up to 1 (so this introduces one relation). Contrast this with the combinatorial interpretation of Negative Binomial (special case with m=1):
 X˜NegativeBinomial(NumberOfSuccesses = r,ProbOfSuccess = p),
 X=Total # of experiments (n) to get r successes (and therefore nr failures);
 X˜NegativeMultinomial(k_{0},{p_{0},p_{1}}),
 X=Total # of experiments (n) to get k_{0} (default variable) and n − k_{0} outcomes of 1 other possible outcome (X_{1}).
Negative Multinomial Summary
 Probability Mass Function: , or equivalently:
 , where Γ(x) is the Gamma function.
 Mean (vector): .
 VarianceCovariance (matrix): Cov(X_{i},X_{j}) = {cov[i,j]}, where
 .
Cancer Example
The Probability Theory Chapter of the EBook shows the following example using 400 Melanoma (skin cancer) Patients where the Type and Site of the cancer are recorded for each subject, as in the Table below.
Type  Site  Totals  
Head and Neck  Trunk  Extremities  
Hutchinson's melanomic freckle  22  2  10  34 
Superficial  16  54  115  185 
Nodular  19  33  73  125 
Indeterminant  11  17  28  56 
Column Totals  68  106  226  400 
The sites (locations) of the cancer may be independent, but there may be positive dependencies of the type of cancer for a given location (site). For example, localized exposure to radiation implies that elevated level of one type of cancer (at a given location) may indicate higher level of another cancer type at the same location. We want to use the Negative Multinomial distribution to model the sites cancer rates and try to measure some of the cancer type dependencies within each location.
Let's denote by x_{i,j} the cancer rates for each site () and each type of cancer (). For each (fixed) site (), the cancer rates are independent Negative Multinomial distributed random variables. That is, for each column index (site) the columnvector X has the following distribution:
 X = {X_{1},X_{2},X_{3}}˜NMD(k_{0},{p_{1},p_{2},p_{3}}).
Different columns (sites) are considered to be different instances of the random multinomially distributed vector, X. Then we have the following estimates:
 MLE estimate of the Mean: is given by:

 Example:
 VarianceCovariance: For a single column vector, X = {X_{1},X_{2},X_{3}}˜NMD(k_{0},{p_{1},p_{2},p_{3}}), covariance between any pair of Negative Multinomial counts (X_{i} and X_{j}) is:
 .
 Example: For the first site (Head and Neck, j=0), suppose that and X˜NMD(k_{0} = 10,{p_{1} = 0.2,p_{2} = 0.1,p_{3} = 0.2}). Then:
 NMD(X  k_{0},{p_{1},p_{2},p_{3}}) = 0.00465585119998784
 and therefore,
 You can also use the interactive SOCR negative multinomial distribution calculator to compute these quantities, as shown on the figure below.
 There is no MLE estimate for the NMD k_{0} parameter (see this reference). However, there are approximate protocols for estimating the k_{0} parameter, see the example below.
 Correlation: correlation between any pair of Negative Multinomial counts (X_{i} and X_{j}) is:
 .
 The marginal distribution of each of the X_{i} variables is negative binomial, as the X_{i} count (considered as success) is measured against all the other outcomes (failure). But jointly, the distribution of is negative multinomial, i.e., .
Notice that the pairwise NMD correlations are always positive, where as the correlations between multinomail counts are always negative. Also note that as the parameter k_{0} increases, the paired correlations go to zero! Thus, for large k_{0}, the Negative Multinomial counts X_{i} behave as independent Poisson random variables with respect to their means .
Parameter estimation
 Estimation of the mean (expected) frequency counts (μ_{j}) of each outcome (X_{j}):
 The MLE estimates of the NMD mean parameters μ_{j} are easy to compute.
 If we have a single observation vector , then
 If we have several observation vectors, like in this case we have the cancer type frequencies for 3 different sites, then the MLE estimates of the mean counts are , where is the cancertype index and the summation is over the number of observed (sampled) vectors (I).
 For the cancer data above, we have the following MLE estimates for the expectations for the frequency counts:
 Hutchinson's melanomic freckle type of cancer (X_{0}) is .
 Superficial type of cancer (X_{1}) is .
 Nodular type of cancer (X_{2}) is .
 Indeterminant type of cancer (X_{3}) is .
 Estimation of the k_{0} (gamma) parameter:
 There is no MLE for the k_{0} parameter; however, there is a protocol for estimating k_{0} using the chisquared goodness of fit statistic. In the usual chisquared statistic:
 , we can replace the expectedmeans (μ_{i}) by their estimates, , and replace denominators by the corresponding negative multinomial variances. Then we get the following test statistic for negative multinomial distributed data:
 .
 Now we can derive a simple method for estimating the k_{0} parameter by varying the values of k_{0} in the expression Χ^{2}(k_{0}) and matching the values of this statistic with the corresponding asymptotic chisquared distribution. The following protocol summarizes these steps using the cancer data above:
 DF: The degree of freedom for the Chisquare distribution in this case is:
 df = (# rows – 1)(# columns – 1) = (31)*(41) = 6
 Median: The median of a chisquared random variable with 6 df is 5.261948.
 Mean Counts Estimates: The mean counts estimates (μ_{j}) for the 4 different cancer types are:
 ; ; and .
 Thus, we can solve the equation above Χ^{2}(k_{0}) = 5.261948 for the single variable of interest  the unknown parameter k_{0}. Suppose we are using the same example as before, x = {x_{1} = 5,x_{2} = 1,x_{3} = 5}. Then the solution is an asymptotic chisquared distribution driven estimate of the parameter k_{0}.
. Solving this equation for k_{0} provides the desired estimate for the last parameter.
 Mathematica provides 3 distinct (k_{0}) solutions to this equation: {50.5466, 21.5204, 2.40461}. Since k_{0} > 0 there are 2 candidate solutions.
 Estimates of Probabilities: Assume k_{0} = 2 and , we have:
 20p_{0} = p_{2}
 9p_{0} = p_{3}
 Hence, 1 − p_{0} = p_{1} + p_{2} + p_{3} = 60p_{0}. Therefore, , , and .
 Therefore, the best model distribution for the observed sample x = {x_{1} = 5,x_{2} = 1,x_{3} = 5} is
 Notice that in this calculation, we explicitely used the complete cancer data table, not only the sample x = {x_{1} = 5,x_{2} = 1,x_{3} = 5}, as we need multiple samples (multiple sites or columns) to estimate the k_{0} parameter.
SOCR Negative Multinomial Distribution Calculator
Problems
References
 NegativeBinomial Activity
 Le Gall, F. The modes of a negative multinomial distribution, Statistics & Probability Letters, 2005.
 Johnson et al., 1997 Johnson, N.L., Kotz, S., Balakrishnan, N., 1997. Discrete Multivariate Distributions. Wiley Series in Probability and Mathematical Statistics.
 Kotz and Johnson, 1982 In: S. Kotz and N.L. Johnson, Editors, Encyclopedia of Statistical Sciences, Wiley, New York (1982).
 SOCR Home page: http://www.socr.ucla.edu
Translate this page: