SOME THEORY AND PRACTICE OF STATISTICS by Howard G. Tucker

Size: px
Start display at page:

Download "SOME THEORY AND PRACTICE OF STATISTICS by Howard G. Tucker"

Transcription

1 SOME THEORY AND PRACTICE OF STATISTICS by Howard G. Tucker CHAPTER 9. POINT ESTIMATION 9. Covergece i Probability. The bases of poit estimatio have already bee laid out i previous chapters. I chapter 5 i particular, we proved the law of large umbers ad Beroulli s theorem, which are results about covergece i probability. From time to time we have also metioed i a iformal way about a statistic, i.e., a kow fuctio of several observable radom variables, beig a ubiased estimate of some parameter. I this chapter, we shall deal with questios about poit estimatio i a more structured way. We shall itroduce i this sectio the otio of covergece i probability. De itio. If X, X, X 2; are radom variables, we say that the sequece fx g coverges i probability to X if, for every > 0, the sequece of umbers fp ([j X X j ])g coverges to 0 as! i.e., P ([j X X j ])! 0 as!. We frequetly deote this by X! P X. I sectio 5:2 we proved the law of large umbers. I our preset laguage this ca be expressed as follows: if fx g is a sequece of idepedet ad idetically distributed radom variables with ite commo secod momet, the X X i! P E(X ) as!. i= As a special corollary of the law of large umbers we obtaied Beroulli s theorem which i our preset laguage states: if for each, fs g is Bi(; p), the S!P p as!. Example: For = 2; 3;, let X be a radom variable with absolutely cotiuous distributio fuctio with desity give by 8 < if 0 x f X (x) = : if < x 0 if x < 0 or x >. 26

