Theory 1 - Bernoulli, binomial, geometric, Pascal, uniform

In a Bernoulli process, an experiment with binary outcomes is repeated; for example flipping a coin repeatedly. Several discrete random variables may be defined in the context of some Bernoulli process.

Notice that the sample space of a Bernoulli process is infinite: an outcome is any sequence of trial outcomes, e.g. HTHHTTHHHTTTHHHHTTTT

Bernoulli variable

A random variable Xi is a Bernoulli indicator, written XiBer(p), when Xi indicates whether a success event, having probability p, took place in trial number i of a Bernoulli process.

Bernoulli PMF:

PXi(k)={pk=1qk=00else

Here q=1p.

An RV that always gives either 0 or 1 for every outcome is called an indicator variable.

Binomial variable

A random variable S is binomial, written SBin(n,p), when S counts the number of successes in a Bernoulli process, each having probability p, over a specified number n of trials.

Binomial PMF:

PS(k)=(nk)pk(1p)nkfor k=0,1,2,,n
  • For example, if SBin(10,0.2), then PS(5) gives the odds that success happens exactly 5 times over 10 trials, with probability 0.2 of success for each trial.
  • In terms of the Bernoulli indicators, we have: S=X1+X2++Xn
  • If A is the success event, then p=P[A] is the success probability, and q=1p is the failure probability.

Geometric variable

A random variable N is geometric, written NGeom(p), when N counts the discrete wait time in a Bernoulli process until the first success takes place, given that success has probability p in each trial.

Geometric PMF:

PN(k)=qk1pfor k=1,2,3,

Here q=1p.

  • For example, if NGeom(30%), then PN(7) gives the probability of getting: failure on the first 6 trials AND success on the 7th trial.

Pascal variable

A random variable L is Pascal, written LPasc(,p), when L counts the discrete wait time in a Bernoulli process until success happens times, given that success has probability p in each trial.

Pascal PMF:

PL(k)=(k11)(1p)kpfor k=,+1,+2,
  • For example, if LPasc(3,0.25), then PL(8) gives the probability of getting: the 3rd success on (precisely) the 8th trial.
  • Interpret the formula: # ways to arrange 2 successes among 7 ‘prior’ trials, times the probability of exactly 3 successes and 5 failures in one specific sequence.
  • The Pascal distribution is also called the negative binomial distribution, e.g. LNegbin(,p).

Uniform variable

A discrete random variable X is uniform on a finite set AS, written XUnif(A), when the probability is a fixed constant for outcomes in A and zero for outcomes outside A.

Discrete uniform PMF:

PX(k)={1|A|when kA0when kA

Continuous uniform PDF:

fX(x)={1P[A]when xA0when xA