Expectations and moments

Size: px
Start display at page:

Download "Expectations and moments"

Transcription

1 slidenumbers,noslidenumbers debugmode,normalmode slidenumbers debugmode Expectations and moments Helle Bunzel

2 Expectations and moments Helle Bunzel

3 Expectations of Random Variables Denition The expected value of a discrete random variable exists and is dened by E [x] = x x f (x), if and only if x jxj f (x) <? Discrete case: This is the weighted average of the values taken by x.? Clearly x x f (x) < is needed. Why is x jxj f (x) < needed?? Consider L = n= ( ) n+ n =? It can be shown that L = log(2)? Note that n= ( ) n+ n! () Expectations and moments, page 3 of 60

4 Expectations of Random Variables? Now, 2 L = L = ? Then, adding () and (2), we get 3 L = ( + 0) L = ? Same terms as in () but converges to different value (2) Expectations and moments, page 4 of 60

5 Expectations of Random Variables? Conclusion: Absolute convergence is required for uniqueness of the expected value. Expectations and moments, page 5 of 60

6 Example? A life insurance company offers a 50-year-old male $000 face value, one year term life insurance for a premium of $4.? Standard mortality tables indicate that the probability that a male in this age group will die within a year is ? What is the expected gain of the insurance company?? Dene a random variable X. What is the relevant sample space?? What are the corresponding probabilities? E [X] = ( 986) = 8? Note that 8 is not in the sample space.? Throwing a dice: What is the expected value? Expectations and moments, page 6 of 60

7 Expectations of Random Variables Denition 2 The expected value of a continuous random variable exists and is dened by E [x] = R x x f (x) dx, if and only if R x jxj f (x) dx <? This, too, can be thought of as a weighted sum.? Consider f (x) taking positive values on [a, b] and 0 elsewhere.? Let x 0 = a < x < x 2 <... < x n = b? Let x i = x i x i.? Consider the sum i= n X0 i f X0 i? Picture: xi, where X 0 i 2 [x i, x i ]. a 0 X x X 4 X x 2 2 X x 3 3 b Expectations and moments, page 7 of 60

8 Expectations of Random Variables? But lim n!, mesh!0 n Xi X 0 f i 0 i= Example Z x i =? A manufacturer mail out surveys each quarter. x x f (x) dx? The proportion of surveys returned each quarter is the outcome of a r.v. with density f (x) = 3x 2 I [0,] (x)? What is the expected proportion of returned survey any given quarter? Z Z E (x) = x f (x) dx = x3x 2 I [0,] (x) dx x Z 3 = 3x 3 dx = 4 x4 = Expectations and moments, page 8 of 60

9 Expectation of a function of a r.v.? Now, let g (x) be some function of x. Then x g (x) f (x) E [g (x)] = R g (x) f (x) dx? Intuition?? Different outcomes, but weighted by the same weights. x Expectations and moments, page 9 of 60

10 Examples? Continuous: Consider the following prot function: Π (X) = 5X 2X X is a perishable commodity delivered for processing. f (X) = +2x 0 [0,0] (x) Expected value of prot: E (Π) = Z = 3 0 = 3 0 (5x 2x) + 2x 0 [0,0] (x) dx = 3 x + 2x 2 dx = = = 3.77 Z 0 Z 0 2 x x x + 2x 0 dx Expectations and moments, page 0 of 60

11 Examples? Discrete Values Mean Y ? Consider /Y Values /4 /6 /8 /0 /2 Mean /Y = (/8)? Note!!!!! E [g (x)] 6= g (E (x)) Expectations and moments, page of 60

12 Examples? Also note that existence of E [g (x)] is not implied by existence of E [x] : Values 0 Mean Y ? Consider /Y. Absolute convergence? Expectations and moments, page 2 of 60

13 Jensen's inequality Theorem 3 Let X be a r.v. and let g be a continuos function. Then a) E [g (X)] g (E (X)) if g is convex and E [g (X)] > g (E (X)) if g is strictly convex and X is not degenerate b) E [g (X)] g (E (X)) if g is concave and E [g (X)] < g (E (X)) if g is strictly concave and X is not degenerate. Proof of a)? Since g is convex, the tangents to g lie below the function. Expectations and moments, page 3 of 60

14 Jensen's inequality? Let l (x) = a + bx be the equation for the tangent to the point (E (X), g (E (X))).? Then g (x) l (x) = a + bx 8x and g (E (X)) = a + be (X) and E (g (X)) = g (x) f (x) (a + bx) f (x) = a + be (X) = g (E (X)) and E (g (X)) = Z g (x) f (x) Z (a + bx) f (x) = a + be (X) = g (E (X)) Expectations and moments, page 4 of 60

