Lecture Chapter 6: Convergence of Random Sequences

Similar documents
Distribution of Random Samples & Limit theorems

Lecture 19: Convergence

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

7.1 Convergence of sequences of random variables

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

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

Lecture 20: Multivariate convergence and the Central Limit Theorem

7.1 Convergence of sequences of random variables

Fall 2013 MTH431/531 Real analysis Section Notes

Infinite Sequences and Series

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

Sequences and Series of Functions

MA131 - Analysis 1. Workbook 2 Sequences I

Lecture 2: Concentration Bounds

Expectation and Variance of a random variable

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

1.3 Convergence Theorems of Fourier Series. k k k k. N N k 1. With this in mind, we state (without proof) the convergence of Fourier series.

6.3 Testing Series With Positive Terms

Sequences I. Chapter Introduction

1 Lecture 2: Sequence, Series and power series (8/14/2012)

10.1 Sequences. n term. We will deal a. a n or a n n. ( 1) n ( 1) n 1 2 ( 1) a =, 0 0,,,,, ln n. n an 2. n term.

Introduction to Probability. Ariel Yadin

(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

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

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

Read carefully the instructions on the answer book and make sure that the particulars required are entered on each answer book.

Chapter 6 Infinite Series

Continuous Functions

Lecture 2: April 3, 2013

n outcome is (+1,+1, 1,..., 1). Let the r.v. X denote our position (relative to our starting point 0) after n moves. Thus X = X 1 + X 2 + +X n,

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

Notes 12 Asymptotic Series

Topics. Homework Problems. MATH 301 Introduction to Analysis Chapter Four Sequences. 1. Definition of convergence of sequences.

Lecture 8: Convergence of transformations and law of large numbers

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

Chapter 6 Principles of Data Reduction

Random Models. Tusheng Zhang. February 14, 2013

AMS570 Lecture Notes #2

Lesson 10: Limits and Continuity

Lecture 6 Simple alternatives and the Neyman-Pearson lemma

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

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

Probability and Random Processes

HOMEWORK I: PREREQUISITES FROM MATH 727

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

Section 11.8: Power Series

Parameter, Statistic and Random Samples

Are the following series absolutely convergent? n=1. n 3. n=1 n. ( 1) n. n=1 n=1

Central Limit Theorem using Characteristic functions

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

f X (12) = Pr(X = 12) = Pr({(6, 6)}) = 1/36

1 Convergence in Probability and the Weak Law of Large Numbers

PRACTICE PROBLEMS FOR THE FINAL

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

Elements of Statistical Methods Lots of Data or Large Samples (Ch 8)

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22

Topic 9: Sampling Distributions of Estimators

Topic 9: Sampling Distributions of Estimators

This section is optional.

MAT1026 Calculus II Basic Convergence Tests for Series

Topic 9: Sampling Distributions of Estimators

Random Variables, Sampling and Estimation

MATH 312 Midterm I(Spring 2015)

LECTURE 8: ASYMPTOTICS I

32 estimating the cumulative distribution function

Glivenko-Cantelli Classes

4. Partial Sums and the Central Limit Theorem

Lecture 12: November 13, 2018

Lecture 4. We also define the set of possible values for the random walk as the set of all x R d such that P(S n = x) > 0 for some n.

Math Solutions to homework 6

Discrete Mathematics for CS Spring 2008 David Wagner Note 22

6 Infinite random sequences

Sequences. A Sequence is a list of numbers written in order.

2.1. Convergence in distribution and characteristic functions.

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

M17 MAT25-21 HOMEWORK 5 SOLUTIONS

ECE 6980 An Algorithmic and Information-Theoretic Toolbox for Massive Data

Notes for Lecture 11

EE 4TM4: Digital Communications II Probability Theory

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 6 9/23/2013. Brownian motion. Introduction

MATH4822E FOURIER ANALYSIS AND ITS APPLICATIONS

January 25, 2017 INTRODUCTION TO MATHEMATICAL STATISTICS

Math 341 Lecture #31 6.5: Power Series

SUMMARY OF SEQUENCES AND SERIES

Ma 530 Infinite Series I

MATH 112: HOMEWORK 6 SOLUTIONS. Problem 1: Rudin, Chapter 3, Problem s k < s k < 2 + s k+1

UNIT 2 DIFFERENT APPROACHES TO PROBABILITY THEORY

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 15

Machine Learning Theory (CS 6783)

AMS 216 Stochastic Differential Equations Lecture 02 Copyright by Hongyun Wang, UCSC ( ( )) 2 = E X 2 ( ( )) 2

Quiz No. 1. ln n n. 1. Define: an infinite sequence A function whose domain is N 2. Define: a convergent sequence A sequence that has a limit

On a Smarandache problem concerning the prime gaps

STAT Homework 1 - Solutions

1 The Haar functions and the Brownian motion

Math 10A final exam, December 16, 2016

MA131 - Analysis 1. Workbook 3 Sequences II

Chapter 2 The Monte Carlo Method

MA Advanced Econometrics: Properties of Least Squares Estimators

Large Sample Theory. Convergence. Central Limit Theorems Asymptotic Distribution Delta Method. Convergence in Probability Convergence in Distribution

f X (12) = Pr(X = 12) = Pr({(6, 6)}) = 1/36

Transcription:

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 sequece X, =,,, of radom variables is called a radom sequece Covergece of a radom sequece Example Cosider the sequece of real umbers X =, =,,, + This sequece coverges to the limit l = We write lim X = l = This meas that i ay eighbourhood aroud we ca trap the sequece, ie, ɛ >, (ɛ) st for (ɛ) X l ɛ We ca pick ɛ to be very small ad make sure that the sequece will be trapped after reachig (ɛ) Therefore as ɛ decreases (ɛ) will icrease For example, i the cosidered sequece: Almost sure covergece ɛ =, (ɛ) =, ɛ =, (ɛ) = Defiitio A radom sequece X, =,,, 3,, coverges almost surely, or with probability oe, to the radom variable X iff P ( lim X = X) = We write X X

Example Let be a radom variable that is uiformly distributed o, ] Defie the radom sequece X as X = So X =, X =, X =, X 3 = 3, Let us take specific values of For istace, if = X =, X =, X = 4, X 3 = 8, We ca thik of it as a ur cotaiig sequeces, ad at each time we draw a value of, we get a sequece of fixed umbers I the example of tossig a coi, the output will be either heads or tails Whereas, i this case the output of the experimet is a radom sequece, ie, each outcome is a sequece of ifiite umbers Questio: Does this sequece of radom variables coverge? Aswer: This sequece coverges to if with probability = P ( ) X = if = with probability = P ( = ) Sice the pdf is cotiuous, the probability P ( = a) = for ay costat a Notice that the covergece of the sequece to is possible but happes with probability Therefore, we say that X coverges almost surely to, ie, X Covergece i probability Defiitio 3 A radom sequece X coverges to the radom variable X i probability if ɛ > lim P r X X ɛ} = We write : X p X Example 3 Cosider a radom variable uiformly distributed o, ] ad the sequece X defied by: with probability X = with probability Distributed as show i Figure Notice that oly X or X 3 ca be equal to for the same value of Similarly, oly oe of X 4, X 5, X 6 ad X 7 ca be equal to for the same value of ad so o ad so forth Questio: Does this sequece coverge?