2 Let > 0 be arbitrary, with <. The for >, we have 0 P ([j X 0 j ]) = P ([X ]) P ([X ]) =! 0 as! 0. Thus, for this example, X! P 0. The followig remark is a immediate cosequece of the de itio. Remark. If X, X, X 2; are radom variables, the sequece fx g coverges i probability to X if ad oly if the sequece of di ereces, fx Xg, coverges i probability to 0. The followig theorem is beyod the scope of this course ad is give as a faith theorem. We have proved special cases of it i sectio 2:. Theorem. If f : R! R is a fuctio which is cotiuous over R, ad if X ; ; X are radom variables de ed o the same probability space, the f(x ; ; X ) is a radom variable. The followig theorem ca be stated more geerally, amely over R, but the statemet ad proof for = 2 ca easily be exteded. Theorem 2. If f : R 2! R is a fuctio which is cotiuous at the poit (a; b) 2 R 2, ad if fx g ad fy g are sequeces of radom variables de ed o the same probability space such that X! P a ad Y! P b, the the sequece of radom variables ff(x ; Y )g coverges i probability to f(a; b) as!, i.e., f(x ; Y )! P f(a; b) as!. Proof: Sice by hypothesis f : R 2! R is cotiuous at (a; b), the by the de itio of cotiuity, give > 0, there exists a > 0 such that [j X a j< ] \ [j Y b j< ] [j f(x ; Y ) f(a; b) j< ]. By the DeMorga formula, we take complemets of both sides to get [j f(x ; Y ) f(a; b) j ] [j X a j ] [ [j Y b j ]. Takig the probabilities of both sides, ad usig Boole s iequality, we obtai 0 P ([j f(x ; Y ) f(a; b) j ]) P ([j X a j ]) + P ([j Y b j ]). Sice, by hypothesis, P ([j X a j ])! 0 ad P ([j Y b j ])! 0, it follows that P ([j f(x ; Y ) f(a; b) j ])! 0 as!; 27

3 i.e., f(x ; Y )! P f(a; b) as!. De itio. If X is a observable radom variable, we say it is a ubiased estimate of the costat if E(X) =. The ext de itio appears to be a little odd, but this is the way a lot of mathematical statisticias speak ad write. De itio. If fx g is a i ite sequece of observable radom variables, the we say X is a cosistet estimate of if X! P as!. There are may examples of ubiased estimates. If X is Bi(; p), the E(X ) = p, or E(X =) = p. Thus X = is a ubiased estimate of p. Also, by Beroulli s theorem ad the de itio of covergece i probability give above, X = is a cosistat estimate of p. Here is a example where we ca obtai three di eret cosistet estimates of a particular parameter. Let X be a radom variable with absolutely cotiuous distributio with desity give by if < x < + f X (x) = 0 otherwise. Let X, X 2, deote a sequece of idepedet observatios o X, i.e., X, X 2, is a sequece of idepedet, idetically distributed radom variables, each with the same distributio fuctio as X, ad let U = mifx i ; i g. The for every > 0 satisfyig 0 < <, we have 0 P ([j U j ]) = P ([U + ]) = P ( T i= [X j + ]) = Q i= P ([X j + ]) = ( )! 0 as!. Thus U! P as!, so U is a cosistat estimate of. But if we also de e V = X + + X 2, we ca show that V is also a cosistet estimate of. Ideed, by the law of large umbers, sice E(X) = +, 2 P ([j V j ]) = P ([j X + + X E(X) j ])! 0 as!, for all > 0. Note also that if the observable radom variable 28

4 W is de ed by W = maxfx i ; i g, the oe ca easily prove that W! P as!. EXERCISES. The de itio of a fuctio f : R 2! R beig cotiuous at a poit (a; b) 2 R 2 is usually give as: for every > 0, there exists a umber > 0 such that j f(x; y) f(a; b) j< for all poits (x; y) 2 R 2 that satisfy j x a j< ad j y b j<. Prove that this justi es the followig statemet i the proof of theorem : Sice by hypothesis f : R 2! R is cotiuous at (a; b), the by the de itio of cotiuity, give > 0, there exists a > 0 such that [j X a j< ] \ [j Y b j< ] [j f(x ; Y ) f(a; b) j< ]. 2. Prove: if fx g ad fy g are sequeces of radom variables, if X! P a ad if Y! P b, where a ad b are costats, the X + Y! P a + b ad X Y! P ab as!. 3. Let fu g be a sequece of radom variables, where U is N (0; ), = ; 2;. Prove that U! P 0 as!. (Hit: Use Chebishev s iequality.) 4. Prove: if fv g is a sequece of radom variables, ad if V has the F ;2 distributio, = ; 2;, the V! P. 5. Let fx g be a sequece of idepedet, idetically distributed radom variables with a commo absolutely cotiuous distributio fuctio whose desity is give by e f X (x) = if x 0 0 if x < 0, where > 0 is a costat. Prove that X + X! P as!. 6. Prove that W! P as!, where W is as de ed at the ed of this sectio. 9.2 The Method of Momets. A advatage of the otio of covergece i probability to the value of a parameter of iterest, i.e., a advatage 29

5 of a cosistet estimate of the parameter, is that oe is assured that the farther out oe goes i the sequece the closer oe will get to this parameter i a certai sese. Especially if oe does ot have a ubiased estimate of the parameter but does have a cosistat estimate, the oe ca take comfort i the fact that the larger is, the closer the estimate is to the value of the parameter. A very useful method of dig cosistat estimates is by the method of momets which is developed i this sectio. We rst eed a importat lemma. Lemma. If fx g are idepedet ad idetically distributed radom variables with ite 2rth momet, where r is a positive iteger, the X Xi r! P E(X)as r!. i= Proof: We rst observe that the rth powers, fxg, r are idepedet ad idetically distributed with commo ite secod momet. Hece by the law of large umbers we obtai the coclusio. Lemma 2. If X; X ; X 2 ; are radom variables that are costat, i.e., there exists costats a; a ; a 2 ; such that P ([X = a]) = ad P ([X = a ]) = for all, ad if a! a as!, the X! P X = a as!. Proof: Let > 0 be arbitrary. Sice by hypothesis, a! a as!, there exists a positive iteger N such that j a a j< for all values of that satisfy > N. Hece P ([j X X j< ]) = for all > N, from which it follows that P ([j X X j ]) = 0 for all > N, i.e., X! P X = a as!. We shall cosider the case of a sequece of idepedet observatios X ; X 2 ; o a radom variable X. This meas that each radom variable i the sequece has the same distributio fuctio as does X ad is a idepedet observatio o the same populatio that X is. To keep thigs simple, suppose the distributio fuctio of X depeds o two ukow parameters, ad 2 ; ad suppose we wish to estimate both of these parameters with cosistet estimates. Let us suppose that this sequece of radom variables has a ite commo fourth momet. The by the above lemma, X Xi r! P E(X r )as! for r = ; 2. i= We also suppose that each of the rst two momets of X, m ad m 2, is a cotiuous fuctio ofthe ukow parameters, ( ; 2 ). Call these fuctios 220

6 m = u( ; 2 ) ad m 2 = v( ; 2 ). Further we assume that a cotiuuous iverse of this mappig exists, amely, that oe ca solve these two equatios for ad 2 as cotiuous fuctios, = g(m ; m 2 ) ad 2 = h(m ; m 2 ), P P of m ad m 2. Let us deote X = X i ad V = X 2 i. The by i= theorem i sectio 9: ad theorem above, ad g(x ; V )! P g(m ; m 2 ) = h(x ; V )! P h(m ; m 2 ) = 2 as!. This is essetially the method of momets. It should be realized that this holds for ay ite umber of parameters provided the correct commo momet is ite. Example. Let X be a radom variable with a absolutely cotiuous distributio with desity give by p Lx if 0 < x < 2=L f X (x) = 0 if x 0 or x p 2=L, where L > 0 is ukow, ad let X ; X 2 ; be idepedet observatios o X. I order to d a cosistat estimate of L, we compute E(X) = Solvig for L we obtai Z Z p 2=L xf X (x)dx = L = 0 8 9(E(X)) 2. i= Lx 2 dx = 23=2 3L =2. Sice h(x) = 8 is a cotiuous fuctio of x, it follows that a cosistet 9x 2 estimate of L is L b = 8. 9X 2 Example 2: Cosider a radom variable X with ite fourth momet ad ukow expectatio. Let X ; X 2 ; deote a sequece of idepedet observatios o X, i.e., X ; X 2 ; are idepedet observatios o the same populatio o which X is a observatio. Accordigly, X ; X 2 ; are idepedet ad idetically distributed radom variables whose commo distributio is tthe same as the distributio of X. Now let us de e X by X = X + X 22

7 for every. The by the law of large umbers proved i sectio 5:2 ad by the de itios give i sectio 9:, X! P, i.e., X is a cosistet estimate of. From ow o we shall use the otatio X to deote the arithmetic mea of the rst idepedet observatios o a radom variable X. Likewise we shall use i such a case the otatio b 2 = X (X k X ) 2 ad s 2 = k= X (X k X ) 2. k= Theorem. If X ; X 2 ; are idepedet observatios o a radom variable X which has a ite fourth momet, the both b 2 ad s 2 are cosistet estimates of V ar(x), but b 2 is ot a ubiased estimate of V ar(x). P Proof: We rst show that b 2 = X k X 2. Ideed, b 2 = i= = i= = i= k= P (Xi 2 2X X i + X 2 ) P Xi 2 2X 2 + X 2 P Xi 2 X 2. Now, we apply the law of large umbers ad theorem 2 of sectio 9: ad lemma above. Observig that the fuctio f(x; y) = y x 2 is cotiuous i (x; y), ad sice V ar(x) = E(X 2 ) (E(X)) 2, we may coclude that b 2! P V ar(x) as!. Sice s 2 = b2 ad sice by lemma 2 the costat radom variable!p, we agai obtai by theorem 2 i sectio 9:, by meas of the cotiuous fuctio g(x; y) = xy, that s 2! P V ar(x). Now we compute E(X 2 ) = E P 2 i= X2 i + P! X j X k j6=k! = 2 E(X 2 ) + P j6=k E(X j )E(X k ) = 2 (E(X 2 ) + ( )(E(X)) 2 ) = E(X2 ) + (E(X))2. 222

8 Thus, E(b 2 ) = (E(X2 ) (E(X)) 2 ) = V ar(x), which implies that b 2 is ot a ubiased estimate of V ar(x). However, sice E(s 2 ) = E(b2 ), it follows that s 2 is a ubiased estimate of V ar(x). Example 3.. Let X be a radom variable with a absolutely cotiuous distributio with desity give by f X (x) = if a < x < b b a 0 if x a or x b, where a < b are ukow costats, ad let X ; X 2 ; be idepedet observatios o X. We wish to d cosistat estimates of a ad of b by the method of momets. We compute the rst two momets of X ad obtai E(X) = a+b 2 E(X 2 ) = 3 (a2 + ab + b 2 ). Solvig for a ad b i terms of E(X) ad E(X 2 ) we obtai a = E(X) (3V ar(x)) =2, ad b = E(X) + (3V ar(x)) =2. P I example 2 we proved that s 2 = i= (X i X ) 2! P V ar(x). Sice fuctios g(x; y) = x (3y) =2 ad h(x; y) = x + (3y) =2 are cotiuous fuctios of (x; y), we obtai cosistet estimates ba ad b of a ad b respectively by ba = X (3s 2 ) =2 ad b b = X + (3s 2 ) =2. EXERCISES. All of the terms of the sequece f + : = ; 2; g may be cosidered as radom variables. Prove that this sequece coverges i probability to. 2. Let X be a radom variable with discrete desity give by P ([X = ]) = pe ( p)e!! 223 for = 0; ; 2;,

9 where 0 < p < is a ukow costat. If X ; X 2 ; are idepedet observatios o X, use the method of momets to d a cosistat estimate of p. 3. Let X be a radom variable with geometric distributio give by P ([X = ]) = ( p) p for = ; 2;, where 0 < p < is a ukow costat. If X ; X 2 ; are idepedet observatios o X, use the method of momets to d a cosistat estimate of p. 4. Suppose that X has a absolutely cotiuous distributio with desity give by x e x= if x > 0 f X (x) = (+) + 0 if x 0, where > 0 ad > are ukow costats. If X ; X 2 ; are idepedet observatios o X, use the method of momets to d cosistat estimates of ad. 5. Let X have a absolutely cotiuous distributio with desity give by = ( p q)e f X (x) = x + 2pe 2x + 3qe 3x if x > 0 = 0 otherwise. where p > 0, q > 0, ad p + q < are ukow costats. If X ; X 2 ; are idepedet observatios o X, use the method of momets to d cosistat estimates of p ad q 9.3 Maximum Likelihood Estimatio. Give a set of observable radom variables whose joit distributio depeds o oe or more ukow parameters, there is the problem of dig a fuctio of these radom variables that estimates oe or more of these parameters. This fuctio is called a estimate. What properties would we like such a estimate to have? I geeral, we wat the distributio of this estimate to be cocetrated ear the true value of the parameter, whatever value this parameter might have. We might also desire that this estimate be ubiased or that it be a cosistet estimate. A maximum likelihood estimate might have oe of these properties. However, it is sometimes easy or at least possible to obtai, so it becomes a cadidate, ad from the o oe tries to d out what ice properties it has, or whether it ca be altered to have certai ice properties. This sectio is devoted oly to discussig how to obtai these estimates. 224

10 I brief, a maximum likelihood estimate is a fuctio g of the observable radom variables X that maximizes the probability of the value of X that is observed. If the radom variables X have a joit discrete desity, a desity that is sometimes writte as f X (xj) i order to show its depedece o the parameter, a maximum likelihood estimate of is a fuctio = (X) that maximizes f X (Xj _ ). Note that x is replaced by X; this is because _ X is the value of X that you get, so f X (Xj) is the probability of gettig the value that you get. If this is di cult to uderstad, have patiece, ad wait for the examples that follow. I the case where the joit distributio is absolutely cotiuous ad has desity f X (xj), the it is loosely said that f X (xj)dx is the probability of X takig a value i a small eighborhood of x, ad so the maximum likelihood estimate of i this case is that value of that maximizes the probability of gettig close to, or i a eighborhood of, the value of X that oe observes, i.e., = (X) i this case is the value of that maximizes the joit desity. At this poit it is perhaps best to cosider examples. Example. The ormal distributio. Suppose X ; ; X is a sample of idepedet observatios o a radom variable X which is N (; 2 ), where ad 2 > 0 are ukow.we kow that their joit desity is f X ; ;X (x ; ; x ) = (2 2 ) =2 expf 2 2 X i= (X i ) 2 g. Suppose that we are oly iterested i a maximum likelihood estimate, (X ; ; X ), of. We must therefore d the value of that maximizes this joit desity. This is equivalet to dig the value (X ; ; X ) of that miimizes P i= (X i ) 2. I sectio 8:3 we foud that this value of as a fuctio of X ; ; X is (X ; ; X ) = X = X i= X i. This value of maximizes the desity o matter what the value of 2 is. So if istead lookig oly for the maximum likelihood estimate fo we are also iterested i the value of the (; 2 ) that maximizes the joit desity. To do this, let = X ad look for the value of 2 that maximizes the joit 225

11 desity whe = X. Takig the derivative with respect to 2 we d that the joit desity is maximized whe 2 = b 2 = X i= (X i X ) 2. I sectio 9:2 we proved that b 2 is a cosistet but ot a ubiased estimate of 2, while s 2 is both ubiased ad cosistet. Example 2. The uiform distributio. Let X ; ; X be a sample of idepedet observatios o a radom variable X that has the uiform distributio over [0; ], for some ukow costat > 0. Thus the commo desity of these radom variables is f X (xj) = if 0 x 0 otherwise. Sice the radom variables are idepedet, their joit desity is f X ; ;X (x ; ; x j) = if 0 x i ; i 0 otherwise. From this expressio of the joit desity, it is clear that if we take b such that b < maxfx ; ; x g, the f X ; ;X (x ; ; x j b ) = 0: Whe this joit desity is positive, the smaller oe takes b the larger the desity becomes. The smallest value that b ca be the is b = maxfx ; ; x g. Thus (X b ; ; X ) = maxfx ; ; X g is a maximum likelihood estimate of. It is ot di cult to prove that (X b ; ; X ) is ot a ubiased estimate of but is a cosistet estimate of. Example 3. The hypergeometric distributio. I a lake there are N sh, where N is ukow. The problem is to estimate the value of N. Someoe catches r sh (all at the same time), marks each with a spot ad returs all of them to the lake.after a reasoable legth of time, durig which these tagged sh are assumed to have distributed themselves at radom i the lake, someoe catches s sh (agai, all at oce). (Note: r ad s are cosidered to be xed, predetermied costats.) Amog these s sh caught 226

12 there will be X tagged sh, where X is a radom variable. The discrete desity of X is give by f X (xjn) = where x is a iteger that satis es N s N s r x r x maxf0; s N + rg x mifs; rg, ad f X (xjn) = 0 for all other values of x. The problem of dig a maximum likelihood estimate of N is to d that value b N = b N(x) of N for which f X (xjn) is maximized. I order to accomplish this we cosider the ratio R(N) = f X(xjN) f X (xjn ). For those values of N for which R(N) > we kow that f X (xjn) > f X (xjn ), ad for those values of N for which R(N) < we kow that f X (xjn) is a decreasig fuctio of N. Usig the formula for the desity of X we ote (after a certai amout of algebra) that R(N) > if ad oly if N < rs=x, ad R(N) < if ad oly if N > rs=x. We see that f X (xjn) reaches its maximum value(as a fuctio of N) whe N = [rs=x]. Thus a maximum likelihood estimate of N is b N = [rs=x]. (This is a method used i wildlife estimatio ad is usually referred to as the capture-recapture metod.) Example 4. The geeral liear model. I the geeral liear model preseted i chapter 8, Y = X + Z, we saw that the joit distributio of Y was N (X; 2 ). Thus its joit desity is f Y (y) = (2 2 ) expf =2 2 (y 2 X)t (y X)g. The problem is to d a maximum likelihood estimate of ad of 2. A value of that maximizes f Y (y), whatever the value of 2, is clearly the value of that miimizes (y X) t (y X). We solved this problem i sectio 8:, dig that b = (X t X) X t Y is the value of that miimizes (y X) t (y X). Thus the maximum likelihood estimate of is b= (X t X) X t Y. We have show that this estimate is a ubiased estimate. I order to d the joit maximum likelihood estimate of ; 2, we 227

13 substitute b = (X t X) X t Y for i the formula for the joit desity ad di eretiate with respect to 2. Upo so doig, ad solvig for 2, we obtai that the joit desity is maximized whe b = (X t X) X t Y ad 2 = b 2, where b 2 = jj Y X b jj 2. However, this value of 2 is ot a ubiased estimate of 2 ; this was show i chapter 8. is EXERCISES. Let X be a radom variable with a discrete distributio whose desity 8 < p if x = f X (x) = p if x = 0 : 0 otherwise, where 0 < p < is a ukow costat. Let X ; ; X be idepedet observatios o X. Fid the joit desity of X ; ; X, ad d the maximum likelihood estimate of p. 2. Let X ; ; X deote idepedet observatios o a radom variable whose distributio is P(), where > 0 is ukow. Fid the joit desity of X ; ; X, ad d the maximum likelihood estimate,, b of. 3. Let X ; ; X be idepedet observatios o a radom variable X that has a absolutely cotiuous distributio with desity give by ( x) f X (xj) = if x 2 (0; ) 0 otherwise, where > is a ukow costat. Fid the maximum likelihood estimate of. 4. Let X ; ; X be idepedet observatios o a radom variable X with discrete distributio, whose desity is f X (xjn) = if x N N 0 otherwise. Fid the maximum likelihood estimate of N. 5. I example 2, prove that b (X ; ; X ) is a cosistet estimate of. 228

Estimation for Complete Data

Estimation 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

6. Sufficient, Complete, and Ancillary Statistics

6. Sufficient, Complete, and Ancillary Statistics Sufficiet, Complete ad Acillary Statistics http://www.math.uah.edu/stat/poit/sufficiet.xhtml 1 of 7 7/16/2009 6:13 AM Virtual Laboratories > 7. Poit Estimatio > 1 2 3 4 5 6 6. Sufficiet, Complete, ad Acillary

More information

January 25, 2017 INTRODUCTION TO MATHEMATICAL STATISTICS

January 25, 2017 INTRODUCTION TO MATHEMATICAL STATISTICS Jauary 25, 207 INTRODUCTION TO MATHEMATICAL STATISTICS Abstract. A basic itroductio to statistics assumig kowledge of probability theory.. Probability I a typical udergraduate problem i probability, we

More information

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence

Chapter 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 information

6.3 Testing Series With Positive Terms

6.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 information

Sequences and Series of Functions

Sequences and Series of Functions Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges

More information

Lecture 7: Properties of Random Samples

Lecture 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 information

Convergence of random variables. (telegram style notes) P.J.C. Spreij

Convergence 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 information

5. Likelihood Ratio Tests

5. Likelihood Ratio Tests 1 of 5 7/29/2009 3:16 PM Virtual Laboratories > 9. Hy pothesis Testig > 1 2 3 4 5 6 7 5. Likelihood Ratio Tests Prelimiaries As usual, our startig poit is a radom experimet with a uderlyig sample space,

More information

7.1 Convergence of sequences of random variables

7.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 information

Let us give one more example of MLE. Example 3. The uniform distribution U[0, θ] on the interval [0, θ] has p.d.f.

Let 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 information

Infinite Sequences and Series

Infinite 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 information

Distribution of Random Samples & Limit theorems

Distribution 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 information

7.1 Convergence of sequences of random variables

7.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 information

Resampling 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.

Resampling 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 information

Economics 241B Relation to Method of Moments and Maximum Likelihood OLSE as a Maximum Likelihood Estimator

Economics 241B Relation to Method of Moments and Maximum Likelihood OLSE as a Maximum Likelihood Estimator Ecoomics 24B Relatio to Method of Momets ad Maximum Likelihood OLSE as a Maximum Likelihood Estimator Uder Assumptio 5 we have speci ed the distributio of the error, so we ca estimate the model parameters

More information

4. Partial Sums and the Central Limit Theorem

4. 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 information

LECTURE 8: ASYMPTOTICS I

LECTURE 8: ASYMPTOTICS I LECTURE 8: ASYMPTOTICS I We are iterested i the properties of estimators as. Cosider a sequece of radom variables {, X 1}. N. M. Kiefer, Corell Uiversity, Ecoomics 60 1 Defiitio: (Weak covergece) A sequece

More information

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22

Discrete 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 information

MATH 320: Probability and Statistics 9. Estimation and Testing of Parameters. Readings: Pruim, Chapter 4

MATH 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 information

1.010 Uncertainty in Engineering Fall 2008

1.010 Uncertainty in Engineering Fall 2008 MIT OpeCourseWare http://ocw.mit.edu.00 Ucertaity i Egieerig Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu.terms. .00 - Brief Notes # 9 Poit ad Iterval

More information

Chapter 6 Infinite Series

Chapter 6 Infinite Series Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat

More information

Topic 9: Sampling Distributions of Estimators

Topic 9: Sampling Distributions of Estimators Topic 9: Samplig Distributios of Estimators Course 003, 2016 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be

More information

Introduction to Extreme Value Theory Laurens de Haan, ISM Japan, Erasmus University Rotterdam, NL University of Lisbon, PT

Introduction to Extreme Value Theory Laurens de Haan, ISM Japan, Erasmus University Rotterdam, NL University of Lisbon, PT Itroductio to Extreme Value Theory Laures de Haa, ISM Japa, 202 Itroductio to Extreme Value Theory Laures de Haa Erasmus Uiversity Rotterdam, NL Uiversity of Lisbo, PT Itroductio to Extreme Value Theory

More information

f n (x) f m (x) < ɛ/3 for all x A. By continuity of f n and f m we can find δ > 0 such that d(x, x 0 ) < δ implies that

f n (x) f m (x) < ɛ/3 for all x A. By continuity of f n and f m we can find δ > 0 such that d(x, x 0 ) < δ implies that Lecture 15 We have see that a sequece of cotiuous fuctios which is uiformly coverget produces a limit fuctio which is also cotiuous. We shall stregthe this result ow. Theorem 1 Let f : X R or (C) be a

More information

MASSACHUSETTS 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

MASSACHUSETTS 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 information

lim za n n = z lim a n n.

lim za n n = z lim a n n. Lecture 6 Sequeces ad Series Defiitio 1 By a sequece i a set A, we mea a mappig f : N A. It is customary to deote a sequece f by {s } where, s := f(). A sequece {z } of (complex) umbers is said to be coverget

More information

7 Sequences of real numbers

7 Sequences of real numbers 40 7 Sequeces of real umbers 7. Defiitios ad examples Defiitio 7... A sequece of real umbers is a real fuctio whose domai is the set N of atural umbers. Let s : N R be a sequece. The the values of s are

More information

Problem Set 4 Due Oct, 12

Problem Set 4 Due Oct, 12 EE226: Radom Processes i Systems Lecturer: Jea C. Walrad Problem Set 4 Due Oct, 12 Fall 06 GSI: Assae Gueye This problem set essetially reviews detectio theory ad hypothesis testig ad some basic otios

More information

Stat 421-SP2012 Interval Estimation Section

Stat 421-SP2012 Interval Estimation Section Stat 41-SP01 Iterval Estimatio Sectio 11.1-11. We ow uderstad (Chapter 10) how to fid poit estimators of a ukow parameter. o However, a poit estimate does ot provide ay iformatio about the ucertaity (possible

More information

Lecture Stat Maximum Likelihood Estimation

Lecture Stat Maximum Likelihood Estimation Lecture Stat 461-561 Maximum Likelihood Estimatio A.D. Jauary 2008 A.D. () Jauary 2008 1 / 63 Maximum Likelihood Estimatio Ivariace Cosistecy E ciecy Nuisace Parameters A.D. () Jauary 2008 2 / 63 Parametric

More information

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial. Taylor Polyomials ad Taylor Series It is ofte useful to approximate complicated fuctios usig simpler oes We cosider the task of approximatig a fuctio by a polyomial If f is at least -times differetiable

More information

Output Analysis and Run-Length Control

Output 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 information

Statistical Inference (Chapter 10) Statistical inference = learn about a population based on the information provided by a sample.

Statistical Inference (Chapter 10) Statistical inference = learn about a population based on the information provided by a sample. Statistical Iferece (Chapter 10) Statistical iferece = lear about a populatio based o the iformatio provided by a sample. Populatio: The set of all values of a radom variable X of iterest. Characterized

More information

Lecture 12: September 27

Lecture 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 information

Discrete Mathematics for CS Spring 2008 David Wagner Note 22

Discrete 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 information

First Year Quantitative Comp Exam Spring, Part I - 203A. f X (x) = 0 otherwise

First Year Quantitative Comp Exam Spring, Part I - 203A. f X (x) = 0 otherwise First Year Quatitative Comp Exam Sprig, 2012 Istructio: There are three parts. Aswer every questio i every part. Questio I-1 Part I - 203A A radom variable X is distributed with the margial desity: >

More information

Review Questions, Chapters 8, 9. f(y) = 0, elsewhere. F (y) = f Y(1) = n ( e y/θ) n 1 1 θ e y/θ = n θ e yn

Review Questions, Chapters 8, 9. f(y) = 0, elsewhere. F (y) = f Y(1) = n ( e y/θ) n 1 1 θ e y/θ = n θ e yn Stat 366 Lab 2 Solutios (September 2, 2006) page TA: Yury Petracheko, CAB 484, yuryp@ualberta.ca, http://www.ualberta.ca/ yuryp/ Review Questios, Chapters 8, 9 8.5 Suppose that Y, Y 2,..., Y deote a radom

More information

Statistical Inference Based on Extremum Estimators

Statistical Inference Based on Extremum Estimators T. Rotheberg Fall, 2007 Statistical Iferece Based o Extremum Estimators Itroductio Suppose 0, the true value of a p-dimesioal parameter, is kow to lie i some subset S R p : Ofte we choose to estimate 0

More information

Random Variables, Sampling and Estimation

Random 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 information

MATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and

MATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and MATH01 Real Aalysis (2008 Fall) Tutorial Note #7 Sequece ad Series of fuctio 1: Poitwise Covergece ad Uiform Covergece Part I: Poitwise Covergece Defiitio of poitwise covergece: A sequece of fuctios f

More information

Measure and Measurable Functions

Measure and Measurable Functions 3 Measure ad Measurable Fuctios 3.1 Measure o a Arbitrary σ-algebra Recall from Chapter 2 that the set M of all Lebesgue measurable sets has the followig properties: R M, E M implies E c M, E M for N implies

More information

1 Introduction to reducing variance in Monte Carlo simulations

1 Introduction to reducing variance in Monte Carlo simulations Copyright c 010 by Karl Sigma 1 Itroductio to reducig variace i Mote Carlo simulatios 11 Review of cofidece itervals for estimatig a mea I statistics, we estimate a ukow mea µ = E(X) of a distributio by

More information

Discrete Mathematics for CS Spring 2005 Clancy/Wagner Notes 21. Some Important Distributions

Discrete 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 information

Fall 2013 MTH431/531 Real analysis Section Notes

Fall 2013 MTH431/531 Real analysis Section Notes Fall 013 MTH431/531 Real aalysis Sectio 8.1-8. Notes Yi Su 013.11.1 1. Defiitio of uiform covergece. We look at a sequece of fuctios f (x) ad study the coverget property. Notice we have two parameters

More information

Direction: This test is worth 250 points. You are required to complete this test within 50 minutes.

Direction: This test is worth 250 points. You are required to complete this test within 50 minutes. Term Test October 3, 003 Name Math 56 Studet Number Directio: This test is worth 50 poits. You are required to complete this test withi 50 miutes. I order to receive full credit, aswer each problem completely

More information

Probability 2 - Notes 10. Lemma. If X is a random variable and g(x) 0 for all x in the support of f X, then P(g(X) 1) E[g(X)].

Probability 2 - Notes 10. Lemma. If X is a random variable and g(x) 0 for all x in the support of f X, then P(g(X) 1) E[g(X)]. Probability 2 - Notes 0 Some Useful Iequalities. Lemma. If X is a radom variable ad g(x 0 for all x i the support of f X, the P(g(X E[g(X]. Proof. (cotiuous case P(g(X Corollaries x:g(x f X (xdx x:g(x

More information

Exponential Families and Bayesian Inference

Exponential Families and Bayesian Inference Computer Visio Expoetial Families ad Bayesia Iferece Lecture Expoetial Families A expoetial family of distributios is a d-parameter family f(x; havig the followig form: f(x; = h(xe g(t T (x B(, (. where

More information

An Introduction to Randomized Algorithms

An 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 information

Chapter 6 Principles of Data Reduction

Chapter 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 information

Lecture 10 October Minimaxity and least favorable prior sequences

Lecture 10 October Minimaxity and least favorable prior sequences STATS 300A: Theory of Statistics Fall 205 Lecture 0 October 22 Lecturer: Lester Mackey Scribe: Brya He, Rahul Makhijai Warig: These otes may cotai factual ad/or typographic errors. 0. Miimaxity ad least

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013 MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013 Fuctioal Law of Large Numbers. Costructio of the Wieer Measure Cotet. 1. Additioal techical results o weak covergece

More information

1 Covariance Estimation

1 Covariance Estimation Eco 75 Lecture 5 Covariace Estimatio ad Optimal Weightig Matrices I this lecture, we cosider estimatio of the asymptotic covariace matrix B B of the extremum estimator b : Covariace Estimatio Lemma 4.

More information

Econ 325 Notes on Point Estimator and Confidence Interval 1 By Hiro Kasahara

Econ 325 Notes on Point Estimator and Confidence Interval 1 By Hiro Kasahara Poit Estimator Eco 325 Notes o Poit Estimator ad Cofidece Iterval 1 By Hiro Kasahara Parameter, Estimator, ad Estimate The ormal probability desity fuctio is fully characterized by two costats: populatio

More information

Chapter 8. Euler s Gamma function

Chapter 8. Euler s Gamma function Chapter 8 Euler s Gamma fuctio The Gamma fuctio plays a importat role i the fuctioal equatio for ζ(s that we will derive i the ext chapter. I the preset chapter we have collected some properties of the

More information

Topic 9: Sampling Distributions of Estimators

Topic 9: Sampling Distributions of Estimators Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be

More information

EECS564 Estimation, Filtering, and Detection Hwk 2 Solns. Winter p θ (z) = (2θz + 1 θ), 0 z 1

EECS564 Estimation, Filtering, and Detection Hwk 2 Solns. Winter p θ (z) = (2θz + 1 θ), 0 z 1 EECS564 Estimatio, Filterig, ad Detectio Hwk 2 Sols. Witer 25 4. Let Z be a sigle observatio havig desity fuctio where. p (z) = (2z + ), z (a) Assumig that is a oradom parameter, fid ad plot the maximum

More information

Direction: This test is worth 150 points. You are required to complete this test within 55 minutes.

Direction: This test is worth 150 points. You are required to complete this test within 55 minutes. Term Test 3 (Part A) November 1, 004 Name Math 6 Studet Number Directio: This test is worth 10 poits. You are required to complete this test withi miutes. I order to receive full credit, aswer each problem

More information

Since X n /n P p, we know that X n (n. Xn (n X n ) Using the asymptotic result above to obtain an approximation for fixed n, we obtain

Since X n /n P p, we know that X n (n. Xn (n X n ) Using the asymptotic result above to obtain an approximation for fixed n, we obtain Assigmet 9 Exercise 5.5 Let X biomial, p, where p 0, 1 is ukow. Obtai cofidece itervals for p i two differet ways: a Sice X / p d N0, p1 p], the variace of the limitig distributio depeds oly o p. Use the

More information

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014. Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the

More information

Lecture 01: the Central Limit Theorem. 1 Central Limit Theorem for i.i.d. random variables

Lecture 01: the Central Limit Theorem. 1 Central Limit Theorem for i.i.d. random variables CSCI-B609: A Theorist s Toolkit, Fall 06 Aug 3 Lecture 0: the Cetral Limit Theorem Lecturer: Yua Zhou Scribe: Yua Xie & Yua Zhou Cetral Limit Theorem for iid radom variables Let us say that we wat to aalyze

More information

Topic 9: Sampling Distributions of Estimators

Topic 9: Sampling Distributions of Estimators Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be

More information

ECONOMETRIC THEORY. MODULE XIII Lecture - 34 Asymptotic Theory and Stochastic Regressors

ECONOMETRIC THEORY. MODULE XIII Lecture - 34 Asymptotic Theory and Stochastic Regressors ECONOMETRIC THEORY MODULE XIII Lecture - 34 Asymptotic Theory ad Stochastic Regressors Dr. Shalabh Departmet of Mathematics ad Statistics Idia Istitute of Techology Kapur Asymptotic theory The asymptotic

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

(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 information

Seunghee Ye Ma 8: Week 5 Oct 28

Seunghee 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 information

Lecture 8: Convergence of transformations and law of large numbers

Lecture 8: Convergence of transformations and law of large numbers Lecture 8: Covergece of trasformatios ad law of large umbers Trasformatio ad covergece Trasformatio is a importat tool i statistics. If X coverges to X i some sese, we ofte eed to check whether g(x ) coverges

More information

Introduction to Probability. Ariel Yadin

Introduction to Probability. Ariel Yadin Itroductio to robability Ariel Yadi Lecture 2 *** Ja. 7 ***. Covergece of Radom Variables As i the case of sequeces of umbers, we would like to talk about covergece of radom variables. There are may ways

More information

ECE 901 Lecture 14: Maximum Likelihood Estimation and Complexity Regularization

ECE 901 Lecture 14: Maximum Likelihood Estimation and Complexity Regularization ECE 90 Lecture 4: Maximum Likelihood Estimatio ad Complexity Regularizatio R Nowak 5/7/009 Review : Maximum Likelihood Estimatio We have iid observatios draw from a ukow distributio Y i iid p θ, i,, where

More information

INFINITE SEQUENCES AND SERIES

INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES I geeral, it is difficult to fid the exact sum of a series. We were able to accomplish this for geometric series ad the series /[(+)]. This is

More information

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

Lecture 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 information

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function. MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied

More information

Section 11.8: Power Series

Section 11.8: Power Series Sectio 11.8: Power Series 1. Power Series I this sectio, we cosider geeralizig the cocept of a series. Recall that a series is a ifiite sum of umbers a. We ca talk about whether or ot it coverges ad i

More information

FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures

FACULTY 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 information

Lecture 2: Monte Carlo Simulation

Lecture 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 information

Unbiased Estimation. February 7-12, 2008

Unbiased Estimation. February 7-12, 2008 Ubiased Estimatio February 7-2, 2008 We begi with a sample X = (X,..., X ) of radom variables chose accordig to oe of a family of probabilities P θ where θ is elemet from the parameter space Θ. For radom

More information

INEQUALITIES BJORN POONEN

INEQUALITIES BJORN POONEN INEQUALITIES BJORN POONEN 1 The AM-GM iequality The most basic arithmetic mea-geometric mea (AM-GM) iequality states simply that if x ad y are oegative real umbers, the (x + y)/2 xy, with equality if ad

More information

Expectation and Variance of a random variable

Expectation 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 information

Maximum Likelihood Estimation and Complexity Regularization

Maximum Likelihood Estimation and Complexity Regularization ECE90 Sprig 004 Statistical Regularizatio ad Learig Theory Lecture: 4 Maximum Likelihood Estimatio ad Complexity Regularizatio Lecturer: Rob Nowak Scribe: Pam Limpiti Review : Maximum Likelihood Estimatio

More information

INFINITE SEQUENCES AND SERIES

INFINITE SEQUENCES AND SERIES 11 INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES 11.4 The Compariso Tests I this sectio, we will lear: How to fid the value of a series by comparig it with a kow series. COMPARISON TESTS

More information

1 Approximating Integrals using Taylor Polynomials

1 Approximating Integrals using Taylor Polynomials Seughee Ye Ma 8: Week 7 Nov Week 7 Summary This week, we will lear how we ca approximate itegrals usig Taylor series ad umerical methods. Topics Page Approximatig Itegrals usig Taylor Polyomials. Defiitios................................................

More information

The variance of a sum of independent variables is the sum of their variances, since covariances are zero. Therefore. V (xi )= n n 2 σ2 = σ2.

The variance of a sum of independent variables is the sum of their variances, since covariances are zero. Therefore. V (xi )= n n 2 σ2 = σ2. SAMPLE STATISTICS A radom sample x 1,x,,x from a distributio f(x) is a set of idepedetly ad idetically variables with x i f(x) for all i Their joit pdf is f(x 1,x,,x )=f(x 1 )f(x ) f(x )= f(x i ) The sample

More information

Lecture 18: Sampling distributions

Lecture 18: Sampling distributions Lecture 18: Samplig distributios I may applicatios, the populatio is oe or several ormal distributios (or approximately). We ow study properties of some importat statistics based o a radom sample from

More information

This exam contains 19 pages (including this cover page) and 10 questions. A Formulae sheet is provided with the exam.

This 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 information

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

Lecture 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 information

Assignment 5: Solutions

Assignment 5: Solutions McGill Uiversity Departmet of Mathematics ad Statistics MATH 54 Aalysis, Fall 05 Assigmet 5: Solutios. Let y be a ubouded sequece of positive umbers satisfyig y + > y for all N. Let x be aother sequece

More information

Exercise 4.3 Use the Continuity Theorem to prove the Cramér-Wold Theorem, Theorem. (1) φ a X(1).

Exercise 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 information

x = Pr ( X (n) βx ) =

x = Pr ( X (n) βx ) = Exercise 93 / page 45 The desity of a variable X i i 1 is fx α α a For α kow let say equal to α α > fx α α x α Pr X i x < x < Usig a Pivotal Quatity: x α 1 < x < α > x α 1 ad We solve i a similar way as

More information

LECTURE 11 LINEAR PROCESSES III: ASYMPTOTIC RESULTS

LECTURE 11 LINEAR PROCESSES III: ASYMPTOTIC RESULTS PRIL 7, 9 where LECTURE LINER PROCESSES III: SYMPTOTIC RESULTS (Phillips ad Solo (99) ad Phillips Lecture Notes o Statioary ad Nostatioary Time Series) I this lecture, we discuss the LLN ad CLT for a liear

More information

Problems from 9th edition of Probability and Statistical Inference by Hogg, Tanis and Zimmerman:

Problems 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 information

Advanced Stochastic Processes.

Advanced 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 information

Lecture 19: Convergence

Lecture 19: Convergence Lecture 19: Covergece Asymptotic approach I statistical aalysis or iferece, a key to the success of fidig a good procedure is beig able to fid some momets ad/or distributios of various statistics. I may

More information

Chapter 5. Inequalities. 5.1 The Markov and Chebyshev inequalities

Chapter 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 information

University of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck!

University of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck! Uiversity of Colorado Dever Dept. Math. & Stat. Scieces Applied Aalysis Prelimiary Exam 13 Jauary 01, 10:00 am :00 pm Name: The proctor will let you read the followig coditios before the exam begis, ad

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 3 9/11/2013. Large deviations Theory. Cramér s Theorem

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 3 9/11/2013. Large deviations Theory. Cramér s Theorem MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/5.070J Fall 203 Lecture 3 9//203 Large deviatios Theory. Cramér s Theorem Cotet.. Cramér s Theorem. 2. Rate fuctio ad properties. 3. Chage of measure techique.

More information

Chapter 8. Euler s Gamma function

Chapter 8. Euler s Gamma function Chapter 8 Euler s Gamma fuctio The Gamma fuctio plays a importat role i the fuctioal equatio for ζ(s) that we will derive i the ext chapter. I the preset chapter we have collected some properties of the

More information

STAT Homework 1 - Solutions

STAT 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 information

Econ 325/327 Notes on Sample Mean, Sample Proportion, Central Limit Theorem, Chi-square Distribution, Student s t distribution 1.

Econ 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

Simulation. Two Rule For Inverting A Distribution Function

Simulation. 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 information

Lecture Notes for Analysis Class

Lecture Notes for Analysis Class Lecture Notes for Aalysis Class Topological Spaces A topology for a set X is a collectio T of subsets of X such that: (a) X ad the empty set are i T (b) Uios of elemets of T are i T (c) Fiite itersectios

More information