ST5215: Advanced Statistical Theory

Similar documents
Lecture 8: Convergence of transformations and law of large numbers

Probability and Random Processes

Lecture 19: Convergence

Solutions of Homework 2.

This section is optional.

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

1 Convergence in Probability and the Weak Law of Large Numbers

7.1 Convergence of sequences of random variables

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

Introduction to Probability. Ariel Yadin

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 20: Multivariate convergence and the Central Limit Theorem

Glivenko-Cantelli Classes

7.1 Convergence of sequences of random variables

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 3. Strong convergence. 3.1 Definition of almost sure convergence

Distribution of Random Samples & Limit theorems

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

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

Solutions to HW Assignment 1

Advanced Stochastic Processes.

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

STAT Homework 1 - Solutions

Sequences and Series of Functions

SDS 321: Introduction to Probability and Statistics

LECTURE 8: ASYMPTOTICS I

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

Lecture 15: Density estimation

EE 4TM4: Digital Communications II Probability Theory

Notes 19 : Martingale CLT

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

Probability for mathematicians INDEPENDENCE TAU

BIRKHOFF ERGODIC THEOREM

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

Complete Convergence for Asymptotically Almost Negatively Associated Random Variables

MAXIMAL INEQUALITIES AND STRONG LAW OF LARGE NUMBERS FOR AANA SEQUENCES

Mathematics 170B Selected HW Solutions.

Mi-Hwa Ko and Tae-Sung Kim

INFINITE SEQUENCES AND SERIES

THE STRONG LAW OF LARGE NUMBERS FOR STATIONARY SEQUENCES

Information Theory and Statistics Lecture 4: Lempel-Ziv code

ECE534, Spring 2018: Final Exam

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

Probability and Statistics

January 25, 2017 INTRODUCTION TO MATHEMATICAL STATISTICS

Lecture 2: Concentration Bounds

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

Entropy Rates and Asymptotic Equipartition

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

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

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

for all x ; ;x R. A ifiite sequece fx ; g is said to be ND if every fiite subset X ; ;X is ND. The coditios (.) ad (.3) are equivalet for =, but these

2.2. Central limit theorem.

Fourier Series and their Applications

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

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

Math 341 Lecture #31 6.5: Power Series

Learning Theory: Lecture Notes

Chapter 5. Inequalities. 5.1 The Markov and Chebyshev inequalities

An Introduction to Asymptotic Theory

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

Partial match queries: a limit process

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

Lecture 3 : Random variables and their distributions

Output Analysis and Run-Length Control

Solution to Chapter 2 Analytical Exercises

Metric Space Properties

Rates of Convergence by Moduli of Continuity

2.1. Convergence in distribution and characteristic functions.

Introduction to Probability. Ariel Yadin. Lecture 7

The Central Limit Theorem

Chapter 6 Infinite Series

MATH 312 Midterm I(Spring 2015)

Lecture 2 February 8, 2016

Lecture 12: November 13, 2018

4. Partial Sums and the Central Limit Theorem

Empirical Processes: Glivenko Cantelli Theorems

5 Birkhoff s Ergodic Theorem

2.4.2 A Theorem About Absolutely Convergent Series

M17 MAT25-21 HOMEWORK 5 SOLUTIONS

