Theory 1

Memorize this info!

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
  • These are n times the Bernoulli numbers.

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
  • These are ℓ times the Geometric numbers.

Poisson: X∼Pois(λ)

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

Theory 2

Uniform: X∼Unif([a,b])

  • All times a≤t≤b equally likely.
  • fX(t)=1b−a
  • E[X]=a+b2
  • Var[X]=112(b−a)2

Exponential: X∼Exp(λ)

  • Measures wait time until first arrival.
  • fX(t)=λe−λt
  • E[X]=1λ
  • Var[X]=1λ2

Erlang: X∼Erlang(ℓ,λ)

  • Measures wait time until ℓth arrival.
  • fX(t)=λℓ(ℓ−1)!tℓ−1e−λt
  • E[X]=ℓλ
  • Var[X]=ℓλ2

Normal: X∼𝒩(μ,σ2)

  • Limiting distribution of large sums.
  • fX(x)=12πσ2e−(x−μ)2/2σ2
  • E[X]=μ
  • Var[X]=σ2