Discrete Random Variables
Properties
Probability Mass Function
- Describes the distribution of a discrete random variable
- pX(x)=P(X=x) for every x∈X
- Properties
Cumulative Distribution Function
- The culmination of the random values up to a point
- FX(b)=P(X≤b) for all b∈R
- FX(b)=x∈X:x≤b∑pX(x)
Discrete Expectation
- E(X)=x∈X∑xpX(x)
- If X is a discrete random random variable and g:R→R then E[g(X)]=x∈X∑g(x)pX(x)
- Note: E(X) is only well defined if x∈X∑∣x∣pX(x)<∞
- If X is not a finite space, make sure the absolute expectation is finite
Distributions
Bernoulli
- Bernoulli Experiment/Trial = an experiment with 2 possible outcomes (success/failure)
- Define X to be 1 on success and 0 on failure
- Parameter p is the probability of success
- A random variable is Bernoulli if the only parameter needed is p
- Properties
Binomial
- X = number of total successes in n independent Bernoulli trials
- Properties
- pX(x)=(xn)px(1−p)n−x
- E(X)=np
- V(X)=np(1−p)
Geometric
- X = number of failures before a success in repeated Bernoulli trials
- Properties
- pX(x)=p(1−p)x
- FX(x)=1−(1−p)x+1
- E(x)=p1−p
- V(x)=p21−p
- Memoryless Property
- If there have been j failures, the odds of having k more failures is the same as starting fresh and having k failures
- P(X≥j+k∣X≥j)=P(X≥k)
- Only type of discrete random variable with this property
Negative Binomial
- X = number of failures before kth success in repeated Bernoulli trials
- Properties
- pX(x)=(xx+k−1)pk(1−p)x
- E(x)=kp1−p
- V(x)=kp21−p
- Can be expressed as the sum of k geometric random variables
Possion
- Defined as the limit of the binomial distribution when n→∞,p→0,np→λ>0
- Parameter is λ (the mean)
- Useful for modeling rare events
- Properties
- pX(x)=x!e−λλx
- E(X)=λ
- V(X)=λ
- The variance and expected values being the same makes this less useful
Hypergeometric
- Sampling with replacement
- Bernoulli trials are sampling with replacement
- N items. k type 1 and N−k type 2. n chosen
- X = number of type 1 items in the n chosen
- Properties
- pX(x)=(nN)(xk)(n−xN−k),x=0…k
- E(X)=Nnk
- V(X)=nNk(1−Nk)(N−1N−n)
- Binomial Approximation
- As N→∞ and Nk→p, pX(x)→(xn)px(1−p)n−x
- Hence, if N is very large, it can be approximated by a binomial random variable with parameters n and p=k/n