Survey
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
LIMITING DISTRIBUTIONS 1 CONVERGENCE IN DISTRIBUTION • Consider that X1, X2,…, Xn is a sequence of rvs and Yn=u(X1, X2,…, Xn) be a function of rvs with cdfs Fn(y) so that for each n=1, 2,… F ( y ) = P (Y ≤ y ) , n n lim F ( y ) = F ( y ) for all y n→∞ n where F(y) is continuous. Then, the sequence X1, X2,…, Xn is said to converge in distribution. d Y →Y n 2 CONVERGENCE IN DISTRIBUTION • Theorem: If lim F ( y ) = F ( y ) for every point y at which F(y) is continuous, then Yn is said to have a limiting distribution with cdf F(y). n→∞ n • Definition of convergence in distribution requires only that limiting function agrees with cdf at its points of continuity. 3 EXAMPLES 1. Let {Xn} be a sequence of rvs with pmf ⎧1, if x = 2 + 1 ⎪ f ( x) = P ( X = x) = ⎨ n ⎪⎩0, o.w. Find the limiting distribution of Xn. n 4 EXAMPLES 2. Let Xn have the pmf f ( x ) = 1 if x = n. n Find the limiting distribution of Xn. 5 EXAMPLES 3. Let Xn ~ N(μ, σ2) be a sequence of Normal rvs. Let X n be the sample mean. Find the limiting distribution of X n . 6 CONVERGENCE IN PROBABILITY (STOCHASTIC CONVERGENCE) • A rv Yn convergence in probability to a rv Y if lim P ( Yn − Y < ε ) = 1 n→∞ for every ε>0. Special case: Y=c where c is a constant not depending on n. The limiting distribution of Yn is degenerate at point c. 7 CHEBYSHEV’S INEQUALITY • Let X be an rv with E(X)=μ and V(X)=σ2. σ P ( X − μ < ε ) ≥ 1 − 2 ,ε > 0 ε 2 • The Chebyshev’s Inequality can be used to prove stochastic convergence in many cases. 8 CONVERGENCE IN PROBABILITY (STOCHASTIC CONVERGENCE) • The Chebyshev’s Inequality proves the convergence in probability if the following three conditions are satisfied. 1. E(Yn)=μn where lim μ n = μ . n→∞ 2. V (Yn ) = σ < ∞ for all n. 2 n 3. lim σ n2 = 0. n→∞ 9 EXAMPLES 1. Let X be an rv with E(X)=μ and V(X)=σ2<∞. For a r.s. of size n , is the sample mean. X n p Is X n → μ ? 10 EXAMPLES • Let Zn be χ and let Wn = Z n / n . 2 n 2 Show that the limiting distribution of Wn is degenerate at 0. 11 WEAK LAW OF LARGE NUMBERS • Let X1, X2,…,Xn be iid rvs withn E(Xi)=μ and V(Xi)=σ2<∞. Define X n = 1/ n∑ X i . Then, for i =1 every ε>0, ( ) lim P X n − μ < ε = 1, n→∞ that is, X n converges in probability to μ. 12 STRONG LAW OF LARGE NUMBERS • Let X1, X2,…,Xn be iid rvs withn E(Xi)=μ and V(Xi)=σ2<∞. Define X n = 1/ n∑ X i . Then, for i =1 every ε>0, ( ) P lim X n − μ < ε = 1 n→∞ that is, X n converges almost sure to μ. 13 LIMITING MOMENT GENERATING FUNCTIONS • Let rv Yn have an mgf Mn(t) that exists for all n. If lim M n ( t ) = M ( t ) , n→∞ then Yn has a limiting distribution which is defined by M(t). 14 EXAMPLES 1. Let Xn~ Gamma(n, β) where β does not depend on n. Let Yn=Xn/n. Find the limiting distribution of Yn. 15 EXAMPLES 2. Let Xn~ Exp(1) and X n be the sample mean of r.s. of size n. Find the limiting distribution of Yn = n ( X n − 1) . 16 THE CENTRAL LIMIT THEOREM • Let X1, X2,…,Xn be a sequence of iid rvs whose mgf exist in a neighborhood of 0. Let E(Xi)=μ and V(Xi)=σ2>0. Define n X n = 1/ n∑ X i . Then, i =1 Z= or n ( Xn − μ) σ n Z= ∑X i =1 i − nμ nσ d → N ( 0,1) d → N ( 0,1) . 17 EXAMPLES 1. Let Xn~ Exp(1) and X n be the sample mean of r.s. of size n. Find the limiting distribution of Yn = n ( X n − 1) . 18 EXAMPLES 2. Let X n be the sample mean from a r.s. of 2 size n=100 from χ 50 . Compute approximate value of P ( 49 < X < 51) . 19 SLUTKY’S THEOREM • If Xn→X in distribution and Yn→a, a constant, in probability, then a) YnXn→aX in distribution. b) Xn+Yn→X+a in distribution. 20 SOME THEOREMS ON LIMITING DISTRIBUTIONS • If Xn→c>0 in probability, p X n → c. • If Xn→c in probability and Yn→c in probability, then • aXn+bYn →ac+bd in probability. • XnYn →cd in probability • 1/Xn →1/c in probability for all c≠0. 21 EXAMPLES 1. X~Gamma(μ, 1). Show that n ( Xn − μ) Xn d → N ( 0,1.) 22 EXAMPLES • X~Gamma(1,n). Let Xn − n Zn = n Let Zn→N(0,1) in distribution and Yn→c in probability. Find the limiting distribution of the following a)Wn=YnZn. b)Un=Zn/n. c)Vn=Zn+Yn. 23 ORDER STATISTICS • Let X1, X2,…,Xn be a r.s. of size n from a distribution of continuous type having pdf f(x), a<x<b. Let X(1) be the smallest of Xi, X(2) be the second smallest of Xi,…, and X(n) be the largest of Xi. a < X (1) ≤ X ( 2) ≤ L ≤ X ( n ) < b • X(i) is the i-th order statistic. X (1) = min { X 1 , X 2 ,L, X n } X ( n ) = max { X 1 , X 2 ,L, X n } 24 ORDER STATISTICS • If X1, X2,…,Xn be a r.s. of size n from a population with continuous pdf f(x), then the joint pdf of the order statistics X(1), X(2),…,X(n) is g ( x(1) , x( 2) ,L, x( n ) ) = n ! f ( x(1) ) f ( x( 2) )L f ( x( n ) ) 25 ORDER STATISTICS • The Maximum Order Statistic: X(n) ( GX ( n) ( y ) = P X ( n ) ≤ y ) ∂ g X ( n) ( y ) = GX ( n) ( y ) ∂y 26 ORDER STATISTICS • The Minimum Order Statistic: X(1) ( GX (1) ( y ) = P X (1) ≤ y ) ∂ g X (1) ( y ) = GX (1) ( y ) ∂y 27 ORDER STATISTICS • k-th Order Statistic y y1 y2 … yk-1 yk yk+1 … P(X<yk) yn P(X>yk) # of possible orderings n!/{(k−1)!1!(n − k)!} fX(yk) g X k ( y) ( ) k −1 n−k n! ⎡ FX ( y ) ⎦⎤ f X ( y ) ⎣⎡1 − FX ( y ) ⎦⎤ , a < y < b = ⎣ ( k − 1)!( n − k )! 28 EXAMPLE • X~Uniform(0,θ). A r.s. of size n is taken. X(n) is the largest order statistic. Then, a) Find the limiting distribution of X(n). b) Find the limiting distribution of Zn=n(θ−X(n)). 29