Problem 1 HW3. Question 2. i) We first show that for a random variable X bounded in [0, 1], since x 2 apple x, wehave
|
|
- Nicholas McDowell
- 5 years ago
- Views:
Transcription
1 Next, we show that, for any x Ø, (x) Æ 3 x x HW3 Problem i) We first show that for a random variable X bounded in [, ], since x apple x, wehave Var[X] EX [EX] apple EX [EX] EX( EX) Since EX [, ], therefore, Var(X) apple EX( EX) apple with equality holds when EX For any random variable Y bounded in [a, b], X Y a is a random variable bounded in [, ] So b a Var[Y ](b a) Var[X] (b a) EX( EX) apple (b a), with equality holds when EY b+a ii) The equality is tight Define a random variable X as ( P(X b) P(X a) Then Var[X] (b a) Question (i) Let Gamma Function : (, Œ) be defined by (x) t x e t dt It iw well known that (x + ) x (x) for any x> (By integral by parts) The second derivative d (x) d is x d (x) d x t x (ln t) e t dt > This implies that (x) is convex on (, Œ) In particular, (x) is convex on [, ], hence, for any x œ [, ], (x)! ( x)+ (x ) " Æ ( x) () + (x ) () Moreover, this, together with the formula (x + ) x (x) for any x>, yields that, for any x œ (, ), x (x) (x + ) Æ Æ x Æ By property, one has (x) Æ x Æ On the other hand,
2 Æ Æ On the other hand, d ln(x x ) +ln(x) Ø ln Ø dx Ë È This implies that x x is increasing on,,thus, / 3 x x Ø 3 Ø Hence (x) Æ 3 x x x> Let [x] be the largest integer such that [x] Æ x Thus,x [x]+x [x] and Æ x [x] < or Æ x [x]+< By property, one gets (x) ([x]+x [x]) (x ) (x ) (x [x] + ) (x [x] + ) Æ x x x Æ x [x] Æ 3 x x [x] Let x p, one gets, for any p Ø, (ii) Let f :[, Œ) æ R be a function defined by p Æ 3 p p f(x) x x x Ø Taking derivatives of lnf, one gets d lnf dx ln(x) x Æ x Æ e ln(x) Ø, thenlnf and f is increasing on (,e] x Ø e ln(x) Æ, thenlnf and f is decreasing on [e, Œ) Thus, f attains the maximum at x e Hence, for p Ø, one gets Note that e Æ 3 Æ ( Ô ) Æ ( Ô ) e One gets p p Æ e /e p p Æ e /e Æ Ô Question 3 In the follwowing, we will show four pairs of equivalences, ie, (b) (c), (b) (d), (c) (d) and (x) (c) First of all, we prove ( ) ( )
3 (b) (c) Let f(x) be the pdf of X Hence, for p Ø, one has E{ X p } Æ Œ Œ This implies that /p E{ X p } Æ 3 /p p /p K / where K 3 Ô K / Ô x p f(x) dx 3 x 3 p K p/ p K p/ p t p dt f(x) dx f(x)dx p t p dt x >t p t p P( X >t) dt p t p e t /K dt Æ 3 p K p/ u p/ e u du p p p/ Ô Ôp Æ 3 Ô K / (c) (b) By Taylor expansion, for any n Ø, one has Œ e n n k k! Ø nn k For any n Ø and t>, by Markov inequality, one gets Ô Ôp K Ôp, P( X >t)p( X n >t n ) Æ E{ X n } t n Æ Kn ( Ô n) n t n ( K ) n n n t n Let a e K and K e K, thus one has Œ (a t ) n e a t P( X >t) P( X >t) n Œ (a t ) n P( X >t)+ P( X >t) n Œ (a t ) n Æ + ( K ) n n n t n n Œ + ( a K) n nn n Œ Æ + ( a K) n e n n + e a K e a K
4
5 (d) (c) Note that, for any a>, ; Œ (a X ) n < Œ ; (a X ) n < Œ E{e a X } E E Thus, for n Ø and a /K 3, This implies and n n K3 n E{Xn } Æ E{e X /K 3 } Æ E{X n } Æ K n 3 Æ K n 3 ( n) n E{X n } /n Æ apple K 3 Ô n n a n E{Xn } Note that E( X p ) /p is increasing with respect to p Ø (by Holder inequality) Thus, for n Ø, E{ X n } /(n ) Æ E{ X n } /n Æ apple K 3 Ô n apple K 3 Ôn Ô n Ô n Since lim næœ Ô I n Ô,thus n Ô J Œ n Ô is bounded, say by K ÕÕ > Hence, n n E{ X n } /(n ) Æ apple K 3 Ôn Ô n Ô n Æ apple K 3 K ÕÕ Ôn Let K Ô K 3 K ÕÕ and one gets E( X p ) /p Æ K Ôp In the following, we will prove (a) (c) Let Y X µ, whereµ E(X) Clearly, E(Y )and thus E(e (X µ) ) Æ e /K E(e Y ) Æ e /K E( Y p ) /p Æ K Õ Ôp E( X µ p ) /p Æ K Õ Ôp for p Ø Thus, in order to prove (a) (c), itsu ces to show that E( X µ p ) /p Æ K Õ Ôp for p Ø E( X p ) /p Æ K Ôp for p Ø Let d f(x)dx, thus,e( X µ p ) /p ÎX µî p, and E( X p ) /p ÎXÎ p, (c) (a) Thus, by triangle inequality, one has E( X µ p ) /p ÎX µî p, ÆÎXÎ p, + εΠp, ÎXÎ p, + µ Æ K Ô p + µ Note that when p Ø µ +, Ô p Ø µ ; and when Æ p< µ +, there exists a constant K Õ > such that µ Æ K Õ Ôp, since there are only finite terms of p Hence, where K Õ K + K Õ E( X µ p ) /p Æ K Ô p + µ Æ K Õ Ôp, (a) (c) Similarly, by triangle inequality, one gets E( X p ) /p ÎXÎ p, ÆÎX µî p, + εΠp, ÎX µî p, + µ Æ K Õ Ô p + µ Æ K Ôp, where K K Õ + K Õ
6 Question Let S be a subset of {,,,p}, S be the size of S, X be a n p matrix and X T X/n Compatibility Condition: there exist some constants v > and > such that b j Æ S (b T b), v b j Æ b j Restricted Eigenvalue Condition: there exist some constants v > and > such that Æ b T b v b j b j Æ b j Restricted Eigenvalue Condition Compatibility Condition Let v be such that Æ b T b b j Æ b j v b j Thus, by Cauchy Schwartz inequality, one has b j v b j Æ v v b j v S b j Æ S (b T b) b j Æ b j
7 Question 5 Let Y œ R n, X be a n p matrix For Ø fixed, let ˆ arg min œr p where ÎxÎ n ÎxÎ /n for any x œ R n and Î Î Thus, for any œ R p, one has Y X n + Î Î, p j for any œ R p Y X ˆ n + Î ˆ Î Æ Y X n + Î Î Let t œ [, ] Replacing in the rightside by ˆ + t ( ˆ ), one gets Y X ˆ + Î ˆ Î n Æ Y X ˆ t X( ˆ ) + Î ˆ + t ( ˆ )Î n, j and then Î ˆ Î Æ t X( ˆ ) n t ÈY X ˆ,X( ˆ )Í n + Î ˆ + t ( ˆ )Î BY convexity of the L norm, one gets or Î ˆ Î Æ t Æ t X( ˆ ) n t ÈY X ˆ,X( ˆ )Í n + ( t) Î ˆ Î + t Î Î X( ˆ ) n t ÈY X ˆ,X( ˆ )Í n t Î ˆ Î + t Î Î Divididing t from both sides and letting t æ +, one has Æ ÈY X ˆ,X( ˆ )Í n + Î Î Î ˆ Î Note that Thus, ÈY X ˆ,X( ˆ )Í n X( ˆ ) n ÈY X,X( ˆ )Í n Æ X( ˆ ) n + ÈY X,X( ˆ )Í n + Î Î Î ˆ Î and X( ˆ ) n + Î ˆ Î ÆÈY X,X( ˆ )Í n + Î Î
Lecture 32: Taylor Series and McLaurin series We saw last day that some functions are equal to a power series on part of their domain.
Lecture 32: Taylor Series and McLaurin series We saw last day that some functions are equal to a power series on part of their domain. For example f(x) = 1 1 x = 1 + x + x2 + x 3 + = ln(1 + x) = x x2 2
More informationLecture 5: Moment generating functions
Lecture 5: Moment generating functions Definition 2.3.6. The moment generating function (mgf) of a random variable X is { x e tx f M X (t) = E(e tx X (x) if X has a pmf ) = etx f X (x)dx if X has a pdf
More information1 h 9 e $ s i n t h e o r y, a p p l i c a t i a n
T : 99 9 \ E \ : \ 4 7 8 \ \ \ \ - \ \ T \ \ \ : \ 99 9 T : 99-9 9 E : 4 7 8 / T V 9 \ E \ \ : 4 \ 7 8 / T \ V \ 9 T - w - - V w w - T w w \ T \ \ \ w \ w \ - \ w \ \ w \ \ \ T \ w \ w \ w \ w \ \ w \
More information2.1 Lecture 5: Probability spaces, Interpretation of probabilities, Random variables
Chapter 2 Kinetic Theory 2.1 Lecture 5: Probability spaces, Interpretation of probabilities, Random variables In the previous lectures the theory of thermodynamics was formulated as a purely phenomenological
More information8 Laws of large numbers
8 Laws of large numbers 8.1 Introduction We first start with the idea of standardizing a random variable. Let X be a random variable with mean µ and variance σ 2. Then Z = (X µ)/σ will be a random variable
More informationEconomics 620, Lecture 9: Asymptotics III: Maximum Likelihood Estimation
Economics 620, Lecture 9: Asymptotics III: Maximum Likelihood Estimation Nicholas M. Kiefer Cornell University Professor N. M. Kiefer (Cornell University) Lecture 9: Asymptotics III(MLE) 1 / 20 Jensen
More informationSection Taylor and Maclaurin Series
Section.0 Taylor and Maclaurin Series Ruipeng Shen Feb 5 Taylor and Maclaurin Series Main Goal: How to find a power series representation for a smooth function us assume that a smooth function has a power
More information4 Expectation & the Lebesgue Theorems
STA 205: Probability & Measure Theory Robert L. Wolpert 4 Expectation & the Lebesgue Theorems Let X and {X n : n N} be random variables on a probability space (Ω,F,P). If X n (ω) X(ω) for each ω Ω, does
More information1. Let A R be a nonempty set that is bounded from above, and let a be the least upper bound of A. Show that there exists a sequence {a n } n N
Applied Analysis prelim July 15, 216, with solutions Solve 4 of the problems 1-5 and 2 of the problems 6-8. We will only grade the first 4 problems attempted from1-5 and the first 2 attempted from problems
More information! " # $! % & '! , ) ( + - (. ) ( ) * + / 0 1 2 3 0 / 4 5 / 6 0 ; 8 7 < = 7 > 8 7 8 9 : Œ Š ž P P h ˆ Š ˆ Œ ˆ Š ˆ Ž Ž Ý Ü Ý Ü Ý Ž Ý ê ç è ± ¹ ¼ ¹ ä ± ¹ w ç ¹ è ¼ è Œ ¹ ± ¹ è ¹ è ä ç w ¹ ã ¼ ¹ ä ¹ ¼ ¹ ±
More informationHW4 : Bivariate Distributions (1) Solutions
STAT/MATH 395 A - PROBABILITY II UW Winter Quarter 7 Néhémy Lim HW4 : Bivariate Distributions () Solutions Problem. The joint probability mass function of X and Y is given by the following table : X Y
More informationDifferentiating Functions & Expressions - Edexcel Past Exam Questions
- Edecel Past Eam Questions. (a) Differentiate with respect to (i) sin + sec, (ii) { + ln ()}. 5-0 + 9 Given that y =, ¹, ( -) 8 (b) show that = ( -). (6) June 05 Q. f() = e ln, > 0. (a) Differentiate
More informationMATH Solutions to Probability Exercises
MATH 5 9 MATH 5 9 Problem. Suppose we flip a fair coin once and observe either T for tails or H for heads. Let X denote the random variable that equals when we observe tails and equals when we observe
More informationInternational Competition in Mathematics for Universtiy Students in Plovdiv, Bulgaria 1994
International Competition in Mathematics for Universtiy Students in Plovdiv, Bulgaria 1994 1 PROBLEMS AND SOLUTIONS First day July 29, 1994 Problem 1. 13 points a Let A be a n n, n 2, symmetric, invertible
More informationSolutions to Homework 2
Solutions to Homewor Due Tuesday, July 6,. Chapter. Problem solution. If the series for ln+z and ln z both converge, +z then we can find the series for ln z by term-by-term subtraction of the two series:
More informationCS145: Probability & Computing
CS45: Probability & Computing Lecture 5: Concentration Inequalities, Law of Large Numbers, Central Limit Theorem Instructor: Eli Upfal Brown University Computer Science Figure credits: Bertsekas & Tsitsiklis,
More informationFixed Points and Contractive Transformations. Ron Goldman Department of Computer Science Rice University
Fixed Points and Contractive Transformations Ron Goldman Department of Computer Science Rice University Applications Computer Graphics Fractals Bezier and B-Spline Curves and Surfaces Root Finding Newton
More informationPart IA Probability. Definitions. Based on lectures by R. Weber Notes taken by Dexter Chua. Lent 2015
Part IA Probability Definitions Based on lectures by R. Weber Notes taken by Dexter Chua Lent 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after lectures.
More informationp. 6-1 Continuous Random Variables p. 6-2
Continuous Random Variables Recall: For discrete random variables, only a finite or countably infinite number of possible values with positive probability (>). Often, there is interest in random variables
More informationMath 362, Problem set 1
Math 6, roblem set Due //. (4..8) Determine the mean variance of the mean X of a rom sample of size 9 from a distribution having pdf f(x) = 4x, < x
More informationECONOMICS 207 SPRING 2006 LABORATORY EXERCISE 5 KEY. 8 = 10(5x 2) = 9(3x + 8), x 50x 20 = 27x x = 92 x = 4. 8x 2 22x + 15 = 0 (2x 3)(4x 5) = 0
ECONOMICS 07 SPRING 006 LABORATORY EXERCISE 5 KEY Problem. Solve the following equations for x. a 5x 3x + 8 = 9 0 5x 3x + 8 9 8 = 0(5x ) = 9(3x + 8), x 0 3 50x 0 = 7x + 7 3x = 9 x = 4 b 8x x + 5 = 0 8x
More informationLecture 1 Measure concentration
CSE 29: Learning Theory Fall 2006 Lecture Measure concentration Lecturer: Sanjoy Dasgupta Scribe: Nakul Verma, Aaron Arvey, and Paul Ruvolo. Concentration of measure: examples We start with some examples
More informationMath Bootcamp 2012 Miscellaneous
Math Bootcamp 202 Miscellaneous Factorial, combination and permutation The factorial of a positive integer n denoted by n!, is the product of all positive integers less than or equal to n. Define 0! =.
More informationIf g is also continuous and strictly increasing on J, we may apply the strictly increasing inverse function g 1 to this inequality to get
18:2 1/24/2 TOPIC. Inequalities; measures of spread. This lecture explores the implications of Jensen s inequality for g-means in general, and for harmonic, geometric, arithmetic, and related means in
More informationLesson 100: The Normal Distribution. HL Math - Santowski
Lesson 100: The Normal Distribution HL Math - Santowski Objectives Introduce the Normal Distribution Properties of the Standard Normal Distribution Introduce the Central Limit Theorem Normal Distributions
More informationLimits and Continuity. 2 lim. x x x 3. lim x. lim. sinq. 5. Find the horizontal asymptote (s) of. Summer Packet AP Calculus BC Page 4
Limits and Continuity t+ 1. lim t - t + 4. lim x x x x + - 9-18 x-. lim x 0 4-x- x 4. sinq lim - q q 5. Find the horizontal asymptote (s) of 7x-18 f ( x) = x+ 8 Summer Packet AP Calculus BC Page 4 6. x
More informationCompletion Date: Monday February 11, 2008
MATH 4 (R) Winter 8 Intermediate Calculus I Solutions to Problem Set #4 Completion Date: Monday February, 8 Department of Mathematical and Statistical Sciences University of Alberta Question. [Sec..9,
More informationMath 162: Calculus IIA
Math 62: Calculus IIA Final Exam ANSWERS December 9, 26 Part A. (5 points) Evaluate the integral x 4 x 2 dx Substitute x 2 cos θ: x 8 cos dx θ ( 2 sin θ) dθ 4 x 2 2 sin θ 8 cos θ dθ 8 cos 2 θ cos θ dθ
More informationprobability of k samples out of J fall in R.
Nonparametric Techniques for Density Estimation (DHS Ch. 4) n Introduction n Estimation Procedure n Parzen Window Estimation n Parzen Window Example n K n -Nearest Neighbor Estimation Introduction Suppose
More informationUses of Asymptotic Distributions: In order to get distribution theory, we need to norm the random variable; we usually look at n 1=2 ( X n ).
1 Economics 620, Lecture 8a: Asymptotics II Uses of Asymptotic Distributions: Suppose X n! 0 in probability. (What can be said about the distribution of X n?) In order to get distribution theory, we need
More informationPart IA Probability. Theorems. Based on lectures by R. Weber Notes taken by Dexter Chua. Lent 2015
Part IA Probability Theorems Based on lectures by R. Weber Notes taken by Dexter Chua Lent 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after lectures.
More informationProbability and Measure
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 84 Paper 4, Section II 26J Let (X, A) be a measurable space. Let T : X X be a measurable map, and µ a probability
More informationMath 0230 Calculus 2 Lectures
Math 00 Calculus Lectures Chapter 8 Series Numeration of sections corresponds to the text James Stewart, Essential Calculus, Early Transcendentals, Second edition. Section 8. Sequences A sequence is a
More informationMATH 2413 TEST ON CHAPTER 4 ANSWER ALL QUESTIONS. TIME 1.5 HRS.
MATH 1 TEST ON CHAPTER ANSWER ALL QUESTIONS. TIME 1. HRS. M1c Multiple Choice Identify the choice that best completes the statement or answers the question. 1. Use the summation formulas to rewrite the
More information16.4. Power Series. Introduction. Prerequisites. Learning Outcomes
Power Series 6.4 Introduction In this Section we consider power series. These are examples of infinite series where each term contains a variable, x, raised to a positive integer power. We use the ratio
More informationRandom Variables. Cumulative Distribution Function (CDF) Amappingthattransformstheeventstotherealline.
Random Variables Amappingthattransformstheeventstotherealline. Example 1. Toss a fair coin. Define a random variable X where X is 1 if head appears and X is if tail appears. P (X =)=1/2 P (X =1)=1/2 Example
More informationAP Calculus Testbank (Chapter 9) (Mr. Surowski)
AP Calculus Testbank (Chapter 9) (Mr. Surowski) Part I. Multiple-Choice Questions n 1 1. The series will converge, provided that n 1+p + n + 1 (A) p > 1 (B) p > 2 (C) p >.5 (D) p 0 2. The series
More information5 Operations on Multiple Random Variables
EE360 Random Signal analysis Chapter 5: Operations on Multiple Random Variables 5 Operations on Multiple Random Variables Expected value of a function of r.v. s Two r.v. s: ḡ = E[g(X, Y )] = g(x, y)f X,Y
More informationMSc Mas6002, Introductory Material Mathematical Methods Exercises
MSc Mas62, Introductory Material Mathematical Methods Exercises These exercises are on a range of mathematical methods which are useful in different parts of the MSc, especially calculus and linear algebra.
More informationMATH 505b Project Random Matrices
MATH 505b Project andom Matrices Emre Demirkaya, Mark Duggan, Melike Sirlanci Tuysuzoglu April 30, 2014 1 Introduction Studies of andom Matrix Theory began in 1928. J. Wishart studied the distribution
More informationQueen s University Department of Mathematics and Statistics. MTHE/STAT 353 Final Examination April 16, 2016 Instructor: G.
Student Number Queen s University Department of Mathematics and Statistics MTHE/STAT 353 Final Examination April 6 206 Instructor: G Takahara Proctors are unable to respond to queries about the interpretation
More informationProblem Set 2: Solutions Math 201A: Fall 2016
Problem Set 2: s Math 201A: Fall 2016 Problem 1. (a) Prove that a closed subset of a complete metric space is complete. (b) Prove that a closed subset of a compact metric space is compact. (c) Prove that
More informationRandom Variables. Random variables. A numerically valued map X of an outcome ω from a sample space Ω to the real line R
In probabilistic models, a random variable is a variable whose possible values are numerical outcomes of a random phenomenon. As a function or a map, it maps from an element (or an outcome) of a sample
More informationAdvanced Calculus II Unit 7.3: 7.3.1a, 7.3.3a, 7.3.6b, 7.3.6f, 7.3.6h Unit 7.4: 7.4.1b, 7.4.1c, 7.4.2b, 7.4.3, 7.4.6, 7.4.7
Advanced Calculus II Unit 73: 73a, 733a, 736b, 736f, 736h Unit 74: 74b, 74c, 74b, 743, 746, 747 Megan Bryant October 9, 03 73a Prove the following: If lim p a = A, for some p >, then a converges absolutely
More information14 EE 2402 Engineering Mathematics III Solutions to Tutorial 3 1. For n =0; 1; 2; 3; 4; 5 verify that P n (x) is a solution of Legendre's equation wit
EE 0 Engineering Mathematics III Solutions to Tutorial. For n =0; ; ; ; ; verify that P n (x) is a solution of Legendre's equation with ff = n. Solution: Recall the Legendre's equation from your text or
More informationFormulas for probability theory and linear models SF2941
Formulas for probability theory and linear models SF2941 These pages + Appendix 2 of Gut) are permitted as assistance at the exam. 11 maj 2008 Selected formulae of probability Bivariate probability Transforms
More informationON MEHLER S FORMULA. Giovanni Peccati (Luxembourg University) Conférence Géométrie Stochastique Nantes April 7, 2016
1 / 22 ON MEHLER S FORMULA Giovanni Peccati (Luxembourg University) Conférence Géométrie Stochastique Nantes April 7, 2016 2 / 22 OVERVIEW ı I will discuss two joint works: Last, Peccati and Schulte (PTRF,
More informationEstimation theory. Parametric estimation. Properties of estimators. Minimum variance estimator. Cramer-Rao bound. Maximum likelihood estimators
Estimation theory Parametric estimation Properties of estimators Minimum variance estimator Cramer-Rao bound Maximum likelihood estimators Confidence intervals Bayesian estimation 1 Random Variables Let
More informationConvergence of sequences and series
Convergence of sequences and series A sequence f is a map from N the positive integers to a set. We often write the map outputs as f n rather than f(n). Often we just list the outputs in order and leave
More informationOn Some Estimates of the Remainder in Taylor s Formula
Journal of Mathematical Analysis and Applications 263, 246 263 (2) doi:.6/jmaa.2.7622, available online at http://www.idealibrary.com on On Some Estimates of the Remainder in Taylor s Formula G. A. Anastassiou
More informationSTA205 Probability: Week 8 R. Wolpert
INFINITE COIN-TOSS AND THE LAWS OF LARGE NUMBERS The traditional interpretation of the probability of an event E is its asymptotic frequency: the limit as n of the fraction of n repeated, similar, and
More informationNumerical Methods School of Mechanical Engineering Chung-Ang University
Part 5 Chapter 19 Numerical Differentiation Prof. Hae-Jin Choi hjchoi@cau.ac.kr 1 Chapter Objectives l Understanding the application of high-accuracy numerical differentiation formulas for equispaced data.
More informationMATH 1271 Wednesday, 5 December 2018
MATH 27 Wednesday, 5 December 208 Today: Review for Exam 3 Exam 3: Thursday, December 6; Sections 4.8-6. /6 Information on Exam 3 Six numbered problems First problem is multiple choice (five parts) See
More informationSome analysis problems 1. x x 2 +yn2, y > 0. g(y) := lim
Some analysis problems. Let f be a continuous function on R and let for n =,2,..., F n (x) = x (x t) n f(t)dt. Prove that F n is n times differentiable, and prove a simple formula for its n-th derivative.
More informationMetric Spaces. Exercises Fall 2017 Lecturer: Viveka Erlandsson. Written by M.van den Berg
Metric Spaces Exercises Fall 2017 Lecturer: Viveka Erlandsson Written by M.van den Berg School of Mathematics University of Bristol BS8 1TW Bristol, UK 1 Exercises. 1. Let X be a non-empty set, and suppose
More informationLecture Notes 5 Convergence and Limit Theorems. Convergence with Probability 1. Convergence in Mean Square. Convergence in Probability, WLLN
Lecture Notes 5 Convergence and Limit Theorems Motivation Convergence with Probability Convergence in Mean Square Convergence in Probability, WLLN Convergence in Distribution, CLT EE 278: Convergence and
More informationEE514A Information Theory I Fall 2013
EE514A Information Theory I Fall 2013 K. Mohan, Prof. J. Bilmes University of Washington, Seattle Department of Electrical Engineering Fall Quarter, 2013 http://j.ee.washington.edu/~bilmes/classes/ee514a_fall_2013/
More informationUCSD ECE250 Handout #20 Prof. Young-Han Kim Monday, February 26, Solutions to Exercise Set #7
UCSD ECE50 Handout #0 Prof. Young-Han Kim Monday, February 6, 07 Solutions to Exercise Set #7. Minimum waiting time. Let X,X,... be i.i.d. exponentially distributed random variables with parameter λ, i.e.,
More informationE[X n ]= dn dt n M X(t). ). What is the mgf? Solution. Found this the other day in the Kernel matching exercise: 1 M X (t) =
Chapter 7 Generating functions Definition 7.. Let X be a random variable. The moment generating function is given by M X (t) =E[e tx ], provided that the expectation exists for t in some neighborhood of
More informationClassnotes - MA Series and Matrices
Classnotes - MA-2 Series and Matrices Department of Mathematics Indian Institute of Technology Madras This classnote is only meant for academic use. It is not to be used for commercial purposes. For suggestions
More informationUNIVERSITY OF HOUSTON HIGH SCHOOL MATHEMATICS CONTEST Spring 2018 Calculus Test
UNIVERSITY OF HOUSTON HIGH SCHOOL MATHEMATICS CONTEST Spring 2018 Calculus Test NAME: SCHOOL: 1. Let f be some function for which you know only that if 0 < x < 1, then f(x) 5 < 0.1. Which of the following
More informationProbability Background
Probability Background Namrata Vaswani, Iowa State University August 24, 2015 Probability recap 1: EE 322 notes Quick test of concepts: Given random variables X 1, X 2,... X n. Compute the PDF of the second
More informationThe Steepest Descent Algorithm for Unconstrained Optimization
The Steepest Descent Algorithm for Unconstrained Optimization Robert M. Freund February, 2014 c 2014 Massachusetts Institute of Technology. All rights reserved. 1 1 Steepest Descent Algorithm The problem
More information10.1 Sequences. Example: A sequence is a function f(n) whose domain is a subset of the integers. Notation: *Note: n = 0 vs. n = 1.
10.1 Sequences Example: A sequence is a function f(n) whose domain is a subset of the integers. Notation: *Note: n = 0 vs. n = 1 Examples: EX1: Find a formula for the general term a n of the sequence,
More informationMath 113 (Calculus 2) Exam 4
Math 3 (Calculus ) Exam 4 November 0 November, 009 Sections 0, 3 7 Name Student ID Section Instructor In some cases a series may be seen to converge or diverge for more than one reason. For such problems
More informationStatistics 3657 : Moment Generating Functions
Statistics 3657 : Moment Generating Functions A useful tool for studying sums of independent random variables is generating functions. course we consider moment generating functions. In this Definition
More informationLA PRISE DE CALAIS. çoys, çoys, har - dis. çoys, dis. tons, mantz, tons, Gas. c est. à ce. C est à ce. coup, c est à ce
> ƒ? @ Z [ \ _ ' µ `. l 1 2 3 z Æ Ñ 6 = Ð l sl (~131 1606) rn % & +, l r s s, r 7 nr ss r r s s s, r s, r! " # $ s s ( ) r * s, / 0 s, r 4 r r 9;: < 10 r mnz, rz, r ns, 1 s ; j;k ns, q r s { } ~ l r mnz,
More informationProduct measure and Fubini s theorem
Chapter 7 Product measure and Fubini s theorem This is based on [Billingsley, Section 18]. 1. Product spaces Suppose (Ω 1, F 1 ) and (Ω 2, F 2 ) are two probability spaces. In a product space Ω = Ω 1 Ω
More informationLet X be a continuous random variable, < X < f(x) is the so called probability density function (pdf) if
University of California, Los Angeles Department of Statistics Statistics 1A Instructor: Nicolas Christou Continuous probability distributions Let X be a continuous random variable, < X < f(x) is the so
More information11.6: Ratio and Root Tests Page 1. absolutely convergent, conditionally convergent, or divergent?
.6: Ratio and Root Tests Page Questions ( 3) n n 3 ( 3) n ( ) n 5 + n ( ) n e n ( ) n+ n2 2 n Example Show that ( ) n n ln n ( n 2 ) n + 2n 2 + converges for all x. Deduce that = 0 for all x. Solutions
More informationSub-b-convex Functions. and Sub-b-convex Programming
Sub-b-convex Functions and Sub-b-convex Programming Chao Mian-tao Jian Jin-bao Liang Dong-ying Abstract: The paper studied a new generalized convex function which called sub-b-convex function, and introduced
More informationTaylor series - Solutions
Taylor series - Solutions. f(x) sin(x) sin(0) + x cos(0) + x x ( sin(0)) +!! ( cos(0)) + + x4 x5 (sin(0)) + 4! 5! 0 + x + 0 x x! + x5 5! x! + 0 + x5 (cos(0)) + x6 6! ( sin(0)) + x 7 7! + x9 9! 5! + 0 +
More informationHW1 solutions. 1. α Ef(x) β, where Ef(x) is the expected value of f(x), i.e., Ef(x) = n. i=1 p if(a i ). (The function f : R R is given.
HW1 solutions Exercise 1 (Some sets of probability distributions.) Let x be a real-valued random variable with Prob(x = a i ) = p i, i = 1,..., n, where a 1 < a 2 < < a n. Of course p R n lies in the standard
More informationGenerating and characteristic functions. Generating and Characteristic Functions. Probability generating function. Probability generating function
Generating and characteristic functions Generating and Characteristic Functions September 3, 03 Probability generating function Moment generating function Power series expansion Characteristic function
More informationn! (k 1)!(n k)! = F (X) U(0, 1). (x, y) = n(n 1) ( F (y) F (x) ) n 2
Order statistics Ex. 4. (*. Let independent variables X,..., X n have U(0, distribution. Show that for every x (0,, we have P ( X ( < x and P ( X (n > x as n. Ex. 4.2 (**. By using induction or otherwise,
More informationRandom Variables and Their Distributions
Chapter 3 Random Variables and Their Distributions A random variable (r.v.) is a function that assigns one and only one numerical value to each simple event in an experiment. We will denote r.vs by capital
More informationTeacher: Mr. Chafayay. Name: Class & Block : Date: ID: A. 3 Which function is represented by the graph?
Teacher: Mr hafayay Name: lass & lock : ate: I: Midterm Exam Math III H Multiple hoice Identify the choice that best completes the statement or answers the question Which function is represented by the
More information1 Solution to Problem 2.1
Solution to Problem 2. I incorrectly worked this exercise instead of 2.2, so I decided to include the solution anyway. a) We have X Y /3, which is a - function. It maps the interval, ) where X lives) onto
More informationBMIR Lecture Series on Probability and Statistics Fall 2015 Discrete RVs
Lecture #7 BMIR Lecture Series on Probability and Statistics Fall 2015 Department of Biomedical Engineering and Environmental Sciences National Tsing Hua University 7.1 Function of Single Variable Theorem
More informationSynopsis of Numerical Linear Algebra
Synopsis of Numerical Linear Algebra Eric de Sturler Department of Mathematics, Virginia Tech sturler@vt.edu http://www.math.vt.edu/people/sturler Iterative Methods for Linear Systems: Basics to Research
More informationFramework for functional tree simulation applied to 'golden delicious' apple trees
Purdue University Purdue e-pubs Open Access Theses Theses and Dissertations Spring 2015 Framework for functional tree simulation applied to 'golden delicious' apple trees Marek Fiser Purdue University
More informationMATH 174: Numerical Analysis I. Math Division, IMSP, UPLB 1 st Sem AY
MATH 74: Numerical Analysis I Math Division, IMSP, UPLB st Sem AY 0809 Eample : Prepare a table or the unction e or in [0,]. The dierence between adjacent abscissas is h step size. What should be the step
More informationSTA2603/205/1/2014 /2014. ry II. Tutorial letter 205/1/
STA263/25//24 Tutorial letter 25// /24 Distribution Theor ry II STA263 Semester Department of Statistics CONTENTS: Examination preparation tutorial letterr Solutions to Assignment 6 2 Dear Student, This
More informationBrownian Motion and Conditional Probability
Math 561: Theory of Probability (Spring 2018) Week 10 Brownian Motion and Conditional Probability 10.1 Standard Brownian Motion (SBM) Brownian motion is a stochastic process with both practical and theoretical
More informationError Bounds in Power Series
Error Bounds in Power Series When using a power series to approximate a function (usually a Taylor Series), we often want to know how large any potential error is on a specified interval. There are two
More informationMath 115 HW #5 Solutions
Math 5 HW #5 Solutions From 29 4 Find the power series representation for the function and determine the interval of convergence Answer: Using the geometric series formula, f(x) = 3 x 4 3 x 4 = 3(x 4 )
More informationExercises and Answers to Chapter 1
Exercises and Answers to Chapter The continuous type of random variable X has the following density function: a x, if < x < a, f (x), otherwise. Answer the following questions. () Find a. () Obtain mean
More informationFinite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product
Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )
More informationFinal exam (practice) UCLA: Math 31B, Spring 2017
Instructor: Noah White Date: Final exam (practice) UCLA: Math 3B, Spring 207 This exam has 8 questions, for a total of 80 points. Please print your working and answers neatly. Write your solutions in the
More informationF O R SOCI AL WORK RESE ARCH
7 TH EUROPE AN CONFERENCE F O R SOCI AL WORK RESE ARCH C h a l l e n g e s i n s o c i a l w o r k r e s e a r c h c o n f l i c t s, b a r r i e r s a n d p o s s i b i l i t i e s i n r e l a t i o n
More informationMA677 Assignment #3 Morgan Schreffler Due 09/19/12 Exercise 1 Using Hölder s inequality, prove Minkowski s inequality for f, g L p (R d ), p 1:
Exercise 1 Using Hölder s inequality, prove Minkowski s inequality for f, g L p (R d ), p 1: f + g p f p + g p. Proof. If f, g L p (R d ), then since f(x) + g(x) max {f(x), g(x)}, we have f(x) + g(x) p
More informationAPPM/MATH 4/5520 Solutions to Exam I Review Problems. f X 1,X 2. 2e x 1 x 2. = x 2
APPM/MATH 4/5520 Solutions to Exam I Review Problems. (a) f X (x ) f X,X 2 (x,x 2 )dx 2 x 2e x x 2 dx 2 2e 2x x was below x 2, but when marginalizing out x 2, we ran it over all values from 0 to and so
More informationConstructing Taylor Series
Constructing Taylor Series 8-8-200 The Taylor series for fx at x = c is fc + f cx c + f c 2! x c 2 + f c x c 3 + = 3! f n c x c n. By convention, f 0 = f. When c = 0, the series is called a Maclaurin series.
More informationNorthwestern University Department of Electrical Engineering and Computer Science
Northwestern University Department of Electrical Engineering and Computer Science EECS 454: Modeling and Analysis of Communication Networks Spring 2008 Probability Review As discussed in Lecture 1, probability
More informationContinuous Random Variables
1 / 24 Continuous Random Variables Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay February 27, 2013 2 / 24 Continuous Random Variables
More informationSolution. (i) Find a minimal sufficient statistic for (θ, β) and give your justification. X i=1. By the factorization theorem, ( n
Solution 1. Let (X 1,..., X n ) be a simple random sample from a distribution with probability density function given by f(x;, β) = 1 ( ) 1 β x β, 0 x, > 0, β < 1. β (i) Find a minimal sufficient statistic
More informationAP Calculus AB Semester 2 Practice Final
lass: ate: I: P alculus Semester Practice Final Multiple hoice Identify the choice that best completes the statement or answers the question. Find the constants a and b such that the function f( x) = Ï
More informationContinuous distributions
CHAPTER 7 Continuous distributions 7.. Introduction A r.v. X is said to have a continuous distribution if there exists a nonnegative function f such that P(a X b) = ˆ b a f(x)dx for every a and b. distribution.)
More informationt x 1 e t dt, and simplify the answer when possible (for example, when r is a positive even number). In particular, confirm that EX 4 = 3.
Mathematical Statistics: Homewor problems General guideline. While woring outside the classroom, use any help you want, including people, computer algebra systems, Internet, and solution manuals, but mae
More informationRegression and Statistical Inference
Regression and Statistical Inference Walid Mnif wmnif@uwo.ca Department of Applied Mathematics The University of Western Ontario, London, Canada 1 Elements of Probability 2 Elements of Probability CDF&PDF
More information