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)=(kn)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]=p1
- Var[X]=p2q
Pascal: X∼Pasc(ℓ,p)
- Counts discrete wait time until ℓth win.
- PX(k)=(ℓ−1k−1)qk−ℓpℓ
- E[X]=pℓ
- Var[X]=p2ℓq
Poisson: X∼Pois(λ)
- Counts “arrivals” during time interval.
- PX(k)=e−λk!λk
- E[X]=λ
- Var[X]=λ