X7() X6() X5() X4() X3() X() X() 5 3 4 5 6 7 8 9 5 3 4 5 6 7 8 9 5 3 4 5 6 7 8 9 5 3 4 5 6 7 8 9 5 3 4 5 6 7 8 9 5 3 4 5 6 7 8 9 5 3 4 5 6 7 8 9 Figure : Plot of the distributio of X () Aswer: Ituitively, the sequece will coverge to Let us take some examples to see how the sequece behave for = : for = 3 : = = = = =3 =3 =4 =4 From a calculus poit of view, these sequeces ever coverge to zero because there is always a jump showig up o matter how may zeros are precedig (Fig ); for ay : X () does ot coverge i the calculus sese Which meas also that X does ot coverge to zero almost surely () 3

5 X 5 3 4 5 6 Figure : Plot of the sequece for = This sequece coverges i probability sice lim P ( X ) = ɛ > Remark The observed sequece may ot coverge i calculus sese because of the itermittet jumps ; however the frequecy of those jumps goes to zero whe goes to ifiity 3 Covergece i mea square Defiitio 4 A radom sequece X coverges to a radom variable X i mea square sese if lim E X X ] = We write: X ms X Remark I mea square covergece, ot oly the frequecy of the jumps goes to zero whe goes to ifiity; but also the eergy i the jump should go to zero Example 4 Cosider a radom variable uiformly distributed over, ], ad the sequece X () defied as: a for X () = otherwise Note that P (X = a ) = ad P (X = ) = Questio: Does this sequece coverge? 4

