Mathematics 170B Selected HW Solutions.

Similar documents
7.1 Convergence of sequences of random variables

7.1 Convergence of sequences of random variables

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

This section is optional.

Distribution of Random Samples & Limit theorems

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

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

Lecture 19: Convergence

Lecture 7: Properties of Random Samples

Math 132, Fall 2009 Exam 2: Solutions

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

EE 4TM4: Digital Communications II Probability Theory

4. Partial Sums and the Central Limit Theorem

LECTURE 8: ASYMPTOTICS I

Advanced Stochastic Processes.

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

HOMEWORK I: PREREQUISITES FROM MATH 727

Math 525: Lecture 5. January 18, 2018

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)].

1 Convergence in Probability and the Weak Law of Large Numbers

PLEASE MARK YOUR ANSWERS WITH AN X, not a circle! 1. (a) (b) (c) (d) (e) 3. (a) (b) (c) (d) (e) 5. (a) (b) (c) (d) (e) 7. (a) (b) (c) (d) (e)

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

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

ST5215: Advanced Statistical Theory

IIT JAM Mathematical Statistics (MS) 2006 SECTION A

Solutions to HW Assignment 1

Lecture 20: Multivariate convergence and the Central Limit Theorem

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

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

1 Introduction to reducing variance in Monte Carlo simulations

Generalized Semi- Markov Processes (GSMP)

n n 2 n n + 1 +

January 25, 2017 INTRODUCTION TO MATHEMATICAL STATISTICS

Approximations and more PMFs and PDFs

Introduction to Probability. Ariel Yadin

Seunghee Ye Ma 8: Week 5 Oct 28

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

Sequences and Series of Functions

Lecture 8: Convergence of transformations and law of large numbers

STAT Homework 1 - Solutions

Notes 5 : More on the a.s. convergence of sums

Integrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number

Solutions to Math 347 Practice Problems for the final

The Boolean Ring of Intervals

1 = δ2 (0, ), Y Y n nδ. , T n = Y Y n n. ( U n,k + X ) ( f U n,k + Y ) n 2n f U n,k + θ Y ) 2 E X1 2 X1

Please do NOT write in this box. Multiple Choice. Total

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

Lecture 2: Concentration Bounds

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

Exponential Families and Bayesian Inference

STA Object Data Analysis - A List of Projects. January 18, 2018

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

Learning Theory: Lecture Notes

JANE PROFESSOR WW Prob Lib1 Summer 2000

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

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Alternating Series. 1 n 0 2 n n THEOREM 9.14 Alternating Series Test Let a n > 0. The alternating series. 1 n a n.

6.3 Testing Series With Positive Terms

Random Models. Tusheng Zhang. February 14, 2013

Chapter 6 Infinite Series

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

REVIEW 1, MATH n=1 is convergent. (b) Determine whether a n is convergent.

MATH 31B: MIDTERM 2 REVIEW

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Mathematical Statistics - MS

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

STAT Homework 2 - Solutions

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

An alternating series is a series where the signs alternate. Generally (but not always) there is a factor of the form ( 1) n + 1

Application to Random Graphs

The Central Limit Theorem

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

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.

Probability and Statistics

5. INEQUALITIES, LIMIT THEOREMS AND GEOMETRIC PROBABILITY

ECE534, Spring 2018: Final Exam

Discrete Mathematics for CS Spring 2008 David Wagner Note 22

An Introduction to Randomized Algorithms

6 Infinite random sequences

6. Sufficient, Complete, and Ancillary Statistics

Introduction to Probability. Ariel Yadin. Lecture 7

Topic 9: Sampling Distributions of Estimators

Regression with an Evaporating Logarithmic Trend

SCORE. Exam 2. MA 114 Exam 2 Fall 2017

Solutions to Final Exam Review Problems

EFFECTIVE WLLN, SLLN, AND CLT IN STATISTICAL MODELS

Unbiased Estimation. February 7-12, 2008

Parameter, Statistic and Random Samples

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

Topic 9: Sampling Distributions of Estimators

Simulation. Two Rule For Inverting A Distribution Function

B Supplemental Notes 2 Hypergeometric, Binomial, Poisson and Multinomial Random Variables and Borel Sets

