Poisson approximations
|
|
- Duane Atkinson
- 5 years ago
- Views:
Transcription
1 The Bi, p) ca be thought of as the distributio of a sum of idepedet idicator radom variables X X, with {X i = } deotig a head o the ith toss of a coi. The ormal approximatio to the Biomial works best whe the variace p p) is large, for the each of the stadardized summads X i p)/ p p) makes a relatively small cotributio to the stadardized sum. Whe is large but p is small, i such a way that p is ot too large, a differet type of approximatio to the Biomial is better. Defiitio. A radom variable Y is said to have a Poisso distributio with parameter λ if it ca take values i N 0, the set of oegative itegers, with probabilities P{Y = k} = e λ λ k for k = 0,, 2,... The parameter λ must be positive. The distributio is deoted by Poissoλ). Throughout this Chapter I will use Q λ to deote the Poissoλ) distributio. That is, Q λ is a probability distributio cocetrated o N 0 for which Q λ {k} = e λ λ k for k = 0,, 2,... Example <8.>: Poissop) approximatio to the Biomial, p) The Poisso iherits several properties from the Biomial. For example, the Bi, p) has expected value p ad variace p p). Oe might suspect that the Poissoλ) should therefore have expected value λ = λ/) ad variace λ = lim λ/) λ/). Also, the coi-tossig origis of the Biomial show that if X has a Bim, p) distributio ad Y has a Bi, p) distributio idepedet of X, the X + Y has a Bi + m, p) distributio. Puttig λ = mp ad µ = p oe would the suspect that the sum of idepedet Poissoλ) ad Poissoµ) distributed radom variables is Poissoλ + µ) distributed. Example <8.2>: If X has a Poissoλ) distributio, the EX = varx) = λ. If also Y has a Poissoµ) distributio, ad Y is idepedet of X, the X + Y has a Poissoλ + µ) distributio. Couts of rare evets such as the umber of atoms udergoig radioactive decay durig a short period of time, or the umber of aphids o a leaf are ofte modelled by Poisso distributios, at least as a first approximatio. I some situatios it makes sese to thik of the couts as the umber of successes i a large umber of idepedet trials, with the chace of a success o ay particular trial beig very small rare evets ). I such a settig, the Poisso arises as a approximatio for a sum of idepedet couts. I fact, moder probability methods ca hadle situatios much more geeral tha approximatio to the Biomial. For example, suppose S = X + X X, where X i Statistics 24: 8 October 2005 C8- c David Pollard
2 has a Bi, p i ) distributio, for costats p, p 2,...,p that are ot ecessarily all the same. Suppose the X i s are idepedet. If the p i s are ot all the same the S does ot have a Biomial distributio. Nevertheless, the Che-Stei method see Barbour, Holst & Jaso 992 for a extesive discussio of the method) ca be used to show that max P{S A} Q λa) e λ )/λ i= A p2 i where λ = p p. The method of proof is elemetary i the sese that it makes use of probabilistic techiques at the level of Statistics 24 but extremely subtle. Remark. The maximum here rus over all subsets A of N 0. I fact the maximum is achieved whe A = {k N 0 : P{S = k} Q λ {k}}, i which case P{S A} Q λ A) equals P{S = k} Q 2 k=0 λ{k}. This quatity is called the total variatio distace betwee Q λ ad the distributio of X; it gives a very strog cotrol over the errors i the approximatio. Note also that e λ )/λ mi, /λ). Ideed, the left-had side is close to whe λ 0 ad it behaves like /λ whe λ is large. Whe all the p i are equal to some small p, we get a boud o the total variatio distace betwee the Biomial, p) ad the Poissop) smaller tha mip, p 2 ). This boud makes precise the traditioal advice that the Poisso approximatio is good whe p is small ad p is ot too big. I fact, the traditio was a bit coservative.) The Poisso approximatio also applies i may settigs where the trials are almost idepedet, but ot quite. Agai the Che-Stei method delivers impressively good bouds o the errors of approximatio. For example, the method works well i two cases where the depedece takes a a simple form. Oce agai suppose S = X + X X, where X i has a Bi, p i ) distributio, for costats p, p 2,...,p that are ot ecessarily all the same. Defie S i = S X i = j: j i X j. The radom variables X,...,X are said to be positively associated if P{S i k X i = } P{S i k X i = 0} for each i ad each k N 0 ; they are said to be egatively associated 2 if P{S i k X i = } P{S i k X i = 0} for each i ad each k N 0 ; With some work it ca be show that max P{S A} Q λa) A { e λ 2 )/λ i= p2 i + vars) λ ) ) uder positive associatio λ vars) uder egative associatio. These bouds take advatage of the fact that vars) would be exactly equal to λ if S had a Poissoλ) distributio. The ext Example illustrates both the classical approach ad the Che-Stei approach via positive associatio) to derivig a Poisso approximatio for a matchig problem. Example <8.3>: Poisso approximatio for a matchig problem: assigmet of letters at radom to evelopes, oe per evelope. The Appedix to this Chapter provides a more detailed itroductio to the Che-Stei method, as applied to aother aspect of the matchig problem. I have take advatage of a few special features of the matchig problem to simplify the expositio.) You could safely skip this Appedix. For more details, see the moograph by Barbour et al. 992). ot stadard termiology 2 ot stadard termiology Statistics 24: 8 October 2005 C8-2 c David Pollard
3 Examples for Chapter 8 <8.> Example. The Poissoλ) appears as a approximatio to the Bi, p) whe is large, p is small, ad λ = p: ) ) p k p) k )... k + ) λ k = λ ) k k = )... k λk λ ) if k is small relative to ) λ ) k λ k λ ) λk e λ if is large. The fial e λ comes from a approximatio to the logarithm, log λ ) = log λ ) = λ λ 2 ) 2... λ if λ/ 0. 2 <8.2> Example. Verify the properties of the Poisso distributio suggested by the Biomial aalogy: If X has a Poissoλ) distributio, show that i) EX = λ ii) varx) = λ Also, if Y has a Poissoµ) distributio idepedet of X, show that iii) X + Y has a Poissoλ + µ) distributio Solutio: Assertio i) comes from a routie applicatio of the formula for the expectatio of a radom variable with a discrete distributio. EX = kp{x = k} = k e λ λ k What happes to k = 0? k=0 k= = e λ λ = e λ λe λ k =0 λ k k )! = λ. Notice how the k cacelled out oe factor from the i the deomiator. If we were to calculate EX 2 ) i the same way, oe factor i the k 2 would cacel the leadig k from the, but would leave a upleasat k/k )! i the sum. Too bad the k 2 caot be replaced by kk ). Well, why ot? EX 2 X) = kk )P{X = k} k=0 = e λ k=2 = e λ λ 2 kk ) λk k 2=0 λ k 2 k 2)! What happes to k = 0 ad k =? = λ 2. Now calculate the variace. varx) = EX 2 ) EX) 2 = EX 2 X) + EX EX) 2 = λ. Statistics 24: 8 October 2005 C8-3 c David Pollard
4 For assertio iii), first ote that X + Y ca take oly values 0,, 2... For a fixed k i this rage, decompose the evet {X + Y = k} ito disjoit pieces whose probabilities ca be simplified by meas of the idepedece betwee X ad Y. P{X + Y = k} =P{X = 0, Y = k}+p{x =, Y = k }+...+ P{X = k, Y = 0} = P{X = 0}P{Y = k}+p{x = }P{Y = k }+...+ P{X = k}p{y = 0} = e λ λ 0 0! = e λ µ e µ µ k e λ λ k e µ µ 0 0! 0! λ0 µ k +!k )! λ µ k ! λk µ 0 = e λ µ λ + µ) k. The bracketed sum i the secod last lie is just the biomial expasio of λ + µ) k. Questio: How do you iterpret the otatio i the last calculatio whe k = 0? I always feel slightly awkward about a cotributio from k ifk = 0. <8.3> Example. Suppose letters are placed at radom ito evelopes, oe letter per evelope. The total umber of correct matches, S, ca be writte as a sum X X of idicators, { if letter i is placed i evelope i, X i = 0 otherwise. The X i are depedet o each other. For example, symmetry implies that p i = P{X i = } =/ for each i ad P{X i = X = X 2 =...= X i = } = i + We could elimiate the depedece by relaxig the requiremet of oly oe letter per evelope. The umber of letters placed i the correct evelope possibly together with other, icorrect letters) would the have a Bi, /) distributio, which is approximated by Poisso) if is large. We ca get some supportig evidece for S havig somethig close to a Poisso) distributio uder the origial assumptio oe letter per evelope) by calculatig some momets. ES = EX i = P{X i = } = i ) ad ES 2 = E X X ) X i X j i< j ) = EX EX X 2 by symmetry 2 = P{X = }+ 2 )P{X =, X 2 = } = ) + 2 ) ) = 2. Thus vars) = ES 2 ES) 2 =. Compare with Example <8.2>, which gives EY = ad vary ) = for a Y distributed Poisso). Statistics 24: 8 October 2005 C8-4 c David Pollard
5 DP: check result ad Feller citatio Usig the method of iclusio ad exclusio, it is possible Feller 968, Chapter 4) to calculate the exact distributio of the umber of correct matches, <8.4> P{S = k} =! + 2! ) 3!...± for k = 0,,...,. k)! For fixed k, as the probability coverges to + 2! 3! )... = e = Q {k}, which is the probability that Y = k if Y has a Poisso) distributio. The Che-Stei method is also effective i this problem. I claim that it is ituitively clear although a rigorous proof might be tricky) that the X i s are positively associated: P{S i k X i = } P{S i k X i = 0} for each i ad each k N 0. I feel that if X i =, the it is more likely for the other letters to fid their matchig evelopes tha if X i = 0, which makes thigs harder by fillig oe of the evelopes with the icorrect letter i. We therefore have max P{S A} Q A) 2 i= A p2 i + vars) = 2/. As gets large, the distributio of S does get close to the Poisso) i the strog, total variatio sese. However, it is possible see Barbour et al. 992, page 73) to get a better boud by workig directly from <8.4> Refereces Barbour, A. D., Holst, L. & Jaso, S. 992), Poisso Approximatio, Oxford Uiversity Press. Feller, W. 968), A Itroductio to Probability Theory ad Its Applicatios, Vol., third ed, Wiley, New York. Appedix: The Che-Stei method for the matchig problem You might actually fid the argumet leadig to the fial boud of Example <8.3> more elighteig tha the codesed expositio that follows. I ay case, you ca safely stop readig this chapter right ow without sufferig major probabilistic deprivatio. You were wared. Cosider oce more the matchig problem described i Example <8.3>. Use the Che- Stei method to establish the approximatio P{S = k} e for k = 0,, 2,... The startig poit is a curious coectio betwee the Poisso) ad the fuctio g ) defied by g0) = 0 ad g j) = 0 e t t j dt for j =, 2,... Notice that 0 g j) for all j. Also, itegratio by parts shows that g j + ) = jg j) e for j =, 2,... ad direct calculatio gives g) = e More succictly, <8.5> g j + ) jg j) = { j = 0} e for j = 0,,... Statistics 24: 8 October 2005 C8-5 c David Pollard
6 Actually the defiitio of g0) has o effect o the validity of the assertio whe j = 0; you could give g0) ay value you liked. Suppose Y has a Poisso) distributio. Substitute Y for j i <8.5>, the take expectatios to get E gy + ) YgY )) = E{Y = 0} e = P{Y = 0} e = 0. A similar calculatio with S i place of Y gives <8.6> P{S = 0} e = E gs + ) SgS)). If we ca show that the right-had side is close to zero the we will have P{S = 0} e, which is the desired Poisso approximatio for P{S = k} whe k = 0. A simple symmetry argumet will the give the approximatio for other k values. There is a beautiful probabilistic trick for approximatig the right-had side of <8.6>. Write the SgS) cotributio as <8.7> ESgS) = E X i gs) = EX i gs) = EX gs) i= The trick cosists of a special two-step method for allocatig letters at radom to evelopes, which iitially gives letter a special role. ) Put letter i evelope, the allocate letters 2,..., to evelopes 2,..., i radom order, oe letter per evelope. Write + Z for the total umber of matches of letters to correct evelopes. The comes from the forced matchig of letter ad evelope.) Write Y j for the letter that goes ito evelope j. Notice that EZ =, as show i Example <8.3>. 2) Choose a evelope R at radom probability / for each evelope), the swap letter with the letter i the chose evelope. Notice that X is idepedet of Z, because of step 2. Ideed, P{X = Z = k} =P{R = Z = k} =/ for each k. Notice also that { + Z if R = S = Z if R 2 ad Y R = R Z if R 2 ad Y R R Thus P{S Z Z = k} =P{R = }+ j 2 P{R = j, Y j = j Z = k} = + j 2 j = j Z = k} = k + ad P{S Z} = k + P{Z = k} = EZ + = 2. k That is, the costructio gives S = Z with high probability. From the fact that whe X = that is, R = ) we have S = Z +, deduce that <8.8> X gs) = X g + Z) i= Statistics 24: 8 October 2005 C8-6 c David Pollard
7 The same equality holds trivially whe X = 0. Take expectatios. The argue that ESgS) = EX gs) by <8.7> = EX g + Z) by <8.8> = EX Eg + Z) by idepedece of X ad Z = Eg + Z) Thus the right-had side of <8.6> equals E gs + ) gz + )). O the evet {S = Z} the two terms cacel; o the evet {S Z}, the differece gs + ) gz + ) lies betwee ± because 0 g j) for j =, 2,... Combiig these two cotributios, we get P gs + ) gz + )) P{S Z} 2 ad <8.9> P{S = 0} e = P gs + ) SgS)) 2/. The exact expressio for P{S = 0} from <8.4> shows that 2/ greatly overestimates the error of approximatio, but at least it teds to zero as gets large. After all that work to justify the Poisso approximatio to P{S = k} for k = 0, you might be forgive for shrikig from the prospect of extedig the approximatio to larger k. Fear ot! The worst is over. For k =, 2,... the evet {S = k} specifies exactly k matches. There are k) choices for the matchig evelopes. By symmetry, the probability of matches oly i a particular set of k evelopes is the same for each specific choice of the set of k evelopes. It follows that ) P{S = k} = P{evelopes,...,k match; the rest do t} k The probability of gettig matches i evelopes,...,k equals )... k + ). The coditioal probability P{evelopes k +,..., do t match evelopes,...,k match} is equal to the probability of zero matches whe k letters are placed at radom ito their evelopes. If is much larger tha k, this probability is close to e, as show above. Thus! P{S = k} k)! More formally, for each fixed k, ) 2)... k + ) e = e. P{S = k} e where Y has the Poisso) distributio. = P{Y = k} as, Statistics 24: 8 October 2005 C8-7 c David Pollard
0, otherwise. EX = E(X 1 + X n ) = EX j = np and. Var(X j ) = np(1 p). Var(X) = Var(X X n ) =
PROBABILITY MODELS 35 10. Discrete probability distributios I this sectio, we discuss several well-ow discrete probability distributios ad study some of their properties. Some of these distributios, lie
More informationPoisson approximations
Chapter 9 Poisson approximations 9.1 Overview The Binn, p) can be thought of as the distribution of a sum of independent indicator random variables X 1 + + X n, with {X i = 1} denoting a head on the ith
More informationCS 330 Discussion - Probability
CS 330 Discussio - Probability March 24 2017 1 Fudametals of Probability 11 Radom Variables ad Evets A radom variable X is oe whose value is o-determiistic For example, suppose we flip a coi ad set X =
More informationDiscrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 19
CS 70 Discrete Mathematics ad Probability Theory Sprig 2016 Rao ad Walrad Note 19 Some Importat Distributios Recall our basic probabilistic experimet of tossig a biased coi times. This is a very simple
More informationDiscrete Mathematics for CS Spring 2005 Clancy/Wagner Notes 21. Some Important Distributions
CS 70 Discrete Mathematics for CS Sprig 2005 Clacy/Wager Notes 21 Some Importat Distributios Questio: A biased coi with Heads probability p is tossed repeatedly util the first Head appears. What is the
More informationf X (12) = Pr(X = 12) = Pr({(6, 6)}) = 1/36
Probability Distributios A Example With Dice If X is a radom variable o sample space S, the the probablity that X takes o the value c is Similarly, Pr(X = c) = Pr({s S X(s) = c} Pr(X c) = Pr({s S X(s)
More informationDiscrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22
CS 70 Discrete Mathematics for CS Sprig 2007 Luca Trevisa Lecture 22 Aother Importat Distributio The Geometric Distributio Questio: A biased coi with Heads probability p is tossed repeatedly util the first
More informationn outcome is (+1,+1, 1,..., 1). Let the r.v. X denote our position (relative to our starting point 0) after n moves. Thus X = X 1 + X 2 + +X n,
CS 70 Discrete Mathematics for CS Sprig 2008 David Wager Note 9 Variace Questio: At each time step, I flip a fair coi. If it comes up Heads, I walk oe step to the right; if it comes up Tails, I walk oe
More informationDiscrete Mathematics and Probability Theory Summer 2014 James Cook Note 15
CS 70 Discrete Mathematics ad Probability Theory Summer 2014 James Cook Note 15 Some Importat Distributios I this ote we will itroduce three importat probability distributios that are widely used to model
More informationLecture 1 Probability and Statistics
Wikipedia: Lecture 1 Probability ad Statistics Bejami Disraeli, British statesma ad literary figure (1804 1881): There are three kids of lies: lies, damed lies, ad statistics. popularized i US by Mark
More informationRandom Models. Tusheng Zhang. February 14, 2013
Radom Models Tusheg Zhag February 14, 013 1 Radom Walks Let me describe the model. Radom walks are used to describe the motio of a movig particle (object). Suppose that a particle (object) moves alog the
More informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More informationDiscrete Mathematics and Probability Theory Spring 2012 Alistair Sinclair Note 15
CS 70 Discrete Mathematics ad Probability Theory Sprig 2012 Alistair Siclair Note 15 Some Importat Distributios The first importat distributio we leared about i the last Lecture Note is the biomial distributio
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationLecture 1 Probability and Statistics
Wikipedia: Lecture 1 Probability ad Statistics Bejami Disraeli, British statesma ad literary figure (1804 1881): There are three kids of lies: lies, damed lies, ad statistics. popularized i US by Mark
More information7.1 Convergence of sequences of random variables
Chapter 7 Limit Theorems Throughout this sectio we will assume a probability space (, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite
More informationFACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures
FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING Lectures MODULE 5 STATISTICS II. Mea ad stadard error of sample data. Biomial distributio. Normal distributio 4. Samplig 5. Cofidece itervals
More informationLecture 6: Coupon Collector s problem
Radomized Algorithms Lecture 6: Coupo Collector s problem Sotiris Nikoletseas Professor CEID - ETY Course 2017-2018 Sotiris Nikoletseas, Professor Radomized Algorithms - Lecture 6 1 / 16 Variace: key features
More informationMath 525: Lecture 5. January 18, 2018
Math 525: Lecture 5 Jauary 18, 2018 1 Series (review) Defiitio 1.1. A sequece (a ) R coverges to a poit L R (writte a L or lim a = L) if for each ǫ > 0, we ca fid N such that a L < ǫ for all N. If the
More informationf X (12) = Pr(X = 12) = Pr({(6, 6)}) = 1/36
Probability Distributios A Example With Dice If X is a radom variable o sample space S, the the probability that X takes o the value c is Similarly, Pr(X = c) = Pr({s S X(s) = c}) Pr(X c) = Pr({s S X(s)
More informationProblem Set 2 Solutions
CS271 Radomess & Computatio, Sprig 2018 Problem Set 2 Solutios Poit totals are i the margi; the maximum total umber of poits was 52. 1. Probabilistic method for domiatig sets 6pts Pick a radom subset S
More informationMath 216A Notes, Week 5
Math 6A Notes, Week 5 Scribe: Ayastassia Sebolt Disclaimer: These otes are ot early as polished (ad quite possibly ot early as correct) as a published paper. Please use them at your ow risk.. Thresholds
More informationParameter, Statistic and Random Samples
Parameter, Statistic ad Radom Samples A parameter is a umber that describes the populatio. It is a fixed umber, but i practice we do ot kow its value. A statistic is a fuctio of the sample data, i.e.,
More informationChapter 5. Inequalities. 5.1 The Markov and Chebyshev inequalities
Chapter 5 Iequalities 5.1 The Markov ad Chebyshev iequalities As you have probably see o today s frot page: every perso i the upper teth percetile ears at least 1 times more tha the average salary. I other
More informationON POINTWISE BINOMIAL APPROXIMATION
Iteratioal Joural of Pure ad Applied Mathematics Volume 71 No. 1 2011, 57-66 ON POINTWISE BINOMIAL APPROXIMATION BY w-functions K. Teerapabolar 1, P. Wogkasem 2 Departmet of Mathematics Faculty of Sciece
More informationSTAT Homework 1 - Solutions
STAT-36700 Homework 1 - Solutios Fall 018 September 11, 018 This cotais solutios for Homework 1. Please ote that we have icluded several additioal commets ad approaches to the problems to give you better
More informationAn Introduction to Randomized Algorithms
A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationMath 152. Rumbos Fall Solutions to Review Problems for Exam #2. Number of Heads Frequency
Math 152. Rumbos Fall 2009 1 Solutios to Review Problems for Exam #2 1. I the book Experimetatio ad Measuremet, by W. J. Youde ad published by the by the Natioal Sciece Teachers Associatio i 1962, the
More informationThe standard deviation of the mean
Physics 6C Fall 20 The stadard deviatio of the mea These otes provide some clarificatio o the distictio betwee the stadard deviatio ad the stadard deviatio of the mea.. The sample mea ad variace Cosider
More informationLecture 12: September 27
36-705: Itermediate Statistics Fall 207 Lecturer: Siva Balakrisha Lecture 2: September 27 Today we will discuss sufficiecy i more detail ad the begi to discuss some geeral strategies for costructig estimators.
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS
MASSACHUSTTS INSTITUT OF TCHNOLOGY 6.436J/5.085J Fall 2008 Lecture 9 /7/2008 LAWS OF LARG NUMBRS II Cotets. The strog law of large umbers 2. The Cheroff boud TH STRONG LAW OF LARG NUMBRS While the weak
More informationRandomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018)
Radomized Algorithms I, Sprig 08, Departmet of Computer Sciece, Uiversity of Helsiki Homework : Solutios Discussed Jauary 5, 08). Exercise.: Cosider the followig balls-ad-bi game. We start with oe black
More informationThe Growth of Functions. Theoretical Supplement
The Growth of Fuctios Theoretical Supplemet The Triagle Iequality The triagle iequality is a algebraic tool that is ofte useful i maipulatig absolute values of fuctios. The triagle iequality says that
More informationCEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering
CEE 5 Autum 005 Ucertaity Cocepts for Geotechical Egieerig Basic Termiology Set A set is a collectio of (mutually exclusive) objects or evets. The sample space is the (collectively exhaustive) collectio
More informationLecture 12: November 13, 2018
Mathematical Toolkit Autum 2018 Lecturer: Madhur Tulsiai Lecture 12: November 13, 2018 1 Radomized polyomial idetity testig We will use our kowledge of coditioal probability to prove the followig lemma,
More informationEE 4TM4: Digital Communications II Probability Theory
1 EE 4TM4: Digital Commuicatios II Probability Theory I. RANDOM VARIABLES A radom variable is a real-valued fuctio defied o the sample space. Example: Suppose that our experimet cosists of tossig two fair
More informationLecture 2: Monte Carlo Simulation
STAT/Q SCI 43: Itroductio to Resamplig ethods Sprig 27 Istructor: Ye-Chi Che Lecture 2: ote Carlo Simulatio 2 ote Carlo Itegratio Assume we wat to evaluate the followig itegratio: e x3 dx What ca we do?
More informationDS 100: Principles and Techniques of Data Science Date: April 13, Discussion #10
DS 00: Priciples ad Techiques of Data Sciece Date: April 3, 208 Name: Hypothesis Testig Discussio #0. Defie these terms below as they relate to hypothesis testig. a) Data Geeratio Model: Solutio: A set
More information1 Introduction: within and beyond the normal approximation
Tel Aviv Uiversity, 205 Large ad moderate deviatios Itroductio: withi ad beyod the ormal approximatio a Mathematical prelude................ b Physical prelude................... 3 a Mathematical prelude
More informationTMA4245 Statistics. Corrected 30 May and 4 June Norwegian University of Science and Technology Department of Mathematical Sciences.
Norwegia Uiversity of Sciece ad Techology Departmet of Mathematical Scieces Corrected 3 May ad 4 Jue Solutios TMA445 Statistics Saturday 6 May 9: 3: Problem Sow desity a The probability is.9.5 6x x dx
More informationDiscrete Mathematics for CS Spring 2008 David Wagner Note 22
CS 70 Discrete Mathematics for CS Sprig 2008 David Wager Note 22 I.I.D. Radom Variables Estimatig the bias of a coi Questio: We wat to estimate the proportio p of Democrats i the US populatio, by takig
More informationNotes 5 : More on the a.s. convergence of sums
Notes 5 : More o the a.s. covergece of sums Math 733-734: Theory of Probability Lecturer: Sebastie Roch Refereces: Dur0, Sectios.5; Wil9, Sectio 4.7, Shi96, Sectio IV.4, Dur0, Sectio.. Radom series. Three-series
More information7.1 Convergence of sequences of random variables
Chapter 7 Limit theorems Throughout this sectio we will assume a probability space (Ω, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite
More informationChapter 3. Strong convergence. 3.1 Definition of almost sure convergence
Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i
More informationBasics of Probability Theory (for Theory of Computation courses)
Basics of Probability Theory (for Theory of Computatio courses) Oded Goldreich Departmet of Computer Sciece Weizma Istitute of Sciece Rehovot, Israel. oded.goldreich@weizma.ac.il November 24, 2008 Preface.
More informationChapter 6 Principles of Data Reduction
Chapter 6 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 0 Chapter 6 Priciples of Data Reductio Sectio 6. Itroductio Goal: To summarize or reduce the data X, X,, X to get iformatio about a
More informationLecture 2: April 3, 2013
TTIC/CMSC 350 Mathematical Toolkit Sprig 203 Madhur Tulsiai Lecture 2: April 3, 203 Scribe: Shubhedu Trivedi Coi tosses cotiued We retur to the coi tossig example from the last lecture agai: Example. Give,
More informationUnderstanding Samples
1 Will Moroe CS 109 Samplig ad Bootstrappig Lecture Notes #17 August 2, 2017 Based o a hadout by Chris Piech I this chapter we are goig to talk about statistics calculated o samples from a populatio. We
More informationResampling Methods. X (1/2), i.e., Pr (X i m) = 1/2. We order the data: X (1) X (2) X (n). Define the sample median: ( n.
Jauary 1, 2019 Resamplig Methods Motivatio We have so may estimators with the property θ θ d N 0, σ 2 We ca also write θ a N θ, σ 2 /, where a meas approximately distributed as Oce we have a cosistet estimator
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Lecture 16
EECS 70 Discrete Mathematics ad Probability Theory Sprig 2014 Aat Sahai Lecture 16 Variace Questio: Let us retur oce agai to the questio of how may heads i a typical sequece of coi flips. Recall that we
More informationCS / MCS 401 Homework 3 grader solutions
CS / MCS 401 Homework 3 grader solutios assigmet due July 6, 016 writte by Jāis Lazovskis maximum poits: 33 Some questios from CLRS. Questios marked with a asterisk were ot graded. 1 Use the defiitio of
More informationMathematics 170B Selected HW Solutions.
Mathematics 17B Selected HW Solutios. F 4. Suppose X is B(,p). (a)fidthemometgeeratigfuctiom (s)of(x p)/ p(1 p). Write q = 1 p. The MGF of X is (pe s + q), sice X ca be writte as the sum of idepedet Beroulli
More information( ) = p and P( i = b) = q.
MATH 540 Radom Walks Part 1 A radom walk X is special stochastic process that measures the height (or value) of a particle that radomly moves upward or dowward certai fixed amouts o each uit icremet of
More informationSeunghee Ye Ma 8: Week 5 Oct 28
Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value
More informationProblems from 9th edition of Probability and Statistical Inference by Hogg, Tanis and Zimmerman:
Math 224 Fall 2017 Homework 4 Drew Armstrog Problems from 9th editio of Probability ad Statistical Iferece by Hogg, Tais ad Zimmerma: Sectio 2.3, Exercises 16(a,d),18. Sectio 2.4, Exercises 13, 14. Sectio
More informationAdvanced Stochastic Processes.
Advaced Stochastic Processes. David Gamarik LECTURE 2 Radom variables ad measurable fuctios. Strog Law of Large Numbers (SLLN). Scary stuff cotiued... Outlie of Lecture Radom variables ad measurable fuctios.
More informationDiscrete probability distributions
Discrete probability distributios I the chapter o probability we used the classical method to calculate the probability of various values of a radom variable. I some cases, however, we may be able to develop
More informationLearning Theory: Lecture Notes
Learig Theory: Lecture Notes Kamalika Chaudhuri October 4, 0 Cocetratio of Averages Cocetratio of measure is very useful i showig bouds o the errors of machie-learig algorithms. We will begi with a basic
More informationLecture 2. The Lovász Local Lemma
Staford Uiversity Sprig 208 Math 233A: No-costructive methods i combiatorics Istructor: Ja Vodrák Lecture date: Jauary 0, 208 Origial scribe: Apoorva Khare Lecture 2. The Lovász Local Lemma 2. Itroductio
More informationThis exam contains 19 pages (including this cover page) and 10 questions. A Formulae sheet is provided with the exam.
Probability ad Statistics FS 07 Secod Sessio Exam 09.0.08 Time Limit: 80 Miutes Name: Studet ID: This exam cotais 9 pages (icludig this cover page) ad 0 questios. A Formulae sheet is provided with the
More informationDistribution of Random Samples & Limit theorems
STAT/MATH 395 A - PROBABILITY II UW Witer Quarter 2017 Néhémy Lim Distributio of Radom Samples & Limit theorems 1 Distributio of i.i.d. Samples Motivatig example. Assume that the goal of a study is to
More informationApplication to Random Graphs
A Applicatio to Radom Graphs Brachig processes have a umber of iterestig ad importat applicatios. We shall cosider oe of the most famous of them, the Erdős-Réyi radom graph theory. 1 Defiitio A.1. Let
More information4. Partial Sums and the Central Limit Theorem
1 of 10 7/16/2009 6:05 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 4. Partial Sums ad the Cetral Limit Theorem The cetral limit theorem ad the law of large umbers are the two fudametal theorems
More informationApproximations and more PMFs and PDFs
Approximatios ad more PMFs ad PDFs Saad Meimeh 1 Approximatio of biomial with Poisso Cosider the biomial distributio ( b(k,,p = p k (1 p k, k λ: k Assume that is large, ad p is small, but p λ at the limit.
More informationHOMEWORK 2 SOLUTIONS
HOMEWORK SOLUTIONS CSE 55 RANDOMIZED AND APPROXIMATION ALGORITHMS 1. Questio 1. a) The larger the value of k is, the smaller the expected umber of days util we get all the coupos we eed. I fact if = k
More informationLecture 7: Properties of Random Samples
Lecture 7: Properties of Radom Samples 1 Cotiued From Last Class Theorem 1.1. Let X 1, X,...X be a radom sample from a populatio with mea µ ad variace σ
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 6 9/24/2008 DISCRETE RANDOM VARIABLES AND THEIR EXPECTATIONS
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 6 9/24/2008 DISCRETE RANDOM VARIABLES AND THEIR EXPECTATIONS Cotets 1. A few useful discrete radom variables 2. Joit, margial, ad
More informationPH 425 Quantum Measurement and Spin Winter SPINS Lab 1
PH 425 Quatum Measuremet ad Spi Witer 23 SPIS Lab Measure the spi projectio S z alog the z-axis This is the experimet that is ready to go whe you start the program, as show below Each atom is measured
More informationCS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 5
CS434a/54a: Patter Recogitio Prof. Olga Veksler Lecture 5 Today Itroductio to parameter estimatio Two methods for parameter estimatio Maimum Likelihood Estimatio Bayesia Estimatio Itroducto Bayesia Decisio
More informationOn Random Line Segments in the Unit Square
O Radom Lie Segmets i the Uit Square Thomas A. Courtade Departmet of Electrical Egieerig Uiversity of Califoria Los Ageles, Califoria 90095 Email: tacourta@ee.ucla.edu I. INTRODUCTION Let Q = [0, 1] [0,
More informationRandom Matrices with Blocks of Intermediate Scale Strongly Correlated Band Matrices
Radom Matrices with Blocks of Itermediate Scale Strogly Correlated Bad Matrices Jiayi Tog Advisor: Dr. Todd Kemp May 30, 07 Departmet of Mathematics Uiversity of Califoria, Sa Diego Cotets Itroductio Notatio
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationLecture 2: Concentration Bounds
CSE 52: Desig ad Aalysis of Algorithms I Sprig 206 Lecture 2: Cocetratio Bouds Lecturer: Shaya Oveis Ghara March 30th Scribe: Syuzaa Sargsya Disclaimer: These otes have ot bee subjected to the usual scrutiy
More informationLecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting
Lecture 6 Chi Square Distributio (χ ) ad Least Squares Fittig Chi Square Distributio (χ ) Suppose: We have a set of measuremets {x 1, x, x }. We kow the true value of each x i (x t1, x t, x t ). We would
More informationExpectation and Variance of a random variable
Chapter 11 Expectatio ad Variace of a radom variable The aim of this lecture is to defie ad itroduce mathematical Expectatio ad variace of a fuctio of discrete & cotiuous radom variables ad the distributio
More informationSTAT 516 Answers Homework 6 April 2, 2008 Solutions by Mark Daniel Ward PROBLEMS
STAT 56 Aswers Homework 6 April 2, 28 Solutios by Mark Daiel Ward PROBLEMS Chapter 6 Problems 2a. The mass p(, correspods to either o the irst two balls beig white, so p(, 8 7 4/39. The mass p(, correspods
More informationBinomial Distribution
0.0 0.5 1.0 1.5 2.0 2.5 3.0 0 1 2 3 4 5 6 7 0.0 0.5 1.0 1.5 2.0 2.5 3.0 Overview Example: coi tossed three times Defiitio Formula Recall that a r.v. is discrete if there are either a fiite umber of possible
More informationSequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet
More informationElements of Statistical Methods Lots of Data or Large Samples (Ch 8)
Elemets of Statistical Methods Lots of Data or Large Samples (Ch 8) Fritz Scholz Sprig Quarter 2010 February 26, 2010 x ad X We itroduced the sample mea x as the average of the observed sample values x
More informationDisjoint Systems. Abstract
Disjoit Systems Noga Alo ad Bey Sudaov Departmet of Mathematics Raymod ad Beverly Sacler Faculty of Exact Scieces Tel Aviv Uiversity, Tel Aviv, Israel Abstract A disjoit system of type (,,, ) is a collectio
More informationACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Statistics
ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER 1 018/019 DR. ANTHONY BROWN 8. Statistics 8.1. Measures of Cetre: Mea, Media ad Mode. If we have a series of umbers the
More informationLecture 6: Integration and the Mean Value Theorem. slope =
Math 8 Istructor: Padraic Bartlett Lecture 6: Itegratio ad the Mea Value Theorem Week 6 Caltech 202 The Mea Value Theorem The Mea Value Theorem abbreviated MVT is the followig result: Theorem. Suppose
More informationDesign and Analysis of Algorithms
Desig ad Aalysis of Algorithms Probabilistic aalysis ad Radomized algorithms Referece: CLRS Chapter 5 Topics: Hirig problem Idicatio radom variables Radomized algorithms Huo Hogwei 1 The hirig problem
More informationThe Poisson Distribution
MATH 382 The Poisso Distributio Dr. Neal, WKU Oe of the importat distributios i probabilistic modelig is the Poisso Process X t that couts the umber of occurreces over a period of t uits of time. This
More informationVariance of Discrete Random Variables Class 5, Jeremy Orloff and Jonathan Bloom
Variace of Discrete Radom Variables Class 5, 18.05 Jeremy Orloff ad Joatha Bloom 1 Learig Goals 1. Be able to compute the variace ad stadard deviatio of a radom variable.. Uderstad that stadard deviatio
More informationOptimally Sparse SVMs
A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but
More informationA sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as
More information(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m?
MATH 529 The Boudary Problem The drukard s walk (or boudary problem) is oe of the most famous problems i the theory of radom walks. Oe versio of the problem is described as follows: Suppose a particle
More informationLimit Theorems. Convergence in Probability. Let X be the number of heads observed in n tosses. Then, E[X] = np and Var[X] = np(1-p).
Limit Theorems Covergece i Probability Let X be the umber of heads observed i tosses. The, E[X] = p ad Var[X] = p(-p). L O This P x p NM QP P x p should be close to uity for large if our ituitio is correct.
More informationSimulation. Two Rule For Inverting A Distribution Function
Simulatio Two Rule For Ivertig A Distributio Fuctio Rule 1. If F(x) = u is costat o a iterval [x 1, x 2 ), the the uiform value u is mapped oto x 2 through the iversio process. Rule 2. If there is a jump
More informationExercise 4.3 Use the Continuity Theorem to prove the Cramér-Wold Theorem, Theorem. (1) φ a X(1).
Assigmet 7 Exercise 4.3 Use the Cotiuity Theorem to prove the Cramér-Wold Theorem, Theorem 4.12. Hit: a X d a X implies that φ a X (1) φ a X(1). Sketch of solutio: As we poited out i class, the oly tricky
More informationEcon 325/327 Notes on Sample Mean, Sample Proportion, Central Limit Theorem, Chi-square Distribution, Student s t distribution 1.
Eco 325/327 Notes o Sample Mea, Sample Proportio, Cetral Limit Theorem, Chi-square Distributio, Studet s t distributio 1 Sample Mea By Hiro Kasahara We cosider a radom sample from a populatio. Defiitio
More information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More informationOutput Analysis and Run-Length Control
IEOR E4703: Mote Carlo Simulatio Columbia Uiversity c 2017 by Marti Haugh Output Aalysis ad Ru-Legth Cotrol I these otes we describe how the Cetral Limit Theorem ca be used to costruct approximate (1 α%
More informationLet us give one more example of MLE. Example 3. The uniform distribution U[0, θ] on the interval [0, θ] has p.d.f.
Lecture 5 Let us give oe more example of MLE. Example 3. The uiform distributio U[0, ] o the iterval [0, ] has p.d.f. { 1 f(x =, 0 x, 0, otherwise The likelihood fuctio ϕ( = f(x i = 1 I(X 1,..., X [0,
More informationIntroduction to Probability and Statistics Twelfth Edition
Itroductio to Probability ad Statistics Twelfth Editio Robert J. Beaver Barbara M. Beaver William Medehall Presetatio desiged ad writte by: Barbara M. Beaver Itroductio to Probability ad Statistics Twelfth
More informationMATH 320: Probability and Statistics 9. Estimation and Testing of Parameters. Readings: Pruim, Chapter 4
MATH 30: Probability ad Statistics 9. Estimatio ad Testig of Parameters Estimatio ad Testig of Parameters We have bee dealig situatios i which we have full kowledge of the distributio of a radom variable.
More informationRandom Variables, Sampling and Estimation
Chapter 1 Radom Variables, Samplig ad Estimatio 1.1 Itroductio This chapter will cover the most importat basic statistical theory you eed i order to uderstad the ecoometric material that will be comig
More informationEstimation for Complete Data
Estimatio for Complete Data complete data: there is o loss of iformatio durig study. complete idividual complete data= grouped data A complete idividual data is the oe i which the complete iformatio of
More information