15 Expectations of multivariate r.v.s Denition 4 Let X = (X, X 2,..., X n ) be a multivariate random variable. Then Z Z E [X] = (E [X ], E [X 2 ],..., E [X n ]) = x f X (x),..., x f Xn (x) Theorem 5 Let X = (X, X 2,..., X n ) be a multivariate random variable with density function f (x, x 2,..., x n ). Then the expectation of Y = g (x, x 2,..., x n ) is E [Y] = g (x, x 2,..., x n ) f (x, x 2,..., x n ) if X is discrete E [Y] = Z Z if X is continuous g (x, x 2,..., x n ) f (x, x 2,..., x n ) dx dx 2...dx n Expectations and moments, page 5 of 60

16 Properties of expectations. Let X be a r.v. with density f (x) and A an event for X. Then E ( A (x)) = P X (A) 2. If c is a constant the E (c) = c. 3. If c is a constant the E (cx) = ce (X). h i 4. E i= k g i (X, X 2,..., X n ) = i= k E [g i (X, X 2,..., X n )] 5. If (X, X 2,..., X n ) are independent random variables then E [ n i= X i] = n i= E [X i] Expectations and moments, page 6 of 60

17 Proof of 5. E Continuous case " n i= X i # = = = Z Z Z = E (X ) Z Z Z Z =... n = E (X i ) i= n i= n i= n x i! x i! f (x, x 2,..., x n ) dx dx 2...dx n n i= f Xi (x i )! dx dx 2...dx n Z n x i! x f X (x ) dx i=2 f Xi (x i ) i=2!! Z n n x i f Xi (x i ) dx 2...dx n i=2 i=2! dx 2...dx n Expectations and moments, page 7 of 60

18 Moments of a random variable? Two types of moments: Moments about the origin Moments about the mean. (Central moments) Denition 6 Let X be a r.v. with density f (x). Then the r 0 th moment about the origin, denoted by µ r 0 is dened as? Note that: µ 0 0 = µ 0 = E (X) µ 0 r = E (Xr ) Expectations and moments, page 8 of 60

19 Moments of a random variable Denition 7 Let X be a r.v. with density f (x) and mean µ. Then the r 0 th central moment, denoted by µ r is dened as µ r = E (X µ) r? Note that: µ 0 = µ = 0? Second central moment: Variance h V [X] = E (X µ) 2i = ( R x (x x (x µ) 2 f (x) µ)2 f (x) dx? Frequently used symbol: σ 2, standard deviation σ. Expectations and moments, page 9 of 60

20 Properties of variance? Variance of ax + b : V [ax + b] = a 2 V [X]? A useful formula: V [X] = E h X 2i µ 2? V [a] = 0.? A constant is a special case of a random variable. Variance 0 and P (X = a) =. Discrete or continuous? Expectations and moments, page 20 of 60

21 Moments of a random variable? A couple of useful inequalities: Theorem 8 Markov's Inequality: Let X be a r.v. with density function f (x), and let g be a nonnegative-valued function of X. Then P (g (X) a) E(g(X)) a for any value a > 0.? If E (g (X)) exists, we can always put an upper bound on the probability that g (X) a. Theorem 9 Chebyshev's Inequality: P (jx µj kσ) k 2 for k > 0.? The probability that x falls more than k standard deviations away from the mean of X.? No densities assumed!! Expectations and moments, page 2 of 60

22 Proof of Markov's Inequality? We will prove the continuous case. E (g (X)) = = Z Z g (x) f (x) dx fx:g(x)<ag g (x) f (x) dx + Z fx:g(x)ag g (x) f (x) dx? Note that R fx:g(x)<ag g (x) f (x) dx 0 How do we know that? Expectations and moments, page 22 of 60

23 Proof of Markov's Inequality E (g (X)) = Z Z Z = a fx:g(x)<ag fx:g(x)ag fx:g(x)ag Z fx:g(x)ag g (x) f (x) dx + g (x) f (x) dx a f (x) dx f (x) dx = ap (g (x) a), P (g (X) a) Z E (g (X)) a fx:g(x)ag g (x) f (x) dx Expectations and moments, page 23 of 60

24 Proof of Chebyshev's Inequality? Recall Markov's Inequality: P (g (X) a) E (g (X)) a? Let g (x) = (x µ) 2 and a = k 2 σ 2. Then, by Markov's inequality, (X P (X µ) 2 k 2 σ 2 E µ) 2 k 2 σ 2, P (jx µj kσ) σ2 k 2 σ 2 = k 2 Expectations and moments, page 24 of 60

25 Moments of a random variable? Note that we can re-write Chebychev's inequality: P (jx µj kσ) k 2, P (jx µj kσ) P (jx µj < kσ)? Now, let k = σ c. c : Some small constant.? As σ 2! 0 P (jx µj < c) k 2, k 2 σ 2 c 2 P (jx µj < c) P (jx µj < c) = P (µ c < X < µ + c) = Expectations and moments, page 25 of 60

26 Moments of a random variable? Intuition?? Example: µ = 0, c = 0. Then σ = 5 ) P ( 0 < x < 0) σ = 2 ) P ( 0 < x < 0) σ = ) P ( 0 < x < 0) σ 2 c 2 = 0.75 σ 2 c 2 = 0.96 σ 2 c 2 = 0.99 Expectations and moments, page 26 of 60

