# Geometric distribution

*34,202*pages on

this wiki

## Ad blocker interference detected!

### Wikia is a free-to-use site that makes money from advertising. We have a modified experience for viewers using ad blockers

Wikia is not accessible if you’ve made further modifications. Remove the custom ad blocker rule(s) and the page will load as expected.

Assessment |
Biopsychology |
Comparative |
Cognitive |
Developmental |
Language |
Individual differences |
Personality |
Philosophy |
Social |

Methods |
Statistics |
Clinical |
Educational |
Industrial |
Professional items |
World psychology |

**Statistics:**
Scientific method ·
Research methods ·
Experimental design ·
Undergraduate statistics courses ·
Statistical tests ·
Game theory ·
Decision theory

Probability mass function | |

Cumulative distribution function | |

Parameters
| success probability (real) |

Support
| |

Template:Probability distribution/link mass
| |

cdf
| |

Mean
| |

Median
| (not unique if is an integer) |

Mode
| 1 |

Variance
| |

Skewness
| |

Kurtosis
| |

Entropy
| |

mgf
| |

Char. func.
| (where ) |

In probability theory and statistics, the **geometric distribution** is either of two discrete probability distributions:

- the probability distribution of the number
*X*of Bernoulli trials needed to get one success, supported on the set { 1, 2, 3, ...}, or

- the probability distribution of the number
*Y*=*X*− 1 of failures before the first success, supported on the set { 0, 1, 2, 3, ... }.

Which of these one calls "the" geometric distribution is a matter of convention and convenience.

If the probability of success on each trial is *p*_{1}, then the probability that *k* trials are needed to get one success is

for *k* = 1, 2, 3, ....

Equivalently, if the probability of success on each trial is *p*_{0}, then the probability that there are *k* failures before the first success is

for *k* = 0, 1, 2, 3, ....

In either case, the sequence of probabilities is a geometric sequence.

For example, suppose an ordinary die is thrown repeatedly until the first time a "1" appears. The probability distribution of the number of times it is thrown is supported on the infinite set { 1, 2, 3, ... } and is a geometric distribution with *p*_{1} = 1/6.

## Moments and cumulantsEdit

The expected value of a geometrically distributed random variable *X* is and the variance is :

Equivalently, an expected value of the geometrically distributed random variable *Y* is , and its variance is :

Let be the expected value of *Y*. Then the cumulants of the probability distribution of *Y* satisfy the recursion

## Parameter estimationEdit

For both variants of the geometric distribution, the parameter *p* can be estimated by equating the expected value with the sample mean. This is the method of moments, which in this case happens to yield maximum likelihood estimates of *p*.

Specifically, for the first variant let be a sample where for . Then *p*_{1} can be estimated as

In Bayesian inference, the Beta distribution is the conjugate prior distribution for the parameter *p*_{1}. If this parameter is given a Beta(*α*, *β*) prior, then the posterior distribution is

The posterior mean approaches the maximum likelihood estimate as *α* and *β* approach zero.

In the alternative case, let be a sample where for . Then *p*_{0} can be estimated as

The posterior distribution of *p*_{0} given a Beta(*α*, *β*) prior is

Again the posterior mean approaches the maximum likelihood estimate as *α* and *β* approach zero.

## Other propertiesEdit

- The probability-generating functions of
*X*and*Y*are, respectively,

- Like its continuous analogue (the exponential distribution), the geometric distribution is memoryless. That means that if you intend to repeat an experiment until the first success, then, given that the first success has not yet occurred, the conditional probability distribution of the number of additional trials does not depend on how many failures have been observed. The die one throws or the coin one tosses does not have a "memory" of these failures. The geometric distribution is in fact the only memoryless discrete distribution.

- Among all discrete probability distributions supported on {1, 2, 3, ... } with given expected value μ, the geometric distribution
*X*with parameter*p*_{1}= 1/μ is the one with the largest entropy.

- The geometric distribution of the number
*Y*of failures before the first success is infinitely divisible, i.e., for any positive integer*n*, there exist independent identically distributed random variables*Y*_{1}, ...,*Y*_{n}whose sum has the same distribution that*Y*has. These will not be geometrically distributed unless*n*= 1; they follow a negative binomial distribution.

- The decimal digits of the geometrically distributed random variable
*Y*are a sequence of independent (and*not*identically distributed) random variables. For example, the hundreds digit*D*has this probability distribution:

- where
*q*= 1 −*p*_{1}, and similarly for the other digits, and, more generally, similarly for numeral systems with other bases than 10. When the base is 2, this shows that a geometrically distributed random variable can be written as a sum of independent random variables whose probability distributions are indecomposable.

## Related distributionsEdit

- The geometric distribution
*Y*is a special case of the negative binomial distribution, with*r*= 1. More generally, if*Y*_{1},...,*Y*_{r}are independent geometrically distributed variables with parameter*p*_{1}, then

- follows a negative binomial distribution with parameters
*r*and*p*_{1}.

- If
*Y*_{1},...,*Y*_{r}are independent geometrically distributed variables (with possibly different success parameters ), then their minimum

- is also geometrically distributed, with parameter
*p*_{1}given by

- Suppose 0 <
*r*< 1, and for*k*= 1, 2, 3, ... the random variable*X*_{k}has a Poisson distribution with expected value*r*^{k}/*k*. Then

- has a geometric distribution taking values in the set {0, 1, 2, ...}, with expected value
*r*/(1 −*r*).

## External linksEdit

{

This page uses Creative Commons Licensed content from Wikipedia (view authors). |