Theory 1

Memorize this info!

Bernoulli: XBer(p)

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

Binomial: XBin(n,p)

  • Counts number of wins.
  • PX(k)=(nk)pkqnk
  • E[X]=np
  • Var[X]=npq
  • These are n times the Bernoulli numbers.

Geometric: XGeom(p)

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

Pascal: XPasc(,p)

  • Counts discrete wait time until th win.
  • PX(k)=(k11)qkp
  • E[X]=p
  • Var[X]=qp2
  • These are times the Geometric numbers.

Poisson: XPois(λ)

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

Theory 2

Uniform: XUnif([a,b])

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

Exponential: XExp(λ)

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

Erlang: XErlang(,λ)

  • Measures wait time until th arrival.
  • fX(t)=λ(1)!t1eλ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