Math 2784 (or 2794W) University of Connecticut

Section 11.8: Power Series

Lecture 18: Sampling distributions

MAT1026 Calculus II Basic Convergence Tests for Series

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

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

(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

Entropy Rates and Asymptotic Equipartition

Transcription:

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 s with parameter p, ad these have MGF pe s +q. Therefore, { M (s) = Eexp s X } p = e s [ p/q pe s/ pq +q ] = [ pe s q/p +qe s p/q ]. pq (b) Compute the limit lim M (s), directly, without usig the cetral limit theorem. We wat to write M (s) i the form (1+ a ). Solvig for a gives a = [ pe s q/p +qe s p/q 1 ]. Recalligthattheexpasiooftheexpoetial ise x = 1+x+x 2 /2+ suggests that this should be rewritte i the form Sice a = p [ e s q/p 1 s q/p ] +q [ e s p/q 1+s p/q ]. (1) lim x e x 1 x x 2 = 1 2 (by applyig L Hopital s rule twice), lim a = s2 2. So, lim M (s) = e s2 /2, which is the mgf of the N(,1) distributio. F 5. Suppose X is Poisso with parameter. (a) Fid the momet geeratig fuctio M (s) of (X )/. Sice the MGF of the Poisso with parameter is e (es 1), M (s) = e s +(e s/ 1). (b) Compute the limit lim M (s), directly, without usig the cetral limit theorem. Takig logs gives [ logm (s) = e s/ s ] 1, 1

2 so usig (1) agai gives so that as i Problem F 4. lim logm (s) = s2 2, lim M (s) = e s2 /2 G 2. Suppose the radom variables X satisfy EX =, EX 2 1, ad Cov(X,X m ) for m. Show that S = X 1 + +X coverges to i probability. Solutio: The proof follows the proof of the WLLN uder a secod momet assumptio: By Chebyshev, But var(s ) = Combiig these gives P( S / ǫ) 1 ǫ 2 2var(S ). cov(x i,x j ) i,j=1 var(x i ). i=1 P( S / ǫ) 1 ǫ 2, which teds to zero as. G 3. Show that i each of the cases (a), (c), ad (d) of Problem 5 o page 288, the sequece actually coverges a.s. Solutio: For (a): EY 2 = 1, so 3 2 EY 2 <. Therefore Y 2 a.s., so Y a.s. For (c), E Y = 1, so 2 E Y <. Therefore Y a.s. For (d), there are two possible approaches: Oe is to show that E(1 Y ) 2 8 =, ad proceed as i the other cases. The (+1)(+2) other is to ote that Y is odecreasig i ad is bouded above by 1. Therefore, Y = lim Y exists for every ω, ad satisfies Y 1. To show that Y = 1 a.s., take < ǫ < 1 ad write P(Y 1 ǫ) P(Y 1 ǫ) = (1 (ǫ/2)), which teds to zero as. Therefore P(Y < 1) = lim ǫ P(Y 1 ǫ) =.

G 4. Suppose each X takes the values ±1 with probability 1 each. 2 Show that the radom series X p coverges a.s. (which meas that the partial sums coverge a.s.) if p > 1. Solutio: The series coverges absolutely, sice X 1 = p <. p Now use the fact that absolute covergece of a series implies covergece. H 1. Suppose X are i.i.d. o-egative radom variables. (a) Show that X i probability with o further assumptios. (You did this before i case they are uiformly distributed o [ 1, 1].) Solutio: P(X / > ǫ) = P(X 1 > ǫ) as. Cosider ow two cases: (i) EX < ad (ii) EX =. Recall that the series P(X 1 > k) = P(X k > k) k k coverges i case (i) ad diverges i case (ii). (See Problem 3 o page 184. This gives the statemet i terms of itegrals rather tha sums, but there is o real differece.) (b) Express P(X k k for all k ) i terms of the probabilities P(X k > k). Solutio: [1 P(X 1 > k)]. (c) Show that k= lim P(X k k for all k ) = 1 i case (i) ad P(X k k for all k ) = for all i case (ii). (Suggestio: take logs.) 3

4 log(1+x) Solutio: Sice lim x = 1 by L Hopital, there is a ǫ > so x that x 2 log(1 x) 3x for x ǫ. 2 Therefore, for sufficietly large k, 1 2 P(X 1 > k) log[1 P(X 1 > k)] 3 2 P(X 1 > k). The required statemet ow follows from the compariso theorem for series. (d) Coclude that ( ) P {X k k for all k } = 1 i case (i) ad = i case (ii). Solutio: I case (i), this follows from ( ) P {X k k for all k } P(X k k for all k m) for ay m. I case (ii), it follows from ( ) P {X k k for all k } P(X k k for all k ). Note that by applyig this to the radom variables X /ǫ, the case (i) statemet ca be stregtheed to ( ) P {X k ǫk for all k } = 1 Bycosiderig asequece ofǫ stedig to, itcabefurtherstregtheed to P( ǫ > 1 such that k,x k ǫk) = 1. (e) Use part (d) to show that X coverges to a.s. i case (i) but ot i case (ii). Solutio: I case (i), this ow follows from part (d) ad the defiitio of the limit: for every ω { ǫ > 1 such that k,x k ǫk}, X (ω)/. Case (ii) is similar.

H 2. LetU beuiformo[,1],addefieradomvariablesx 1,X 2,... by writig the decimal expasio of U as U =.X 1 X 2 X 3. (a) Show that X 1,X 2,X 3 are idepedet. Solutio: For k =,1,...,9, ( k P(X 1 = k) = P 1 < U < k +1 ) 1 Similarly, = 1 1. P(X 1 = k,x 2 = l,x 3 = m) = 1 1 3. (b) Let P be the proportio of 3 s i the first decimal digits of U. Usig the fact that the full sequece X 1,X 2,... is i.i.d., show that P 1 a.s. 1 Solutio: Let Y i be the idicator of the evet {X i = 3}. The P = 1 Y i. Therefore, this follows from the SLLN. (c) If we take the probability space to be Ω = [,1] with the usual assigmet of probabilities ad U(ω) = ω, is it true that P 1 for 1 every ω Ω? Explai. Solutio: No, e.g., ω =.5. (d) Let Q be the proportio of 3 s i the first decimal digits of U that are followed immediately by a 7. Show that Q 1 a.s. 1 (Suggestio: cosider separately the eve k s for which X k = 3,X k+1 = 7 ad the odd k s for which X k = 3,X k+1 = 7.) Solutio: Now let Y i be the idicator of the evet {X i = 3,X i+1 = 7}. The Y i s are o loger idepedet, but the sequeces Y 1,Y 3,... ad Y 2,Y 4,... are each i.i.d. Therefore, by the SLLN, each coverges to 1 1 1 1 i= Q 2 = 1 1 2 Y 2i+1 i=1 ad 1 a.s. It follows that Y 2i+1 + 1 2 i= i=1 i=1 Y 2i Y 2i 1 1 The same argumet works for Q 2+1. You do t eed to show it, but the same argumet ca be used to showthatforayfiiteblockofdigits(say238 47), thatblockoccurs a.s. 5

6 with limitig frequecy 1 1 a.s., where is the legth of the block. A umber i [,1] is called ormal to the base 1 if it has this property (for all fiite blocks). A example of a ormal umber is obtaied by listig the positive itegers i order:.12345678911112131415161718. (e) Show that the set of ormal umbers to the base 1 i [,1] has probability 1. (This is kow as the Borel Law of Normal Numbers.) Solutio: For each fiite block B, let A B = {ω : B does ot occur with the right limitig frequecy i ω}. There are coutably may such blocks, ad P(A B ) = for each B, so ( ) P A B =. B Ay ω / B A B is ormal. Of course, the same is true for ay base b = 1,2,3,... A umber is called completely ormal if it is ormal to every base. (f) Show that the set of completely ormal umbers i [,1] has probability 1. Solutio: The argumet is the same as that for part (e), sice there are coutably may bases. K 2. Cosider a sequece of idepedet trials, each of which has three possible outcomes, A, B, C, with respective probabilities p, q, r (p+q +r = 1). Fid the probability of the evet D that a A ru of legth m occurs before a B ru of legth. Solutio: Let u = P(D X 1 = A), v = P(D X 1 = B), w = P(D X 1 = C) = P(D). The u = = P(D X 1 = A,...,X k 1 = A,X k = B)p k 2 q k=2 + P(D X 1 = A,...,X k 1 = A,X k = C)p k 2 r k=2 m vp k 2 q + k=2 k=m+1 p k 2 q + = qv+rw q +r (1 pm 1 )+p m 1. m wp k 2 r + k=2 k=m+1 p k 2 r

7 Similarly, Solvig gives P(D) = w = v = pu+rw p+r (1 q 1 ). (q +r)p m (1 q ) (q +r)p m +(p+r)q (p+q)p m q. Recall that a Poisso process with parameter λ is a radom collectio of poits o [, ) whose distributio is determied by the followig equivalet properties: (A) If T 1,T 2,... are the successive spacigs betwee poits, the T 1,T 2,... are i.i.d. with the expoetial distributio with parameter λ. (B)IfN(t)istheumber ofpoitsi[,t], thefort 1 < t 2 <, the radom variables N(t 1 ),N(t 2 ) N(t 1 ),N(t 3 ) N(t 2 ),... are idepedet Poisso radom variables with parameters λt 1,λ(t 2 t 1 ),λ(t 3 t 2 ),... I class, we checked part of the equivalece: (i) If (B) holds, the T 1 is Expoetial (λ), ad (ii) If (A) holds, the N(t) is Poisso (λ). I the ext two problems, you will check aother case of the equivalece. K 3. Suppose (B) holds. (a) Write the evet {T 1 > s,t 1 +T 2 > s+t} i terms of the radom variables N(s) ad N(s+t), ad use this to compute its probability. Solutio: P(T 1 > s,t 1 +T 2 > s+t) = P(N(s) =,N(s+t) 1) = e λ(s+t) (1+λt). (b) Write P(T 1 > s,t 1 +T 2 > s+t) i terms of the joit desity of T 1 ad T 2. Solutio: Lettig f be the joit desity, P(T 1 > s,t 1 +T 2 > s+t) = s f(u, v)dudv t s+t v s f(u, v)dudv. (c) Use the fact that the aswers to parts (a) ad (b) are equal to show that T 1 ad T 2 are idepedet Expoetial (λ). Solutio: Equatig the above expressios ad differetiatig with respect to s gives λe λ(s+t) (1+λt) = t f(s+t v,v)dv+ t f(s,v)dv.

8 Differetiatig this idetity with respect to t gives (where f 1 is the partial derivative of f with respect to the first variable) t f 1 (w v,v)dv = λ 3 te λw, where w = s+t. Differetiatig with respect to t gives i.e. Itegratig gives f 1 (w t,t) = λ 3 e λw, f 1 (s,t) = λ 3 e λ(s+t). f(s,t) = λ 2 e λ(s+t). K 4. Suppose (A) holds. (a) Write the evet {N(s) = k,n(s+t) N(s) = l} i terms of the radom variables T 1,T 2,... Solutio: Lettig S = T 1 + +T, P(N(s) = k,n(s+t) N(s) = l) = P(S k < s < S k+1,s k+l < s+t < S k+l+1 ). (b) Use the fact that the sum of k idepedet Expoetial (λ) distributed radom variables is Gamma (k,λ) to show that N(s) ad N(s+t) N(s) are idepedet Poisso distributed radom variables with parameters λs ad λt respectively. Solutio: Coditioig o the values of S k,t k+1,s k+l S k+1, ad lettigf k (x)bethegamma(k,λ)desity, givesthefollowigexpressio for the above probability: (WLOG, assume l 1) f k (x)f 1 (y)f l 1 (z)e λ(s+t x y z) dzdydx, A where A = {x < s < x+y,x+y +z < s+t}. The itegrad is e λ(s+t) λ k+l (k 1)!(l 2)! xk 1 z l 2. Itegratig o < z < s+t x y gives the followig expressio for the itegral: e λ(s+t) λ k+l x k 1 (s+t x y) l 1 dydx. (k 1)!(l 1)! x<s<x+y<s+t Itegratig s x < y < s+t x gives e λ(s+t) λ k+l (k 1)!(l 1)! s x k 1tl l dx.

9 Itegratig o < x < s gives as required. e λ(s+t)λk+l k!l! tl s k