Figure 3: Plot of the sequece X () Aswer: Let us check the differet covergece criteria we have see so far Almost sure covergece: X because Covergece i probability: X because lim P (X = ) = lim P X ɛ} = (Flash Forward: almost sure covergece covergece i probability) X X X X 3 Mea Square Covergece: E X ] = a (P (X = a ) + P (X = )), = a If a = lim E X ] ms = X, If a = lim E X ] = X does ot coverge i ms to I this example, the covergece of X i the mea square sese depeds o the value of a 4 Covergece i distributio Defiitio 5 (First attempt) A radom sequece X coverges to X i distributio if whe goes to ifiity, the values of the sequece are distributed accordig to a kow distributio We say d X X Example 5 Cosider the sequece X defied as: X i B( X = ) for i = (X i + ) mod = X for i > 5

Questio: I which sese, if ay, does this sequece coverge? Aswer: This sequece has two outcomes depedig o the value of X : X =, X : X =, X : Almost sure covergece: X does ot coverge almost surely because the probability of every jump is always equal to Covergece i probability: X does ot coverge i probability because the frequecy of the jumps is costat equal to 3 Covergece i mea square: X does ot coverge to i mea square sese because lim X E ] = E X X + ], 4 = EX ] EX ] + 4, = + + 4, 4 Covergece i distributio: At ifiity, sice we do ot kow the value of X, each value of X ca be either or with probability Hece, ay umber X is a radom variable B( ) We say, X coverges i distributio to Beroulli( ) ad we deote it by: = X d Ber( ) Example 6 (Cetral Limit Theorem)Cosider the zero-mea, uit-variace, idepedet radom variables X, X,, X ad defie the sequece S as follows: S = X + X + + X The CLT states that S coverges i distributio to N(, ), ie, Theorem Note: Almost sure covergece Covergece i mea square } S d N(, ) Covergece i probability covergece i distributio There is o relatio betwee Almost Sure ad Mea Square Covergece The relatio is uidirectioal, ie, covergece i distributio does ot imply covergece i probability either almost sure covergece or mea square covergece 6

3 Covergece of a radom sequece Example : defied as: Questio: Let the radom variable U be uiformly distributed o, ] Cosider the sequece X() = ( ) U Does this sequece coverge? if yes, i what sese(s)? Aswer: Almost sure covergece: Suppose The sequece becomes U = a I fact, for ay a, ] therefore, X X = a, X = a, X 3 = a 3, X 4 = a 4, lim X =, Remark 3 X because, by defiitio, a radom sequece coverges almost surely to the radom variable X if the sequece of fuctios X coverges for all values of U except for a set of values that has a probability zero Covergece i probability: Does X? Recall from theorem 3 of lecture 7: } d ms which meas that by provig almost-sure covergece, we get directly the covergece i probability ad i distributio However, for completeess we will formally prove that X coverges to i probability To do so, we have to prove that lim P ( X ɛ) = ɛ >, lim ɛ) = ɛ > 7