The random variable 1

The random variable 1 The random variable 1 Contents 1. Definition 2. Distribution and density function 3. Specific random variables 4. Functions of one random variable 5. Mean and variance 2 The random variable A random variable

More information

Week 2. Review of Probability, Random Variables and Univariate Distributions

Week 2. Review of Probability, Random Variables and Univariate Distributions Week 2 Review of Probability, Random Variables and Univariate Distributions Probability Probability Probability Motivation What use is Probability Theory? Probability models Basis for statistical inference

More information

Probability inequalities 11

Probability inequalities 11 Paninski, Intro. Math. Stats., October 5, 2005 29 Probability inequalities 11 There is an adage in probability that says that behind every limit theorem lies a probability inequality (i.e., a bound on

More information

SUMMARY OF PROBABILITY CONCEPTS SO FAR (SUPPLEMENT FOR MA416)

SUMMARY OF PROBABILITY CONCEPTS SO FAR (SUPPLEMENT FOR MA416) SUMMARY OF PROBABILITY CONCEPTS SO FAR (SUPPLEMENT FOR MA416) D. ARAPURA This is a summary of the essential material covered so far. The final will be cumulative. I ve also included some review problems

More information

Multiple Random Variables

Multiple Random Variables Multiple Random Variables This Version: July 30, 2015 Multiple Random Variables 2 Now we consider models with more than one r.v. These are called multivariate models For instance: height and weight An

More information

IAM 530 ELEMENTS OF PROBABILITY AND STATISTICS LECTURE 3-RANDOM VARIABLES

IAM 530 ELEMENTS OF PROBABILITY AND STATISTICS LECTURE 3-RANDOM VARIABLES IAM 530 ELEMENTS OF PROBABILITY AND STATISTICS LECTURE 3-RANDOM VARIABLES VARIABLE Studying the behavior of random variables, and more importantly functions of random variables is essential for both the

More information

Quick Tour of Basic Probability Theory and Linear Algebra

Quick Tour of Basic Probability Theory and Linear Algebra Quick Tour of and Linear Algebra Quick Tour of and Linear Algebra CS224w: Social and Information Network Analysis Fall 2011 Quick Tour of and Linear Algebra Quick Tour of and Linear Algebra Outline Definitions

More information

Chapter 7: SAMPLING DISTRIBUTIONS & POINT ESTIMATION OF PARAMETERS. Part 2: Differences in sample means

Chapter 7: SAMPLING DISTRIBUTIONS & POINT ESTIMATION OF PARAMETERS. Part 2: Differences in sample means Chapter 7: SAMPLING DISTRIBUTIONS & POINT ESTIMATION OF PARAMETERS Part 2: Differences in sample means What if we re interested in estimating the difference in means between two populations? Value of interest:

More information

Lecture 5 - Information theory

Lecture 5 - Information theory Lecture 5 - Information theory Jan Bouda FI MU May 18, 2012 Jan Bouda (FI MU) Lecture 5 - Information theory May 18, 2012 1 / 42 Part I Uncertainty and entropy Jan Bouda (FI MU) Lecture 5 - Information

More information

Joint Distribution of Two or More Random Variables

Joint Distribution of Two or More Random Variables Joint Distribution of Two or More Random Variables Sometimes more than one measurement in the form of random variable is taken on each member of the sample space. In cases like this there will be a few

More information

Lecture On Probability Distributions

Lecture On Probability Distributions Lecture On Probability Distributions 1 Random Variables & Probability Distributions Earlier we defined a random variable as a way of associating each outcome in a sample space with a real number. In our

More information

Mathematical Statistics 1 Math A 6330

Mathematical Statistics 1 Math A 6330 Mathematical Statistics 1 Math A 6330 Chapter 3 Common Families of Distributions Mohamed I. Riffi Department of Mathematics Islamic University of Gaza September 28, 2015 Outline 1 Subjects of Lecture 04

More information

5 Operations on Multiple Random Variables

5 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 information

Expectation. DS GA 1002 Statistical and Mathematical Models. Carlos Fernandez-Granda

Expectation. DS GA 1002 Statistical and Mathematical Models.   Carlos Fernandez-Granda Expectation DS GA 1002 Statistical and Mathematical Models http://www.cims.nyu.edu/~cfgranda/pages/dsga1002_fall16 Carlos Fernandez-Granda Aim Describe random variables with a few numbers: mean, variance,

More information

Part 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 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 information

Lecture 11. Probability Theory: an Overveiw

Lecture 11. Probability Theory: an Overveiw Math 408 - Mathematical Statistics Lecture 11. Probability Theory: an Overveiw February 11, 2013 Konstantin Zuev (USC) Math 408, Lecture 11 February 11, 2013 1 / 24 The starting point in developing the

More information

Week 12-13: Discrete Probability

Week 12-13: Discrete Probability Week 12-13: Discrete Probability November 21, 2018 1 Probability Space There are many problems about chances or possibilities, called probability in mathematics. When we roll two dice there are possible

More information

Expectation. DS GA 1002 Probability and Statistics for Data Science. Carlos Fernandez-Granda

Expectation. DS GA 1002 Probability and Statistics for Data Science.   Carlos Fernandez-Granda Expectation DS GA 1002 Probability and Statistics for Data Science http://www.cims.nyu.edu/~cfgranda/pages/dsga1002_fall17 Carlos Fernandez-Granda Aim Describe random variables with a few numbers: mean,

More information

Discrete Probability Refresher

Discrete Probability Refresher ECE 1502 Information Theory Discrete Probability Refresher F. R. Kschischang Dept. of Electrical and Computer Engineering University of Toronto January 13, 1999 revised January 11, 2006 Probability theory

More information

Random Variables. Cumulative Distribution Function (CDF) Amappingthattransformstheeventstotherealline.

Random 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 information

Random Variables. Random variables. A numerically valued map X of an outcome ω from a sample space Ω to the real line R

Random 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 information

Arkansas Tech University MATH 3513: Applied Statistics I Dr. Marcel B. Finan

Arkansas Tech University MATH 3513: Applied Statistics I Dr. Marcel B. Finan 2.4 Random Variables Arkansas Tech University MATH 3513: Applied Statistics I Dr. Marcel B. Finan By definition, a random variable X is a function with domain the sample space and range a subset of the

More information

f ', the first derivative of a differentiable function, f. Use the

f ', the first derivative of a differentiable function, f. Use the f, f ', and The graph given to the right is the graph of graph to answer the questions below. f '' Relationships and The Extreme Value Theorem 1. On the interval [0, 8], are there any values where f(x)

More information

Formulas for probability theory and linear models SF2941

Formulas 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 information

3. Review of Probability and Statistics

3. Review of Probability and Statistics 3. Review of Probability and Statistics ECE 830, Spring 2014 Probabilistic models will be used throughout the course to represent noise, errors, and uncertainty in signal processing problems. This lecture

More information

Integration - Past Edexcel Exam Questions

Integration - Past Edexcel Exam Questions Integration - Past Edexcel Exam Questions 1. (a) Given that y = 5x 2 + 7x + 3, find i. - ii. - (b) ( 1 + 3 ) x 1 x dx. [4] 2. Question 2b - January 2005 2. The gradient of the curve C is given by The point

More information

CS145: Probability & Computing

CS145: 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 information

Probability Review. Yutian Li. January 18, Stanford University. Yutian Li (Stanford University) Probability Review January 18, / 27

Probability Review. Yutian Li. January 18, Stanford University. Yutian Li (Stanford University) Probability Review January 18, / 27 Probability Review Yutian Li Stanford University January 18, 2018 Yutian Li (Stanford University) Probability Review January 18, 2018 1 / 27 Outline 1 Elements of probability 2 Random variables 3 Multiple

More information

Analysis of Engineering and Scientific Data. Semester

Analysis of Engineering and Scientific Data. Semester Analysis of Engineering and Scientific Data Semester 1 2019 Sabrina Streipert s.streipert@uq.edu.au Example: Draw a random number from the interval of real numbers [1, 3]. Let X represent the number. Each

More information

It can be shown that if X 1 ;X 2 ;:::;X n are independent r.v. s with

It can be shown that if X 1 ;X 2 ;:::;X n are independent r.v. s with Example: Alternative calculation of mean and variance of binomial distribution A r.v. X has the Bernoulli distribution if it takes the values 1 ( success ) or 0 ( failure ) with probabilities p and (1

More information

Regression and Statistical Inference

Regression 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

EE514A Information Theory I Fall 2013

EE514A 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 information

March 1, Florida State University. Concentration Inequalities: Martingale. Approach and Entropy Method. Lizhe Sun and Boning Yang.

March 1, Florida State University. Concentration Inequalities: Martingale. Approach and Entropy Method. Lizhe Sun and Boning Yang. Florida State University March 1, 2018 Framework 1. (Lizhe) Basic inequalities Chernoff bounding Review for STA 6448 2. (Lizhe) Discrete-time martingales inequalities via martingale approach 3. (Boning)

More information

Functions of Random Variables Notes of STAT 6205 by Dr. Fan

Functions of Random Variables Notes of STAT 6205 by Dr. Fan Functions of Random Variables Notes of STAT 605 by Dr. Fan Overview Chapter 5 Functions of One random variable o o General: distribution function approach Change-of-variable approach Functions of Two random

More information

Chapter 2: Entropy and Mutual Information. University of Illinois at Chicago ECE 534, Natasha Devroye

Chapter 2: Entropy and Mutual Information. University of Illinois at Chicago ECE 534, Natasha Devroye Chapter 2: Entropy and Mutual Information Chapter 2 outline Definitions Entropy Joint entropy, conditional entropy Relative entropy, mutual information Chain rules Jensen s inequality Log-sum inequality

More information

Discrete Random Variables

Discrete Random Variables CPSC 53 Systems Modeling and Simulation Discrete Random Variables Dr. Anirban Mahanti Department of Computer Science University of Calgary mahanti@cpsc.ucalgary.ca Random Variables A random variable is

More information

Lecture 1 Measure concentration

Lecture 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 information

2. Variance and Higher Moments

2. Variance and Higher Moments 1 of 16 7/16/2009 5:45 AM Virtual Laboratories > 4. Expected Value > 1 2 3 4 5 6 2. Variance and Higher Moments Recall that by taking the expected value of various transformations of a random variable,

More information

COMPSCI 240: Reasoning Under Uncertainty

COMPSCI 240: Reasoning Under Uncertainty COMPSCI 240: Reasoning Under Uncertainty Andrew Lan and Nic Herndon University of Massachusetts at Amherst Spring 2019 Lecture 20: Central limit theorem & The strong law of large numbers Markov and Chebyshev

More information

MATH2715: Statistical Methods

MATH2715: Statistical Methods MATH2715: Statistical Methods Exercises V (based on lectures 9-10, work week 6, hand in lecture Mon 7 Nov) ALL questions count towards the continuous assessment for this module. Q1. If X gamma(α,λ), write

More information

Corollary 1.1 (Chebyshev's Inequality). Let Y be a random variable with finite mean μ and variance ff 2. Then for all ffi>0 P [ jy μj ffiff]» 1 ffi 2

Corollary 1.1 (Chebyshev's Inequality). Let Y be a random variable with finite mean μ and variance ff 2. Then for all ffi>0 P [ jy μj ffiff]» 1 ffi 2 Econ 240A: Some Useful Inequalities: Theory, Examples and Exercises Λ. Chuan Goh 8 February 2001 Lawrence Klein: If the Devil promised you a theorem in return for your immortal soul, would you accept the

More information

MATH/STAT 3360, Probability

MATH/STAT 3360, Probability MATH/STAT 3360, Probability Sample Final Examination This Sample examination has more questions than the actual final, in order to cover a wider range of questions. Estimated times are provided after each

More information

2. Suppose (X, Y ) is a pair of random variables uniformly distributed over the triangle with vertices (0, 0), (2, 0), (2, 1).

2. Suppose (X, Y ) is a pair of random variables uniformly distributed over the triangle with vertices (0, 0), (2, 0), (2, 1). Name M362K Final Exam Instructions: Show all of your work. You do not have to simplify your answers. No calculators allowed. There is a table of formulae on the last page. 1. Suppose X 1,..., X 1 are independent

More information

2 (Statistics) Random variables

2 (Statistics) Random variables 2 (Statistics) Random variables References: DeGroot and Schervish, chapters 3, 4 and 5; Stirzaker, chapters 4, 5 and 6 We will now study the main tools use for modeling experiments with unknown outcomes

More information

Linear Regression and Its Applications

Linear Regression and Its Applications Linear Regression and Its Applications Predrag Radivojac October 13, 2014 Given a data set D = {(x i, y i )} n the objective is to learn the relationship between features and the target. We usually start

More information

Lecture 2. Derivative. 1 / 26

Lecture 2. Derivative. 1 / 26 Lecture 2. Derivative. 1 / 26 Basic Concepts Suppose we wish to nd the rate at which a given function f (x) is changing with respect to x when x = c. The simplest idea is to nd the average rate of change

More information

z = f (x; y) f (x ; y ) f (x; y) f (x; y )

z = f (x; y) f (x ; y ) f (x; y) f (x; y ) BEEM0 Optimization Techiniques for Economists Lecture Week 4 Dieter Balkenborg Departments of Economics University of Exeter Since the fabric of the universe is most perfect, and is the work of a most

More information

Lecture 2: Review of Basic Probability Theory

Lecture 2: Review of Basic Probability Theory ECE 830 Fall 2010 Statistical Signal Processing instructor: R. Nowak, scribe: R. Nowak Lecture 2: Review of Basic Probability Theory Probabilistic models will be used throughout the course to represent

More information

Solution: First we need to find the mean of this distribution. The mean is. ) = e[( e 1 e 1 ) 0] = 2.

Solution: First we need to find the mean of this distribution. The mean is. ) = e[( e 1 e 1 ) 0] = 2. Math 0A with Professor Stankova Worksheet, Discussion #; Monday, //207 GSI name: Roy Zhao Standard Deviation Example. Let f(x) = e e x for x and 0 otherwise. Find the standard deviation of this distribution.

More information

Twelfth Problem Assignment

Twelfth Problem Assignment EECS 401 Not Graded PROBLEM 1 Let X 1, X 2,... be a sequence of independent random variables that are uniformly distributed between 0 and 1. Consider a sequence defined by (a) Y n = max(x 1, X 2,..., X

More information

Statistics for Economists. Lectures 3 & 4

Statistics for Economists. Lectures 3 & 4 Statistics for Economists Lectures 3 & 4 Asrat Temesgen Stockholm University 1 CHAPTER 2- Discrete Distributions 2.1. Random variables of the Discrete Type Definition 2.1.1: Given a random experiment with

More information

If g is also continuous and strictly increasing on J, we may apply the strictly increasing inverse function g 1 to this inequality to get

If 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 information

A Brief Analysis of Central Limit Theorem. SIAM Chapter Florida State University

A Brief Analysis of Central Limit Theorem. SIAM Chapter Florida State University 1 / 36 A Brief Analysis of Central Limit Theorem Omid Khanmohamadi (okhanmoh@math.fsu.edu) Diego Hernán Díaz Martínez (ddiazmar@math.fsu.edu) Tony Wills (twills@math.fsu.edu) Kouadio David Yao (kyao@math.fsu.edu)

More information

1 Functions and Graphs

1 Functions and Graphs 1 Functions and Graphs 1.1 Functions Cartesian Coordinate System A Cartesian or rectangular coordinate system is formed by the intersection of a horizontal real number line, usually called the x axis,

More information

Minimum and maximum values *

Minimum and maximum values * OpenStax-CNX module: m17417 1 Minimum and maximum values * Sunil Kumar Singh This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution License 2.0 In general context, a

More information

Part 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 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 information

MATH/STAT 3360, Probability Sample Final Examination Model Solutions

MATH/STAT 3360, Probability Sample Final Examination Model Solutions MATH/STAT 3360, Probability Sample Final Examination Model Solutions This Sample examination has more questions than the actual final, in order to cover a wider range of questions. Estimated times are

More information

An FKG equality with applications to random environments

An FKG equality with applications to random environments Statistics & Probability Letters 46 (2000) 203 209 An FKG equality with applications to random environments Wei-Shih Yang a, David Klein b; a Department of Mathematics, Temple University, Philadelphia,

More information

04. Random Variables: Concepts

04. Random Variables: Concepts University of Rhode Island DigitalCommons@URI Nonequilibrium Statistical Physics Physics Course Materials 215 4. Random Variables: Concepts Gerhard Müller University of Rhode Island, gmuller@uri.edu Creative

More information

P (x). all other X j =x j. If X is a continuous random vector (see p.172), then the marginal distributions of X i are: f(x)dx 1 dx n

P (x). all other X j =x j. If X is a continuous random vector (see p.172), then the marginal distributions of X i are: f(x)dx 1 dx n JOINT DENSITIES - RANDOM VECTORS - REVIEW Joint densities describe probability distributions of a random vector X: an n-dimensional vector of random variables, ie, X = (X 1,, X n ), where all X is are

More information

Statistics 100A Homework 5 Solutions

Statistics 100A Homework 5 Solutions Chapter 5 Statistics 1A Homework 5 Solutions Ryan Rosario 1. Let X be a random variable with probability density function a What is the value of c? fx { c1 x 1 < x < 1 otherwise We know that for fx to

More information

Distributions of Functions of Random Variables. 5.1 Functions of One Random Variable

Distributions of Functions of Random Variables. 5.1 Functions of One Random Variable Distributions of Functions of Random Variables 5.1 Functions of One Random Variable 5.2 Transformations of Two Random Variables 5.3 Several Random Variables 5.4 The Moment-Generating Function Technique

More information

556: MATHEMATICAL STATISTICS I

556: MATHEMATICAL STATISTICS I 556: MATHEMATICAL STATISTICS I INEQUALITIES 5.1 Concenraion and Tail Probabiliy Inequaliies Lemma (CHEBYCHEV S LEMMA) c > 0, If X is a random variable, hen for non-negaive funcion h, and P X [h(x) c] E

More information

Theorem 2.1 (Caratheodory). A (countably additive) probability measure on a field has an extension. n=1

Theorem 2.1 (Caratheodory). A (countably additive) probability measure on a field has an extension. n=1 Chapter 2 Probability measures 1. Existence Theorem 2.1 (Caratheodory). A (countably additive) probability measure on a field has an extension to the generated σ-field Proof of Theorem 2.1. Let F 0 be

More information

Brief Review of Probability

Brief Review of Probability Brief Review of Probability Nuno Vasconcelos (Ken Kreutz-Delgado) ECE Department, UCSD Probability Probability theory is a mathematical language to deal with processes or experiments that are non-deterministic

More information

1.2. Indices. Introduction. Prerequisites. Learning Outcomes

1.2. Indices. Introduction. Prerequisites. Learning Outcomes Indices.2 Introduction Indices, or powers, provide a convenient notation when we need to multiply a number by itself several times. In this section we explain how indices are written, and state the rules

More information

Markov processes Course note 2. Martingale problems, recurrence properties of discrete time chains.

Markov processes Course note 2. Martingale problems, recurrence properties of discrete time chains. Institute for Applied Mathematics WS17/18 Massimiliano Gubinelli Markov processes Course note 2. Martingale problems, recurrence properties of discrete time chains. [version 1, 2017.11.1] We introduce

More information

Gaussian Mixture Models

Gaussian Mixture Models Gaussian Mixture Models David Rosenberg, Brett Bernstein New York University April 26, 2017 David Rosenberg, Brett Bernstein (New York University) DS-GA 1003 April 26, 2017 1 / 42 Intro Question Intro

More information

1/37. Convexity theory. Victor Kitov

1/37. Convexity theory. Victor Kitov 1/37 Convexity theory Victor Kitov 2/37 Table of Contents 1 2 Strictly convex functions 3 Concave & strictly concave functions 4 Kullback-Leibler divergence 3/37 Convex sets Denition 1 Set X is convex

More information

Supplementary Trig Material

Supplementary Trig Material Supplementary Trig Material Math U See Table of Contents Lesson A: Solving Equations with Radicals and Absolute Value Lesson Practice Worksheet A - 1 Lesson Practice Worksheet A - 2 Lesson B: Solving Inequalities

More information

Business Statistics PROBABILITY DISTRIBUTIONS

Business Statistics PROBABILITY DISTRIBUTIONS Business Statistics PROBABILITY DISTRIBUTIONS CONTENTS Probability distribution functions (discrete) Characteristics of a discrete distribution Example: uniform (discrete) distribution Example: Bernoulli

More information

Measure-theoretic probability

Measure-theoretic probability Measure-theoretic probability Koltay L. VEGTMAM144B November 28, 2012 (VEGTMAM144B) Measure-theoretic probability November 28, 2012 1 / 27 The probability space De nition The (Ω, A, P) measure space is

More information

Economics 620, Lecture 9: Asymptotics III: Maximum Likelihood Estimation

Economics 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 information

CLASSICAL PROBABILITY MODES OF CONVERGENCE AND INEQUALITIES

CLASSICAL PROBABILITY MODES OF CONVERGENCE AND INEQUALITIES CLASSICAL PROBABILITY 2008 2. MODES OF CONVERGENCE AND INEQUALITIES JOHN MORIARTY In many interesting and important situations, the object of interest is influenced by many random factors. If we can construct

More information

Multivariate distributions

Multivariate distributions CHAPTER Multivariate distributions.. Introduction We want to discuss collections of random variables (X, X,..., X n ), which are known as random vectors. In the discrete case, we can define the density

More information

Mathematical Foundations -1- Convexity and quasi-convexity. Convex set Convex function Concave function Quasi-concave function Supporting hyperplane

Mathematical Foundations -1- Convexity and quasi-convexity. Convex set Convex function Concave function Quasi-concave function Supporting hyperplane Mathematical Foundations -1- Convexity and quasi-convexity Convex set Convex function Concave function Quasi-concave function Supporting hyperplane Mathematical Foundations -2- Convexity and quasi-convexity

More information

SOLUTIONS FOR PROBLEMS 1-30

SOLUTIONS FOR PROBLEMS 1-30 . Answer: 5 Evaluate x x + 9 for x SOLUTIONS FOR PROBLEMS - 0 When substituting x in x be sure to do the exponent before the multiplication by to get (). + 9 5 + When multiplying ( ) so that ( 7) ( ).

More information

Lecture 13 (Part 2): Deviation from mean: Markov s inequality, variance and its properties, Chebyshev s inequality

Lecture 13 (Part 2): Deviation from mean: Markov s inequality, variance and its properties, Chebyshev s inequality Lecture 13 (Part 2): Deviation from mean: Markov s inequality, variance and its properties, Chebyshev s inequality Discrete Structures II (Summer 2018) Rutgers University Instructor: Abhishek Bhrushundi

More information

Random variables, Expectation, Mean and Variance. Slides are adapted from STAT414 course at PennState

Random variables, Expectation, Mean and Variance. Slides are adapted from STAT414 course at PennState Random variables, Expectation, Mean and Variance Slides are adapted from STAT414 course at PennState https://onlinecourses.science.psu.edu/stat414/ Random variable Definition. Given a random experiment

More information

Math Bootcamp 2012 Miscellaneous

Math 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 information

Question Points Score Total: 76

Question Points Score Total: 76 Math 447 Test 2 March 17, Spring 216 No books, no notes, only SOA-approved calculators. true/false or fill-in-the-blank question. You must show work, unless the question is a Name: Question Points Score

More information

3 Operations on One R.V. - Expectation

3 Operations on One R.V. - Expectation 0402344 Engineering Dept.-JUST. EE360 Signal Analysis-Electrical - Electrical Engineering Department. EE360-Random Signal Analysis-Electrical Engineering Dept.-JUST. EE360-Random Signal Analysis-Electrical

More information

Lecture 4: September Reminder: convergence of sequences

Lecture 4: September Reminder: convergence of sequences 36-705: Intermediate Statistics Fall 2017 Lecturer: Siva Balakrishnan Lecture 4: September 6 In this lecture we discuss the convergence of random variables. At a high-level, our first few lectures focused

More information

Continuous distributions

Continuous 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 information

Introduction to Probability and Stocastic Processes - Part I

Introduction to Probability and Stocastic Processes - Part I Introduction to Probability and Stocastic Processes - Part I Lecture 2 Henrik Vie Christensen vie@control.auc.dk Department of Control Engineering Institute of Electronic Systems Aalborg University Denmark

More information

Solutions to Homework 2

Solutions 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 information

Review of probability. Nuno Vasconcelos UCSD

Review of probability. Nuno Vasconcelos UCSD Review of probability Nuno Vasconcelos UCSD robability probability is the language to deal with processes that are non-deterministic examples: if I flip a coin 00 times how many can I expect to see heads?

More information

Random Variables and Their Distributions

Random 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 information

Stochastic Processes. M. Sami Fadali Professor of Electrical Engineering University of Nevada, Reno

Stochastic Processes. M. Sami Fadali Professor of Electrical Engineering University of Nevada, Reno Stochastic Processes M. Sami Fadali Professor of Electrical Engineering University of Nevada, Reno 1 Outline Stochastic (random) processes. Autocorrelation. Crosscorrelation. Spectral density function.

More information

Measures of Dispersion

Measures of Dispersion Measures of Dispersion MATH 130, Elements of Statistics I J. Robert Buchanan Department of Mathematics Fall 2017 Introduction Recall that a measure of central tendency is a number which is typical of all

More information

Appendix B: Inequalities Involving Random Variables and Their Expectations

Appendix B: Inequalities Involving Random Variables and Their Expectations Chapter Fourteen Appendix B: Inequalities Involving Random Variables and Their Expectations In this appendix we present specific properties of the expectation (additional to just the integral of measurable

More information

Notes for Math 324, Part 19

Notes for Math 324, Part 19 48 Notes for Math 324, Part 9 Chapter 9 Multivariate distributions, covariance Often, we need to consider several random variables at the same time. We have a sample space S and r.v. s X, Y,..., which

More information

Chapter 2. Discrete Distributions

Chapter 2. Discrete Distributions Chapter. Discrete Distributions Objectives ˆ Basic Concepts & Epectations ˆ Binomial, Poisson, Geometric, Negative Binomial, and Hypergeometric Distributions ˆ Introduction to the Maimum Likelihood Estimation

More information

[A + 1 ] + (1 ) v: : (b) Show: the derivative of T at v = v 0 < 0 is: = (v 0 ) (1 ) ; [A + 1 ]

[A + 1 ] + (1 ) v: : (b) Show: the derivative of T at v = v 0 < 0 is: = (v 0 ) (1 ) ; [A + 1 ] Homework #2 Economics 4- Due Wednesday, October 5 Christiano. This question is designed to illustrate Blackwell's Theorem, Theorem 3.3 on page 54 of S-L. That theorem represents a set of conditions that

More information

Lecture 8. October 22, Department of Biostatistics Johns Hopkins Bloomberg School of Public Health Johns Hopkins University.

Lecture 8. October 22, Department of Biostatistics Johns Hopkins Bloomberg School of Public Health Johns Hopkins University. Lecture 8 Department of Biostatistics Johns Hopkins Bloomberg School of Public Health Johns Hopkins University October 22, 2007 1 2 3 4 5 6 1 Define convergent series 2 Define the Law of Large Numbers

More information

Why study probability? Set theory. ECE 6010 Lecture 1 Introduction; Review of Random Variables

Why study probability? Set theory. ECE 6010 Lecture 1 Introduction; Review of Random Variables ECE 6010 Lecture 1 Introduction; Review of Random Variables Readings from G&S: Chapter 1. Section 2.1, Section 2.3, Section 2.4, Section 3.1, Section 3.2, Section 3.5, Section 4.1, Section 4.2, Section

More information

Recitation 1. Gradients and Directional Derivatives. Brett Bernstein. CDS at NYU. January 21, 2018

Recitation 1. Gradients and Directional Derivatives. Brett Bernstein. CDS at NYU. January 21, 2018 Gradients and Directional Derivatives Brett Bernstein CDS at NYU January 21, 2018 Brett Bernstein (CDS at NYU) Recitation 1 January 21, 2018 1 / 23 Initial Question Intro Question Question We are given

More information

Entropy and Ergodic Theory Lecture 4: Conditional entropy and mutual information

Entropy and Ergodic Theory Lecture 4: Conditional entropy and mutual information Entropy and Ergodic Theory Lecture 4: Conditional entropy and mutual information 1 Conditional entropy Let (Ω, F, P) be a probability space, let X be a RV taking values in some finite set A. In this lecture

More information

Generating Functions (Revised Edition)

Generating Functions (Revised Edition) Math 700 Fall 06 Notes Generating Functions (Revised Edition What is a generating function? An ordinary generating function for a sequence (a n n 0 is the power series A(x = a nx n. The exponential generating

More information

MULTIVARIATE PROBABILITY DISTRIBUTIONS

MULTIVARIATE PROBABILITY DISTRIBUTIONS MULTIVARIATE PROBABILITY DISTRIBUTIONS. PRELIMINARIES.. Example. Consider an experiment that consists of tossing a die and a coin at the same time. We can consider a number of random variables defined

More information