MATH 2421: Lecture 24
Date: 2024-11-27 11:59:13
Reviewed:
Topic / Chapter:
summary
❓Questions
Notes
Limit Theorem
-
Laws of large numbers
- weak law of large numbers: for iid r.v. w/ common mean
- then, for any
- proof: under additional assumption
- assumption: r.v. w/ finite variance , it's given that
- from Chebyshev's inequality:
- weak law of large numbers: for iid r.v. w/ common mean
-
Applications
- casino games
- in long run / repetition: casino's profit = expected value of gambling
- e.g. 1/381 cost per trial
- insurance
- polling: estimating opinions of a large population
- stock market: average return converge to the historical average
- casino games
-
Central limit theorem
- 👨🏫 one of the most remarkable result
- stating: sum of large no. of indep. r.v.: follows approximately normal dist.
- not only a simple method for approximation of sum
- but also explaining remarkable fact for empirical freq.
- of natural population exhibiting bell-shape curves
- stating: sum of large no. of indep. r.v.: follows approximately normal dist.
- central limit theorem: w/ iid r.v. w/
- distribution of:
- tends to standard normal as :
- LHS: CDF, RHS:
- thus:
- examples
- human heigh, IS, test scores, blood pressure, etc.
- remarks: while the theorem itself is also important
- discoveries made on the way to the theorem were also significant
- : can be approximated by normal distribution as:
- it's sum of iid Bernoulli r.v.
- 👨🏫 one of the most remarkable result
-
Examples
- w/ independent r.v.
- each w/ uniform distribution over
- calculate: approximation to
- no. of students enrolling in a psychology class: Poisson r.v. w/
- prof. in charge: will teach the course in 2 sessions, if 120 or more enrolls
- what's the probability of teaching 2 sessions?
-
- exact answer, but we might better approximate
- w/ iid and
- normal approximation: w/ of independent uniformly distributed r.v. over
- estimate / upper bound:
- use Markov's inequality to obtain an upper bound
- use Chebyshev's inequality to obtain an upper bound
- use Central Limit Theorem to approximate
- although Markov and Chebyshev's upper bound is not very tight, it's widely used
- w/ independent r.v.
-
Strong law of large numbers
- best-known result in probability theory
- strong law of large numbers
- w/ a seq. of iid r.v.
- each w/ finite mean
- then, w/ probability 1:
- alternatively:
- w/ a seq. of iid r.v.
-
Example
- suppose: seq. of independent trials of some experiment
- let : fixed event of experiment
- let : chance of occurring on any particular trial
- let:
- w/ Strong law of large numbers, w/
- : corresponds to proportion of time occurs in first trials
- thus: interpret the result as:
- w/ , limiting proportion of times that occurs:
- let : fixed event of experiment
- suppose: seq. of independent trials of some experiment
Final exam remarks
-
Remarks
- Dec. 9th, 12:30 - 2:30 (2 hr)
- TST Sports Ctr Arena (Seafront)
- covers: Ch. 5-8 (from continuous r.v.)
- yet, Ch. 1-4 might be implicitly included
- e.g. famous discrete distributions from Ch. 4
- Be, Bin, Geom, Poisson
- e.g. famous discrete distributions from Ch. 4
- yet, Ch. 1-4 might be implicitly included
- conditional variance: only concept is required
- join distribution of r.v. / joint MFG is not covered in final
- 👨🏫 Beta, Gamma, Cauchy, etc. won't be major component
- exam format
- each question: 20 pt,
- w/ possible subproblems
- 6 questions
- 1 A4 size 2 sided cheat sheet allowed
- normal table: provided
- same as one in past papers
- calculator: anything without internet access
- Dec. 9th, 12:30 - 2:30 (2 hr)
-
Some policies
- seating plan to be released
- bring your SID, calculator, cheat sheet, etc.
Ch. 7 Revision
-
Example
- mean of hypergeometric:
- balls chosen randomly from an urn w/ balls, where are white
- find: expected number of white balls selected
- find: variance of white balls selected
- for
- mean of hypergeometric: