5. INEQUALITIES, LIMIT THEOREMS AND GEOMETRIC PROBABILITY

Size: px
Start display at page:

Download "5. INEQUALITIES, LIMIT THEOREMS AND GEOMETRIC PROBABILITY"

Transcription

1 IA Probability Let Term 5 INEQUALITIES, LIMIT THEOREMS AND GEOMETRIC PROBABILITY 51 Iequalities Suppose that X 0 is a radom variable takig o-egative values ad that c > 0 is a costat The P X c E X, c is Markov s iequality It follows because P X c = E X I X c E c I X c E X = E X c c From this result we may deduce Chebyshev s iequality: for ay radom variable X ad costat c > 0, This follows by observig that P X c E X 2 c 2 P X c = P X 2 c 2, ad applyig Markov s iequality for the radom variable Y = X 2 ad costat c 2 We should ote the followig poits about Chebyshev s iequality: 1 The iequality is distributio free ; it holds for all radom variables irrespective of the distributio of the radom variable 2 If E X 2 c 2, the the iequality provides o boud o the probability 3 If E X 2 < c 2, the iequality is the best possible i the sese that give c there is a radom variable X for which the iequality holds with equality To see this suppose that d < c 2 ad let X be the radom variable X = c c with probability with probability d 2c 2, d 2c 2, 0 with probability 1 d c 2 85

2 The E X 2 = d ad P X c = d/c 2 = E X 2 /c 2 Suppose that φ : [0, [0, is a o-decreasig fuctio, with φx > 0 for x > 0, the we obtai the geeralized Chebyshev s iequality: for ay radom variable X ad c > 0, P X c E φ X φc This follows i the same way by observig that P X c P φ X φc, ad usig Markov s iequality with Y = φ X As a example, take φx = x 4 ad we obtai P X c E X 4 /c 4 The ext iequality ivolvig radom variables that we will cosider is based o the cocept of covexity A fuctio f : R R is covex if for all x 1, x 2 R ad λ 1 0, λ 2 0 with λ 1 + λ 2 = 1, we have fx fλ 1 x 1 + λ 2 x 2 λ 1 fx 1 + λ 2 fx 2 x 1 x 2 Thus a fuctio is covex if the chord joiig ay two poits x 1, fx 1 ad x 2, fx 2 o the graph of the fuctio lies above the fuctio betwee the poits It is easy to see that if fx is a covex fuctio the for x 1 < x 2 < x 3, the slope of the chord joiig the poits x 1, fx 1 ad x 2, fx 2 is less tha or equal to the slope of the chord joiig the poits x 2, fx 2 ad x 3, fx 3 ; that is this follows from the defiitio of covexity, sice fx 2 fx 1 x 2 x 1 fx 3 fx 2 x 3 x 2 ; 51 x3 x 2 x 2 = x 3 x 1 x 1 + x2 x 1 x 3 x 1 x 3, so that x3 x 2 fx 2 x 3 x 1 fx 1 + x2 x 1 x 3 x 1 fx 3, 52 86

3 ad rearragig 52 gives 51 Furthermore, from 51, it is immediate that for poits x 1 < x 2 < x 3 < x 4, we have sice we may apply 51 twice to obtai fx 2 fx 1 x 2 x 1 fx 4 fx 3 x 4 x 3, 53 fx 2 fx 1 x 2 x 1 fx 3 fx 2 x 3 x 2 fx 4 fx 3 x 4 x 3 54 It is the case that a fuctio f is covex if ad oly if 51 holds for all choices of x 1 < x 2 < x 3 Moreover, whe f is differetiable the f beig covex is equivalet to the derivative f x beig o-decreasig or f x 0; this may be see by lettig x 2 x 1 ad x 4 x 3 i 53 With a similar argumet, we may see that, whe f is covex, the fy fx y xf x, for all x, y 55 Now if f is a covex fuctio, for each 2, ad for ay poits x 1,, x R ad ay λ i 0, 1 i, with λ λ = 1, we have f λ 1 x λ x λ 1 fx λ fx 56 The proof of the iequality 56 is by iductio o The case = 2 is just the defiitio of covexity So assume that 56 holds for ay poits x 1,, x R ad ay λ i 0, 1 i, with λ λ = 1, ad suppose that we are give x 1,, x +1 R ad λ i 0, 1 i + 1, with λ λ +1 = 1 We may assume that λ i > 0 each i, otherwise the result follows by the iductive step immediately The, by first usig the case = 2 ad the the iductive hypothesis, we have +1 λ i f λ i x i = f 1 λ +1 x i + λ +1 x +1 1 λ +1 λ i 1 λ +1 f x i + λ +1 fx +1, 1 λ λ i 1 λ +1 fx i + λ +1 fx +1 = λ i fx i, 1 λ +1 87

4 completig the iductio Jese s Iequality For a radom variable X ad a covex fuctio f, fe X E fx The proof of Jese s Iequality i the case whe X takes o just fiitely may values x 1,, x, with probabilities p i = PX = x i, 1 i, with p i 0 ad p i = 1, is just a restatemet of 56, sice fe X = f p i x i p i fx i = E fx I geeral, for ay radom variable, we may use 55, to see that fx fe X X E Xf E X, ad takig the expectatio of both sides we see that E fx fe X E X E X f E X = 0, which gives the result Example 57 Arithmetic-Geometric Mea Iequality For positive real umbers x 1, x, 1/ x i 1 x i This follows by Jese s iequality applied to the covex fuctio fx = log x, ad the radom variable X which takes the value x i with probability 1, so that 1 1 log x i = E logx loge X = log x i from which we see that log 1/ x i 1 log x i, which gives the result, sice log is a icreasig fuctio 88

5 52 Weak Law of Large Numbers Theorem 58 Weak Law of Large Numbers Let X 1, X 2, be idepedet, idetically distributed radom variables with E X 1 = µ ad Var X 1 < For ay costat ɛ > 0, X X P µ > ɛ 0, as Proof By Chebyshev s iequality we have X X P µ > ɛ 1 ɛ 2 E X1 + + X 2 µ = 1 2 ɛ 2 E X X µ 2 = 1 2 ɛ 2 Var X X = = 1 ɛ 2 Var X 1 0, 2 ɛ 2 Var X 1 as required Notes 1 The statemet i Theorem 58 is ormally referred to by sayig that the radom variable X X / coverges i probability to µ, writte X X P µ, as 2 This result should be distiguished from the Strog Law of Large Numbers which states that X1 + + X P µ, as = 1 As the ame implies, the Strog Law of Large Numbers implies the Weak Law The mode of covergece i the Strog Law is referred to as covergece with probability oe or almost sure covergece 3 Notice that the requiremet that the radom variables i the Weak Law be idepedet is ot oe that we may dispese with For example, suppose that Ω = {ω 1, ω 2 } has just two poits ad let X ω 1 = 1 ad X ω 2 = 0 for each, so that the radom 89

6 variables are idetically distributed, but ot of course idepedet Let p = P {ω 1 } = 1 P {ω 2 }, where 0 < p < 1, the E X 1 = p, ad we have X 1 ω X ω 1 = 1 ad X 1 ω X ω 2 = 0, for all, so that the coclusio of Theorem 58 caot hold 4 By givig a more refied argumet it is possible to dispese with the requiremet i the statemet of the Theorem that Var X 1 < The coclusio still holds provided E X 1 < 5 It should be oticed that the Weak Law of Large Numbers is distributio free i that the particular distributio of the summads {X i } oly iflueces the result through the mea, µ, ad, i the form we have stated it, through the fact that the variace is fiite but otherwise the uderlyig distributio does ot eter the coclusio of the Theorem 6 The Weak Law of Large Numbers uderlies the frequetist iterpretatio of probability Suppose that we have idepedet repetitios of a experimet, ad we set X i = 1 if a particular outcome occurs o the ith repetitio eg, Heads, ad X i = 0, otherwise eg, Tails The E X i = p, say, where p = P X i = 1 is the probability of the outcome The X X / is the average umber of occurreces of the outcome i repetitios ad this coverges i the above sese to E X i = p; thus the probability p is the log-ru proportio of times that the outcome occurs 53 Cetral Limit Theorem Theorem 59 Cetral Limit Theorem Let X 1, X 2, be idepedet, idetically distributed radom variables with E X 1 = µ ad σ 2 = Var X 1, where 0 < σ 2 < For ay x, < x <, lim P X1 + + X µ σ x = 1 x e y2 /2 dy = Φx, 2π which is the distributio fuctio of the stadard N0, 1 distributio Sketch of Proof: We will illustrate why the result of the Theorem holds by usig momet geeratig fuctios i the case whe the momet geeratig fuctio of the {X i }, mθ = 90

7 E e θx 1, satisfies mθ < for a o-trivial rage of values of θ that is, a ope iterval which ecessarily cotais the poit θ = 0 It should be oted that this coditio o the momet geeratig fuctio is ot ecessary for the result to hold Let Y = X X µ σ, ad m θ = E e θy, the we will show that as, m θ e θ2 /2, which is the momet geeratig fuctio of the N0, 1 distributio This is sufficiet to establish the coclusio of the Theorem, although we will ot prove that i this course We ow have m θ = E e θx 1+ +X µ/σ = e θµ /σ E e θx 1+ +X /σ ad sice the {X i } are idepedet [ ad idetically distributed, this = e θµ /σ E e θx 1/σ ] [ ] θ = e θµ/σ m σ Expad the two terms usig Taylor s Theorem to see that m θ equals [ 1 θµ σ + θ2 µ 2 1 2σ 2 + O 1 + θ 3/2 σ m 0 + ] θ2 1 2σ 2 m 0 + O ; 3/2 ow, usig the fact that m 0 = E X 1 = µ, ad m 0 = E X 2 1 = σ 2 + µ 2, this shows that m θ = [1 θ2 µ 2 σ 2 + θ2 σ 2 + µ 2 2σ 2 + θ2 µ 2 ] 1 2σ 2 + O 3/2 ] = [1 + θ O e θ2 /2, as required 3/2 Notes 1 The mode of covergece described i Theorem 59 for the radom variables Y = X X µ /σ D is kow as covergece i distributio ad the coclusio is writte as Y Z, where Z N0, 1 2 Note that, like the Weak Law of Large Numbers, the Cetral Limit Theorem is distributio free, i that the uderlyig distributio of the {X i } iflueces the form of the result oly through the mea µ = E X 1 ad variace σ 2 = Var X 1 91

8 3 Note that i the Cetral Limit Theorem, by subtractig off at each stage the mea of the sum of the radom variables X X, that is µ, ad dividig by its stadard deviatio, σ, we are esurig that the radom variable Y has E Y = 0 ad Var Y = 1, for each Example 510 Normal approximatio to the biomial distributio If the radom variable Y Bi, p, we may thik of the distributio of Y as beig the same as that of the sum of iid radom variables each of which has the Beroulli distributio; thus the radom variable Y p/ p1 p has approximately the N0, 1 distributio for large Note that here p is beig held fixed ad, ulike the situatio we described i the Poisso approximatio to the biomial where ad p 0 i such a way that the product p λ > 0 Example 511 Normal approximatio to the Poisso distributio Whe the radom variable Y Poiss, where 1 is a iteger, we may thik of Y as havig the same distributio as that of the sum of iid radom variables each with the Poiss1 distributio Thus Y / has approximately the N0, 1 distributio for large The same coclusio is true for Y Poissλ for o-iteger λ; that is, Y λ/ λ is approximately N0, 1 for λ large Example 512 Opiio polls Suppose that the proportio of voters i the populatio who vote Labour is p, where p is ukow A radom sample of voters is take ad it is foud that S voters i the sample vote Labour ad we estimate p by S/ We wat to esure that S/ p < ɛ, for some small give ɛ, with high probability, 0 95, say How large must be? Note that S Bi, p, so that E S = p ad Var S = p1 p The by the Cetral Limit Theorem, we require S P p < ɛ = P ɛ Φ ɛ = 2Φ ɛ < ɛ p1 p p1 p < S p Φ ɛ p1 p , p1 p 92 p1 p p1 p sice Φx = 1 Φ x,

9 so that we eed ɛ /p1 p 1 96, that is p1 p/ɛ 2 We do ot kow the value of p, but it is always the case that p1 p 1 4, with equality occurrig whe p = 1 2, so to esure that we have the required boud we eed 1 96/2ɛ2 For example, if we take ɛ = 0 02, so that the estimate of the percetage of Labour voters is accurate to withi 2 percetage poits with 95% probability we would eed to take a sample with 2401 The typical sample size i opiio polls is 1000 which correspods to a error ɛ Geometric probability Buffo s Needle Cosider a eedle of legth r which is throw at radom o to a plae surface o which there are parallel straight lies at distace d > r apart What is the probability that the eedle itersects oe of the lies? Thik of the parallel lies ruig West-East ad let X be the distace from the poit represetig the Souther ed of the eedle to the earest lie North of that poit; if the eedle is parallel to the lies, take the right-had ed poit Let Θ be the agle that the eedle makes with the West-East lies The we will assume that X is uiformly distributed o [0, d ad Θ is uiformly distributed o [0, π], ad that X ad Θ are idepedet X Θ θ x 0 d r π r si θ The joit probability desity of X, Θ is fx, θ = 1 πd, for 0 x < d ad 0 θ π, 0 otherwise 93

10 The if A is the shaded area i the x θ plae illustrated, the probability that the eedle itersects a lie is P X r si Θ = A fx, θdxdθ = π r si θ πd dxdθ = r π si θdθ = 2r πd 0 πd This probability was derived i 1777 by the Frech mathematicia ad aturalist Georges Louis Leclerc, Comte de Buffo, who suggested a method of approximatig the value of π by repeatedly droppig a eedle ad estimatig the probability that a lie is itersect ad hece the value of π by recordig the proportio of times that the eedle crosses a lie First ote that if X Nµ, σ 2, where σ 2 is small, ad g : R R the gx = gµ + X µg µ + N gµ, g µ 2 σ 2, where the symbol may be read as approximately distributed as Now, if S = X X deotes the total umber of times that the eedle itersects a lie i drops of the eedle, where X i is the idicator of the evet that a lie is itersected o the ith drop, the S Bi, p where p = 2r/πd By the Cetral Limit Theorem we have that S / Np, p1 p/ Let gx = 2r/xd, so that gp = π ad g p = π 2 d/2r We see that a estimate of π is give by ˆπ = gs /, where ˆπ N π, π2 πd 2r 2r Oe small difficulty that arises whe oe tries to replicate Buffo s procedure for estimatig π o a computer is how to do the simulatio without usig the value of π to take radom samples of Θ from the uiform distributio o 0, π] Oe way aroud this is to geerate a sample X, Y which has the uiform distributio over a quadrat of the circle cetre the origi ad of uit radius as follows: Step 1 geerate idepedet X ad Y each with the uiform distributio o [0, 1]; Step 2 if X 2 + Y 2 > 1 repeat Step 1, otherwise take X, Y Now set Θ = 2 ta 1 Y/X, which will be uiform o 0, π 94

11 Bertrad s Paradox This results from the followig questio posed by Bertrad i 1889: What is the probability that a chord chose at radom joiig two poits of a circle of radius r has legth r? The difficulty with the questio is that there is ot a uique iterpretatio of what it meas for a chord to be chose at radom ; there are differet ways to do this ad they lead to differet probabilities for the legth, C, of the chord beig less tha r We will cosider two approaches Approach 1 Let X be a radom variable havig the uiform distributio o 0, r ad let Θ be a radom variable, idepedet of X, with the uiform distributio o 0, 2π The legth of the chord is C = 2 r 2 X 2 Θ X Costruct the chord by takig a referece lie the x-axis, say ad drawig the radius at agle Θ with the lie The take the chord at right agles to this radius at distace X from the cetre of the circle We the have P C r = P 4r 2 X 2 r 2 = P 3r/2 X = 1 3/ Approach 2 Let Θ 1 ad Θ 2 be idepedet radom variables each with the uiform distributio o 0, 2π Take the ed poits of the chord as the poits r cos Θ i, r si Θ i, i = 1, 2, o the circumferece of the circle, where the agles are measured from some referece lie The legth of the chord is C = 2r si Θ1 Θ 2 2 Θ 1 Θ 2 Θ 1 Θ 2 2π 2π π 3 π 3 5π 3 5π 3 95

12 The probability is the Θ1 Θ 2 P C r = P si = P Θ 1 Θ 2 π 3 or Θ 1 Θ 2 5π 3 this probability is the area of the shaded regio i the square divided by 2π 2 which gives the probability to be This probability is the same as whe you take oe ed of the chord as fixed say o the referece lie ad take the other ed at a poit at agle Θ uiformly distributed o 0, 2π It should be oted that both probabilities may arise as the outcomes of physical experimets which are choosig the chord at radom For example, the probability i Approach 1 would be foud if a circular disc of radius r is throw radomly oto a table o which parallel lies at distace 2r are draw; the chord would be determied by the uique lie itersectig the circle ad the distributio of the distace of ceter of the circle to the earest lie would be uiform o 0, r By cotrast, the probability i Approach 2 is obtaied if the disc is pivoted o a poit o its circumferece, which is o a give straight lie ad the disc is spu aroud that poit, the the chord would be determied by the itersectio of the give lie ad the circumferece of the disc ; Jauary 2010

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

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

This section is optional.

This section is optional. 4 Momet Geeratig Fuctios* This sectio is optioal. The momet geeratig fuctio g : R R of a radom variable X is defied as g(t) = E[e tx ]. Propositio 1. We have g () (0) = E[X ] for = 1, 2,... Proof. Therefore

More information

IIT JAM Mathematical Statistics (MS) 2006 SECTION A

IIT JAM Mathematical Statistics (MS) 2006 SECTION A IIT JAM Mathematical Statistics (MS) 6 SECTION A. If a > for ad lim a / L >, the which of the followig series is ot coverget? (a) (b) (c) (d) (d) = = a = a = a a + / a lim a a / + = lim a / a / + = lim

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

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

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

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

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

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

Mathematical Statistics - MS

Mathematical Statistics - MS Paper Specific Istructios. The examiatio is of hours duratio. There are a total of 60 questios carryig 00 marks. The etire paper is divided ito three sectios, A, B ad C. All sectios are compulsory. Questios

More information

Analytic Continuation

Analytic Continuation Aalytic Cotiuatio The stadard example of this is give by Example Let h (z) = 1 + z + z 2 + z 3 +... kow to coverge oly for z < 1. I fact h (z) = 1/ (1 z) for such z. Yet H (z) = 1/ (1 z) is defied for

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

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

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

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

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

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

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

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

EE 4TM4: Digital Communications II Probability Theory

EE 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 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

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

Learning Theory: Lecture Notes

Learning 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 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

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

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

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

ECE 330:541, Stochastic Signals and Systems Lecture Notes on Limit Theorems from Probability Fall 2002

ECE 330:541, Stochastic Signals and Systems Lecture Notes on Limit Theorems from Probability Fall 2002 ECE 330:541, Stochastic Sigals ad Systems Lecture Notes o Limit Theorems from robability Fall 00 I practice, there are two ways we ca costruct a ew sequece of radom variables from a old sequece of radom

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

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

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

(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

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

Frequentist Inference

Frequentist Inference Frequetist Iferece The topics of the ext three sectios are useful applicatios of the Cetral Limit Theorem. Without kowig aythig about the uderlyig distributio of a sequece of radom variables {X i }, for

More information

On Random Line Segments in the Unit Square

On 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 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

Mathematics 170B Selected HW Solutions.

Mathematics 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

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

Math 451: Euclidean and Non-Euclidean Geometry MWF 3pm, Gasson 204 Homework 3 Solutions

Math 451: Euclidean and Non-Euclidean Geometry MWF 3pm, Gasson 204 Homework 3 Solutions Math 451: Euclidea ad No-Euclidea Geometry MWF 3pm, Gasso 204 Homework 3 Solutios Exercises from 1.4 ad 1.5 of the otes: 4.3, 4.10, 4.12, 4.14, 4.15, 5.3, 5.4, 5.5 Exercise 4.3. Explai why Hp, q) = {x

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

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

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

S6880 #14. Variance Reduction Methods #2: Buffon s Needle Experiment

S6880 #14. Variance Reduction Methods #2: Buffon s Needle Experiment S6880 #14 Variace Reductio Methods #: Buffo s Needle Experimet 1 Buffo s Needle Experimet Origial Form Laplace Method Laplace Method Laplace Method Variats Outlie 3 Crossed Needles Crossed Needles Crossed

More information

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

32 estimating the cumulative distribution function

32 estimating the cumulative distribution function 32 estimatig the cumulative distributio fuctio 4.6 types of cofidece itervals/bads Let F be a class of distributio fuctios F ad let θ be some quatity of iterest, such as the mea of F or the whole fuctio

More information

Binomial Distribution

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

Math 220A Fall 2007 Homework #2. Will Garner A

Math 220A Fall 2007 Homework #2. Will Garner A Math 0A Fall 007 Homewor # Will Garer Pg 3 #: Show that {cis : a o-egative iteger} is dese i T = {z œ : z = }. For which values of q is {cis(q): a o-egative iteger} dese i T? To show that {cis : a o-egative

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

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

Lecture 12: November 13, 2018

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

PRELIM PROBLEM SOLUTIONS

PRELIM PROBLEM SOLUTIONS PRELIM PROBLEM SOLUTIONS THE GRAD STUDENTS + KEN Cotets. Complex Aalysis Practice Problems 2. 2. Real Aalysis Practice Problems 2. 4 3. Algebra Practice Problems 2. 8. Complex Aalysis Practice Problems

More information

Estimation of a population proportion March 23,

Estimation of a population proportion March 23, 1 Social Studies 201 Notes for March 23, 2005 Estimatio of a populatio proportio Sectio 8.5, p. 521. For the most part, we have dealt with meas ad stadard deviatios this semester. This sectio of the otes

More information

Basics of Probability Theory (for Theory of Computation courses)

Basics 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 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

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

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 2 9/9/2013. Large Deviations for i.i.d. Random Variables

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 2 9/9/2013. Large Deviations for i.i.d. Random Variables MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 2 9/9/2013 Large Deviatios for i.i.d. Radom Variables Cotet. Cheroff boud usig expoetial momet geeratig fuctios. Properties of a momet

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

Chapter 6 Sampling Distributions

Chapter 6 Sampling Distributions Chapter 6 Samplig Distributios 1 I most experimets, we have more tha oe measuremet for ay give variable, each measuremet beig associated with oe radomly selected a member of a populatio. Hece we eed to

More information

KLMED8004 Medical statistics. Part I, autumn Estimation. We have previously learned: Population and sample. New questions

KLMED8004 Medical statistics. Part I, autumn Estimation. We have previously learned: Population and sample. New questions We have previously leared: KLMED8004 Medical statistics Part I, autum 00 How kow probability distributios (e.g. biomial distributio, ormal distributio) with kow populatio parameters (mea, variace) ca give

More information

Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 19

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

ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Statistics

ACCESS 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 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

IE 230 Seat # Name < KEY > Please read these directions. Closed book and notes. 60 minutes.

IE 230 Seat # Name < KEY > Please read these directions. Closed book and notes. 60 minutes. IE 230 Seat # Name < KEY > Please read these directios. Closed book ad otes. 60 miutes. Covers through the ormal distributio, Sectio 4.7 of Motgomery ad Ruger, fourth editio. Cover page ad four pages of

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

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

Statisticians use the word population to refer the total number of (potential) observations under consideration

Statisticians use the word population to refer the total number of (potential) observations under consideration 6 Samplig Distributios Statisticias use the word populatio to refer the total umber of (potetial) observatios uder cosideratio The populatio is just the set of all possible outcomes i our sample space

More information

4.1 Sigma Notation and Riemann Sums

4.1 Sigma Notation and Riemann Sums 0 the itegral. Sigma Notatio ad Riema Sums Oe strategy for calculatig the area of a regio is to cut the regio ito simple shapes, calculate the area of each simple shape, ad the add these smaller areas

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

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

SDS 321: Introduction to Probability and Statistics

SDS 321: Introduction to Probability and Statistics SDS 321: Itroductio to Probability ad Statistics Lecture 23: Cotiuous radom variables- Iequalities, CLT Puramrita Sarkar Departmet of Statistics ad Data Sciece The Uiversity of Texas at Austi www.cs.cmu.edu/

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

ST5215: Advanced Statistical Theory

ST5215: Advanced Statistical Theory ST525: Advaced Statistical Theory Departmet of Statistics & Applied Probability Tuesday, September 7, 2 ST525: Advaced Statistical Theory Lecture : The law of large umbers The Law of Large Numbers The

More information

Statistics 511 Additional Materials

Statistics 511 Additional Materials Cofidece Itervals o mu Statistics 511 Additioal Materials This topic officially moves us from probability to statistics. We begi to discuss makig ifereces about the populatio. Oe way to differetiate probability

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

Lecture 6: Coupon Collector s problem

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

Machine Learning Brett Bernstein

Machine Learning Brett Bernstein Machie Learig Brett Berstei Week 2 Lecture: Cocept Check Exercises Starred problems are optioal. Excess Risk Decompositio 1. Let X = Y = {1, 2,..., 10}, A = {1,..., 10, 11} ad suppose the data distributio

More information

Bertrand s Postulate. Theorem (Bertrand s Postulate): For every positive integer n, there is a prime p satisfying n < p 2n.

Bertrand s Postulate. Theorem (Bertrand s Postulate): For every positive integer n, there is a prime p satisfying n < p 2n. Bertrad s Postulate Our goal is to prove the followig Theorem Bertrad s Postulate: For every positive iteger, there is a prime p satisfyig < p We remark that Bertrad s Postulate is true by ispectio for,,

More information

Lecture Chapter 6: Convergence of Random Sequences

Lecture Chapter 6: Convergence of Random Sequences ECE5: Aalysis of Radom Sigals Fall 6 Lecture Chapter 6: Covergece of Radom Sequeces Dr Salim El Rouayheb Scribe: Abhay Ashutosh Doel, Qibo Zhag, Peiwe Tia, Pegzhe Wag, Lu Liu Radom sequece Defiitio A ifiite

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

1 of 7 7/16/2009 6:06 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 6. Order Statistics Defiitios Suppose agai that we have a basic radom experimet, ad that X is a real-valued radom variable

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

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

Singular Continuous Measures by Michael Pejic 5/14/10

Singular Continuous Measures by Michael Pejic 5/14/10 Sigular Cotiuous Measures by Michael Peic 5/4/0 Prelimiaries Give a set X, a σ-algebra o X is a collectio of subsets of X that cotais X ad ad is closed uder complemetatio ad coutable uios hece, coutable

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

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

MIDTERM 3 CALCULUS 2. Monday, December 3, :15 PM to 6:45 PM. Name PRACTICE EXAM SOLUTIONS

MIDTERM 3 CALCULUS 2. Monday, December 3, :15 PM to 6:45 PM. Name PRACTICE EXAM SOLUTIONS MIDTERM 3 CALCULUS MATH 300 FALL 08 Moday, December 3, 08 5:5 PM to 6:45 PM Name PRACTICE EXAM S Please aswer all of the questios, ad show your work. You must explai your aswers to get credit. You will

More information

CS 330 Discussion - Probability

CS 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 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

Parameter, Statistic and Random Samples

Parameter, 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 information

MAT1026 Calculus II Basic Convergence Tests for Series

MAT1026 Calculus II Basic Convergence Tests for Series MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real

More information

1. By using truth tables prove that, for all statements P and Q, the statement

1. By using truth tables prove that, for all statements P and Q, the statement Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3

More information

0, otherwise. EX = E(X 1 + X n ) = EX j = np and. Var(X j ) = np(1 p). Var(X) = Var(X X n ) =

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 information

Stat 319 Theory of Statistics (2) Exercises

Stat 319 Theory of Statistics (2) Exercises Kig Saud Uiversity College of Sciece Statistics ad Operatios Research Departmet Stat 39 Theory of Statistics () Exercises Refereces:. Itroductio to Mathematical Statistics, Sixth Editio, by R. Hogg, J.

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

Approximations and more PMFs and PDFs

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

Lecture 2: Concentration Bounds

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

Topic 5 [434 marks] (i) Find the range of values of n for which. (ii) Write down the value of x dx in terms of n, when it does exist.

Topic 5 [434 marks] (i) Find the range of values of n for which. (ii) Write down the value of x dx in terms of n, when it does exist. Topic 5 [44 marks] 1a (i) Fid the rage of values of for which eists 1 Write dow the value of i terms of 1, whe it does eist Fid the solutio to the differetial equatio 1b give that y = 1 whe = π (cos si

More information

STAT 350 Handout 19 Sampling Distribution, Central Limit Theorem (6.6)

STAT 350 Handout 19 Sampling Distribution, Central Limit Theorem (6.6) STAT 350 Hadout 9 Samplig Distributio, Cetral Limit Theorem (6.6) A radom sample is a sequece of radom variables X, X 2,, X that are idepedet ad idetically distributed. o This property is ofte abbreviated

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