Theory 1

Bernoulli: X∼Ber(p)

  • Indicates a win.
  • PX(1)=p,PX(0)=q
  • E[X]=p
  • Var[X]=pq

Binomial: X∼Bin(n,p)

  • Counts number of wins.
  • PX(k)=(nk)pkqn−k
  • E[X]=np
  • Var[X]=npq

Geometric: X∼Geom(p)

  • Counts discrete wait time until first win.
  • PX(k)=qk−1p
  • E[X]=1p
  • Var[X]=qp2

Pascal: X∼Pasc(ℓ,p)

  • Counts discrete wait time until ℓth win.
  • PX(k)=(k−1ℓ−1)qk−ℓpℓ
  • E[X]=ℓp
  • Var[X]=ℓqp2

Poisson: X∼Pois(λ)

  • Counts “arrivals” during time interval.
  • PX(k)=e−λλkk!
  • E[X]=λ
  • Var[X]=λ