By defiitio, Thus, X = U ( ) ( ) U lim P X ɛ = lim P ɛ, () = lim P (U ɛ), () = (3) Where equatio 3 follows from the fact that fidig U, ] 3 Covergece i mea square sese: Does X coverge to i the mea square sese? I order to aswer this questio, we eed to prove that We kow that, Hece, X ms lim E X ] = lim E X ] = lim E X = lim E = lim = lim = lim U ], ], E U ], u du, ] u 3 3 = lim 3, = 4 Covergece i distributio: Does X coverge to i distributio? The formal defiitio of covergece i distributio is the followig: Hereafter, we wat to prove that X d, X d X lim F X (x) = F X (x) Recall that the limit rv X is the costat ad therefore has the followig CDF : Sice X = ( ) U, the distributio of the X i ca be derived as followig: 8

Figure 4: Plot of the CDF of Remark 4 At the CDF of X will be flip-floppig betwee (if is eve) ad (if is odd) (cf figure 5) which implies that there is a discotiuity at that poit Therefore, we say that X coverges i distributio to a CDF F X (x) except at poits where F X (x) is ot cotiuous Defiitio 6 X coverges to X i distributio, ie, X] d X iff lim F X (x) = F X (x) Remark 5 It is clear here that except at poits where F X (x) is ot cotiuous lim F X (x) = F x (x) except for x = Therefore, X coverges to X i distributio We could have deduced this directly from covergece i mea square sese or almost sure covergece Theorem a) If X X X X b) If X ms X X X c) If X X X d X d) If P X Y } = for all for a radom variable Y with E Y ] <, the ms X X X X Proof The proof is omitted Remark 6 Covergece i probability allows the sequece, at, to deviate from the mea for ay value with a small probability; whereas, covergece i mea square limits the amplitude of this deviatio whe (We ca thik of it as eergy we ca ot allow a big deviatio from the mea) 9

CDF of U CDF of X CDF of X CDF of X 3 4 Back to real aalysis Figure 5: Plot of the CDF of U, X, X ad X 3 Defiitio 7 A sequece (x ) is Cauchy if for every ɛ, there exists a large umber N st m, > N, x m x < ɛ lim,m x m x = Claim Every Cauchy sequece is coverget Couter example Cosider the sequece X Q defied as x =, x + = x+ x The limit of this sequece is give by: l = l + l, l = l +, l = ± / Q This implies that the sequece does ot coverge i Q

Couter example Cosider the sequece x = / i (, ) Obviously it does ot coverge i (, ) sice the limit l = / (, ) Defiitio 8 A space where every sequece coverges is called a complete space Theorem 3 R is a complete space Proof The proof is omitted Theorem 4 Cauchy criteria for covergece of a radom sequece ] a) X X P lim x m x = m, b) X ms X c) X X lim E x m x ] = m, lim P x m x ε] = m, = ɛ Proof The proofs are omitted Example 7 Cosider the sequece of example from last lecture, X i B( X = ) for i = (X i + ) mod = X for i > Goal: Our goal is to prove that this sequece does ot coverge i mea square usig Cauchy criteria This sequece has two outcomes depedig o the value of X : X =, X : X =, X : Therefore, E X X m ] = E X] ] + E X m E Xm X ], = + E X mx ] Cosider, without loss of geerality, that m > E X X m ] = if m is odd, E X X m ] = E X] = if m is eve Hece, lim E X X m ] if m is odd, =,m if m is eve, which implies that X does ot coverge i mea square by theorem 4-b)

Lemma Let X be a radom sequece with E X ] < X Theorem 5 Weak law of large umbers ms X iff lim m, E X mx ] exists ad is fiite Let X, X, X 3,, X i be iid radom variables E X i ] = µ, i Let The Usig the laguage of this chapter: S = X + X + + X P S µ ɛ] S µ Theorem 6 Strog law of large umbers Let X, X, X 3,, X i be iid radom variables E X i ] = µ, i Let The Usig the laguage of this chapter: S = X + X + + X ] P lim S µ ɛ = S µ Theorem 7 Cetral limit theorem Let X, X, X 3,, X i be iid radom variables E X i ] =, i Let The Usig the laguage of this chapter: Z = X + X + + X P Z z] = z Z d N(, ) π e z dz