Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Lecture 22: Moment Generating Functions & Applications in Statistics - STAT 702/J702 by Br, Study notes of Statistics

A part of the lecture notes from stat 702/j702 course at the university of south carolina, taught by brian habing. The lecture covers the topic of moment generating functions, their properties, and applications. The document also includes examples and an application to intelligent searching and sampling.

Typology: Study notes

Pre 2010

Uploaded on 09/02/2009

koofers-user-a0h
koofers-user-a0h 🇺🇸

10 documents

1 / 4

Toggle sidebar

Related documents


Partial preview of the text

Download Lecture 22: Moment Generating Functions & Applications in Statistics - STAT 702/J702 by Br and more Study notes Statistics in PDF only on Docsity!

STAT 702/J702 B.Habing Univ. of S.C. (^1)

STAT 702/J

November 14 th, 2006

- Lecture 22-

Instructor: Brian Habing Department of Statistics Telephone: 803-777- E-mail: [email protected]

STAT 702/J702 B.Habing Univ. of S.C. (^2)

Today

  • Last Time - Covariance
  • Moment Generating Functions
  • Applications!

STAT 702/J702 B.Habing Univ. of S.C. (^3)

Covariance

Cov(X,Y )=E[(X -μX )(Y -μY )]

STAT 702/J702 B.Habing Univ. of S.C. (^4)

Correlation

Cor(X,Y )= ( ) ( )

( , )

Var XVar Y

Cov XY

ρ XY =

STAT 702/J702 B.Habing Univ. of S.C. (^5)

4.5 – Moment Generating Functions

The moment-generating function

(mgf) of X isM(t )=E(etX^ )

= ∑

x

M ( t ) etX^ p ( x )

= ∫

−∞

M ( t ) etX^ f ( x ) dx

STAT 702/J702 B.Habing Univ. of S.C. (^6)

Why “moment generating”? Assume the mgf exists on some interval around 0…

= ∫

−∞

M ( t ) etX^ f ( x ) dx

= ∫

−∞

e f x dx

dt

d

M '( t ) tX^ ( )

STAT 702/J702 B.Habing Univ. of S.C. (^7)

Other properties: a) The m.g.f. uniquely determines the p.d.f.

b) If Y=a +bX then M Y (t )=eat^ MX (bt )

c) If X and Y are independent and

Z=X+Y then M Z(t )=M X (t ) M Y (t )

STAT 702/J702 B.Habing Univ. of S.C. (^8)

Example 1) X~Uniform[0,1]

MX (t)=

MaX+b(t)=

STAT 702/J702 B.Habing Univ. of S.C. (^9)

Example 2) Sum of Negative Binomials.

for ln( 1 ) [ 1 ( 1 ) ]

( )

( ) t p pe

pe M t t r

tr <− − − −

=

STAT 702/J702 B.Habing Univ. of S.C. (^10)

Application 3: Intelligent Searching and Sampling

a) Group Testing: A large numbern

of blood samples are to be tested for a relatively rare disease. Can we find all the infected samples in

fewer thann tests?

STAT 702/J702 B.Habing Univ. of S.C. (^11)

Consider the case of splitting each of

n samples in half. Combine half of

each one is placed into a large combined pool.

Should this work better?

STAT 702/J702 B.Habing Univ. of S.C. (^12)

Now consider that we divide them

samples intom groups of sizek

each…