Bernoulli experiment a random experiment that
outcome are classified with two mutually exclusive and
exhaustive ways Bernoulli process a sequence of
Bernoulli trials.
Let X be a random variable associated with a Bernoulli trial
The pmf of X is
p(x)=px(1−p)1−x,x=0,1
The expected value is
E[X]=p
The variance is
var(X)=p2(1−p)+(1−p)2p=p(1−p)
Binomial distribution
Binomial random variable
X:
X
= # of sucesses in
n
Bernoulli trials, denoted by
b(n,p)
The pmf of
X
is
p(x)=(xn)px(1−p)n−x,x=0,1,...,n
The mgf:
[t]E(et⋅X)=x=0∑netx(xn)px(1−p)n−x=(1−p+pet)n
The mean and variances:
E(X)=np,Var(X)=np(1−p)
Proof M′(t)=n((1−p)+pet)n−1×petM′′(t)=n(n−1)((1−p)+pet)n−2(p2e2t)+petn((1−p)+pet)n−1
From 1st moment,
μ=M′(0)=np
Also,
σ2=M′′(0)−(M′(0))2=np(1−p)
Example 3.1.4. Weak Law of Large Numbers
Let
Y∼b(n,p). We call
Y/n
the relative frequency of success.
Using the Chebyshev’s inequality (Thm 1.10.3),
for∀ϵ>0,P(∣nY≤ϵ∣)≥ϵ2Var(Y/n)=nϵ2p(1−p)
As such, for every fixed
ϵ, righthand is closed to zero if
n
is sufficiently large.
By equaition,
limn→∞P(∣∣nY−p∣∣≤ϵ)=0
and
limn→∞P(∣∣nY−p∣∣<ϵ)=1
Example 3.1.5.
Therorem 3.1.1. Sum of Binomial Distribution
Let independent random variables
X1,..,Xm
where
Xi∼b(ni,p)fori=1,...,m. Then
Y=∑i=1mXi
has a
b(∑i=1mni,p)
distribution.
Proof
mgf of binomial distribution is
MXi(t)=(1−p+pet)ni.
By independence,
MY(t)=∏i=1m(1−p+pet)ni=(1−p+pet)∑i=1mni
Negative Binomial distribution
Y denote the total number of failures in the sequence before
rth
success.
Y+r equals to the nuber of trials necessary to produce exactly
r successes with the last trial as a success.
Why Negative?:
P(y)
is a general
pmf:
p(y)=(r−1y+r−1)pr(1−p)yy=0,1...
mgf:
M(t)=pr(1−(1−p)et)−rfort<−log(1−p)
Geometric distribution
Y is a number of trials until a success
This is
r=1
case of Negative Binomial distribution
pmf:
p(y)=p(1−p)yy=0,1,2,...
mfg:
M(t)=p(1−(1−p)et)−1
Multi-Nomial distribution
The experiments is held by
k
mutually exclusive and exhaustive ways.
pmf:
X1!⋯Xk!n!p1X1⋯pkXk
where
Xk=n−(X1+⋯+Xk−1)
and
∑i=1kpi=1
mgf:
M(t1,...,tk−1)=(p1et1+⋯+Pk−1etk−1+pk)n
for
t1,...,tk−1∈R
Let N as number of items and D is a number of defective items
amont them. Let X is a number of defective items in a sample of
size n, without replacement.
Binomial distribution is sampling with replacement.
pmf:
p(x)=(nN)(n−xN−D)(xD)
mean:
nND
variance:
nNDNN−DN−1N−n
It has correction term when sampling without replacement.
Poisson Distribution
Poision Process a process that generate a
number of changes in a fixed interval
Reinforcement Learning Agents interact with an Environment
Choose from a set of available actions Actions impact the
environment, which impacts agents...
Leave a comment