(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

Lecture 10 October Minimaxity and least favorable prior sequences

Math 525: Lecture 5. January 18, 2018

Asymptotic distribution of products of sums of independent random variables

On Random Line Segments in the Unit Square

Concentration inequalities

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

Research Article Complete Convergence for Maximal Sums of Negatively Associated Random Variables

Unbiased Estimation. February 7-12, 2008

Central Limit Theorem using Characteristic functions

Lecture 16: UMVUE: conditioning on sufficient and complete statistics

ON THE STRONG LAW OF LARGE NUMBERS FOR SEQUENCES OF PAIRWISE NEGATIVE QUADRANT DEPENDENT RANDOM VARIABLES

Element sampling: Part 2

Lecture 6: Coupon Collector s problem

lim za n n = z lim a n n.

2. The volume of the solid of revolution generated by revolving the area bounded by the

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =

Fall 2013 MTH431/531 Real analysis Section Notes

A Proof of Birkhoff s Ergodic Theorem

Math 216A Notes, Week 5

Transcription:

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 law of large umbers cocers the limitig behavior of a sum of radom variables. The weak law of large umbers (WLLN) refers to covergece i probability. The strog law of large umbers (SLLN) refers to a.s. covergece. Kroecker s Lemma: Let x R, a R, < a a +, =, 2,, ad a. If the series = x /a coverges, the a i= x i. ST525: Advaced Statistical Theory

The Law of Large Numbers (i.i.d. case) Theorem.3 (i) Weak Law of Large Numbers: Let X, X 2,... be i.i.d. radom variables. If P( X > ), the X i E(X I { X }) p. i= (ii) Strog Law of Large Numbers: Let X, X 2,... be i.i.d. radom variables. If E X <, the ad X i a.s. EX i= c i (X i EX ) a.s. i= for ay bouded sequece of real umbers {c i }. ST525: Advaced Statistical Theory

Proof: (i) Let Y j = X j I { Xj }, T = j= X j ad Z = j= Y j. The P(T Z ) P(Y j X j ) = P( X > ). () j= By Chebyshev s iequality, for ay ɛ >, ( ) Z EZ P > ɛ Var(Z ) ɛ 2 2 which sice EY 2 = = 2 x 2 df X (x) EY 2 ɛ 2, xp( X > x)dx P( X > ). Together with (), this implies the result. ST525: Advaced Statistical Theory

Proof (cot.): Hajek-Reyi s iequality: Let Y i, i =,...,, be idepedet radom variables havig fiite variaces. The ( ) P max c l l (Y l i EY i ) > ɛ ɛ 2 ci 2 Var(Y i ). i= (ii) Let Y i = X i I { Xi i}, for iteger m >, let Z m = m i= Y i, Z i = Y i, i > m. Takig c l = l i Hajek-Reyi s iequality, we have ( ) l P max (Z m l l i EZ i ) > ɛ i=m m ɛ 2 m 2 Var(Y i ) + Var(Y i ) ɛ 2 i 2. (2) i= i= i=m+ ST525: Advaced Statistical Theory

Proof (cot.): Note that = E(Y 2 ) 2 = = = j= j= =j j= =j λ E(X 2 I {j X j}) 2 E(X 2 I {j X j}) 2 je( X I {j X j}) 2 E( X I {j X j}) = λe X, j= where λ is a costat. ST525: Advaced Statistical Theory

Proof (cot.): Lettig first ad the m i (2), we have ( { }) l P (Z i EZ i ) l > ɛ l=m i=m ( ) = lim lim P l max (Z m m l l i EZ i ) > ɛ i=m m lim m ɛ 2 m 2 Var(Y i ) =. i= This implies i= Y i a.s. EX sice EY EX ad hece (/) i= EY i EX. Furthermore P(X Y ) = = P( X > ) = = P( X > ) <. = ST525: Advaced Statistical Theory

Proof (cot.): Therefore, by Borel-Catelli s lemma, P( = m= {X Y }) =, i.e., P( = m= {X = Y }) =. For ay ω = m= {X = Y }, whe is large eough, X (ω) = Y (ω). This implies X i= Y a.s., i= which, i tur, implies i= X i a.s. EX, sice we have already show that i= Y i a.s. EX. ST525: Advaced Statistical Theory

Remarks If E X <, the a = E(X I { X }) EX ad result the WLLN is actually established i Example.28 i a much simpler way. O the other had, if E X <, the a stroger result, the SLLN, ca be obtaied. Some results for the case of E X = ca be foud i Exercise 48 ad Theorem 5.4.3 i Chug (974). The ext result is for sequeces of idepedet but ot ecessarily idetically distributed radom variables. ST525: Advaced Statistical Theory

Theorem.4 (o i.i.d. case) Let X, X 2,... be idepedet radom variables with fiite expectatios. (i) (The SLLN). If there is a costat p [, 2] such that <, the i= E X i p i p (X i EX i ) a.s.. i= (ii) (The WLLN). If there is a costat p [, 2] such that lim p i= E X i p =, the (X i EX i ) p. i= ST525: Advaced Statistical Theory

Remarks Note that the coditio for SLLN implies the coditio for WLLN (Kroecker s Lemma). A obvious sufficiet coditio for SLLN with p (, 2] is sup E X p <. The WLLN ad SLLN have may applicatios i probability ad statistics. Example.32 Let f ad g be cotiuous fuctios o [, ] satisfyig f (x) Cg(x) for all x, where C > is a costat. We ow show that lim (assumig that g(x)dx ). i= f (x i) i= g(x i) dx dx 2 dx = f (x)dx g(x)dx (3) ST525: Advaced Statistical Theory

Example.32 (cotiued) Let X, X 2,... be i.i.d. radom variables havig the uiform distributio o [, ]. The E[f (X )] = f (x)dx <, E[g(X )] = By the SLLN (Theorem.3(ii)), f (X i ) a.s. E[f (X )], i= By Theorem.(i), i= f (X i) i= g(x i) a.s. g(x)dx <. g(x i ) a.s. E[g(X )], i= E[f (X )] E[g(X )]. (4) Sice the radom variable o the left-had side of (4) is bouded by C, result (3) follows from the domiated covergece theorem ad the fact that the left-had side of (3) is the expectatio of the radom variable o the left-had side of (4). ST525: Advaced Statistical Theory

Example Let T = i= X i, where X s are idepedet radom variables satisfyig P(X = ± θ ) =.5 ad θ > is a costat. We wat to show that T / a.s. whe θ <.5. For θ <.5, EX 2 2θ 2 = 2 <. = = By Theorem.4 (i), T / a.s.. ST525: Advaced Statistical Theory

Example Let T = i= X i, where X s are idepedet radom variables satisfyig P(X = ± θ ) =.5 ad θ > is a costat. We wat to show that T / a.s. whe θ <.5. For θ <.5, EX 2 2θ 2 = 2 <. = = By Theorem.4 (i), T / a.s.. Example (Exercise 65) Let X, X 2,... be idepedet radom variables. Suppose that (X j EX j ) d N(, ), σ j= where σ 2 = Var( j= X j). ST525: Advaced Statistical Theory

We wat to show that (X j EX j ) p iff σ /. j= If σ /, the by Slutsky s theorem, (X j EX j ) = σ (X j EX j ) d. j= Assume ow σ / c (, ] but j= (X j EX j ) p. By Slutsky s theorem, σ j= σ (X j EX j ) = σ j= (X j EX j ) p. This cotradicts the fact that j= (X j EX j )/σ d N(, ). Hece, j= (X j EX j ) does ot coverge to i probability. j= ST525: Advaced Statistical Theory