An random variable is a quantity that assumes different values with certain probabilities.

Similar documents
Random variables. A random variable X is a function that assigns a real number, X(ζ), to each outcome ζ in the sample space of a random experiment.

MODULE 3 FUNCTION OF A RANDOM VARIABLE AND ITS DISTRIBUTION LECTURES PROBABILITY DISTRIBUTION OF A FUNCTION OF A RANDOM VARIABLE

Cash Flow Valuation Mode Lin Discrete Time

23.2. Representing Periodic Functions by Fourier Series. Introduction. Prerequisites. Learning Outcomes

556: MATHEMATICAL STATISTICS I

Basic notions of probability theory (Part 2)

Math 10B: Mock Mid II. April 13, 2016

Introduction to Probability and Statistics Slides 4 Chapter 4

Answers to QUIZ

Discrete Markov Processes. 1. Introduction

Vehicle Arrival Models : Headway

Notes for Lecture 17-18

Stochastic models and their distributions

Guest Lectures for Dr. MacFarlane s EE3350 Part Deux

SMT 2014 Calculus Test Solutions February 15, 2014 = 3 5 = 15.

Christos Papadimitriou & Luca Trevisan November 22, 2016

Avd. Matematisk statistik

Hamilton- J acobi Equation: Explicit Formulas In this lecture we try to apply the method of characteristics to the Hamilton-Jacobi equation: u t

EXERCISES FOR SECTION 1.5

2.7. Some common engineering functions. Introduction. Prerequisites. Learning Outcomes

Comparing Means: t-tests for One Sample & Two Related Samples

EE 315 Notes. Gürdal Arslan CLASS 1. (Sections ) What is a signal?

CS Homework Week 2 ( 2.25, 3.22, 4.9)

Linear Response Theory: The connection between QFT and experiments

Inventory Analysis and Management. Multi-Period Stochastic Models: Optimality of (s, S) Policy for K-Convex Objective Functions

Predator - Prey Model Trajectories and the nonlinear conservation law

MATH Solutions to Probability Exercises

MATH 4330/5330, Fourier Analysis Section 6, Proof of Fourier s Theorem for Pointwise Convergence

Right tail. Survival function

Transform Techniques. Moment Generating Function

1 1 + x 2 dx. tan 1 (2) = ] ] x 3. Solution: Recall that the given integral is improper because. x 3. 1 x 3. dx = lim dx.

Chapter 2. First Order Scalar Equations

1 Review of Zero-Sum Games

Math 2142 Exam 1 Review Problems. x 2 + f (0) 3! for the 3rd Taylor polynomial at x = 0. To calculate the various quantities:

THE WAVE EQUATION. part hand-in for week 9 b. Any dilation v(x, t) = u(λx, λt) of u(x, t) is also a solution (where λ is constant).

T L. t=1. Proof of Lemma 1. Using the marginal cost accounting in Equation(4) and standard arguments. t )+Π RB. t )+K 1(Q RB

MATH 31B: MIDTERM 2 REVIEW. x 2 e x2 2x dx = 1. ue u du 2. x 2 e x2 e x2] + C 2. dx = x ln(x) 2 2. ln x dx = x ln x x + C. 2, or dx = 2u du.

Homework 10 (Stats 620, Winter 2017) Due Tuesday April 18, in class Questions are derived from problems in Stochastic Processes by S. Ross.

5.1 - Logarithms and Their Properties

Exam 3 Review (Sections Covered: , )

20. Applications of the Genetic-Drift Model

23.5. Half-Range Series. Introduction. Prerequisites. Learning Outcomes

arxiv: v1 [math.ca] 15 Nov 2016

Hamilton- J acobi Equation: Weak S olution We continue the study of the Hamilton-Jacobi equation:

Chapter 3 Common Families of Distributions

MA 214 Calculus IV (Spring 2016) Section 2. Homework Assignment 1 Solutions

Random Processes 1/24

Math 527 Lecture 6: Hamilton-Jacobi Equation: Explicit Formulas

Finish reading Chapter 2 of Spivak, rereading earlier sections as necessary. handout and fill in some missing details!

Representation of Stochastic Process by Means of Stochastic Integrals

From Particles to Rigid Bodies

15. Vector Valued Functions

2. Nonlinear Conservation Law Equations

Unit Root Time Series. Univariate random walk

ES.1803 Topic 22 Notes Jeremy Orloff

Solutions from Chapter 9.1 and 9.2

Week #13 - Integration by Parts & Numerical Integration Section 7.2

EECE 301 Signals & Systems Prof. Mark Fowler

Diebold, Chapter 7. Francis X. Diebold, Elements of Forecasting, 4th Edition (Mason, Ohio: Cengage Learning, 2006). Chapter 7. Characterizing Cycles

Solutions to Assignment 1

LECTURE 1: GENERALIZED RAY KNIGHT THEOREM FOR FINITE MARKOV CHAINS

PROBLEMS FOR MATH 162 If a problem is starred, all subproblems are due. If only subproblems are starred, only those are due. SLOPES OF TANGENT LINES

Chapter 4. Location-Scale-Based Parametric Distributions. William Q. Meeker and Luis A. Escobar Iowa State University and Louisiana State University

4.1 - Logarithms and Their Properties

International Journal of Scientific & Engineering Research, Volume 4, Issue 10, October ISSN

13.3 Term structure models

Sections 2.2 & 2.3 Limit of a Function and Limit Laws

Chapter 7: Solving Trig Equations

Ground Rules. PC1221 Fundamentals of Physics I. Kinematics. Position. Lectures 3 and 4 Motion in One Dimension. A/Prof Tay Seng Chuan

The Asymptotic Behavior of Nonoscillatory Solutions of Some Nonlinear Dynamic Equations on Time Scales

Approximation Algorithms for Unique Games via Orthogonal Separators

Linear Time-invariant systems, Convolution, and Cross-correlation

Chapter 14 Wiener Processes and Itô s Lemma. Options, Futures, and Other Derivatives, 9th Edition, Copyright John C. Hull

Properties Of Solutions To A Generalized Liénard Equation With Forcing Term

! ln 2xdx = (x ln 2x - x) 3 1 = (3 ln 6-3) - (ln 2-1)

Simulation-Solving Dynamic Models ABE 5646 Week 2, Spring 2010

Lecture 2-1 Kinematics in One Dimension Displacement, Velocity and Acceleration Everything in the world is moving. Nothing stays still.

2.1: What is physics? Ch02: Motion along a straight line. 2.2: Motion. 2.3: Position, Displacement, Distance

SOLUTIONS TO ECE 3084

Stationary Distribution. Design and Analysis of Algorithms Andrei Bulatov

Two Coupled Oscillators / Normal Modes

Question 1: Question 2: Topology Exercise Sheet 3

7 The Itô/Stratonovich dilemma

Sensors, Signals and Noise

ENGI 9420 Engineering Analysis Assignment 2 Solutions

t is a basis for the solution space to this system, then the matrix having these solutions as columns, t x 1 t, x 2 t,... x n t x 2 t...

Physics for Scientists & Engineers 2

Physics 127b: Statistical Mechanics. Fokker-Planck Equation. Time Evolution

4.8 Improper Integrals

Answers to Exercises in Chapter 7 - Correlation Functions

Empirical Process Theory

Homework sheet Exercises done during the lecture of March 12, 2014

( ) ( ) if t = t. It must satisfy the identity. So, bulkiness of the unit impulse (hyper)function is equal to 1. The defining characteristic is

Hamilton Jacobi equations

Linear Cryptanalysis

Lecture 2 April 04, 2018

CHAPTER 2 Signals And Spectra

INDEX. Transient analysis 1 Initial Conditions 1

u(x) = e x 2 y + 2 ) Integrate and solve for x (1 + x)y + y = cos x Answer: Divide both sides by 1 + x and solve for y. y = x y + cos x

Transcription:

Probabiliy The probabiliy PrA) of an even A is a number in [, ] ha represens how likely A is o occur. The larger he value of PrA), he more likely he even is o occur. PrA) means he even mus occur. PrA) means he even canno occur. PrA) > PrB) means A is more likely o occur han B. Evens A and B are called disjoin muually exclusive) if hey canno boh occur simulaneously, ha is, if PrA and B). Equivalenly, saying A and B are disjoin means PrA or B) PrA) + PrB). Evens A and B are called complemenary if hey are disjoin, bu one of hem mus occur. Equivalenly, PrA) + PrB) PrA or B). An random variable is a quaniy ha assumes differen values wih cerain probabiliies. In oher words, X is a random variable if we can assign values o PrX x), PrX x), PrX < x), PrX x), PrX > x) for every real number x. The evens X x and X x are complimenary: PrX x) PrX x). The evens X x and X > x are complimenary: PrX x) PrX > x). The evens X x and X < x are complimenary: PrX x) PrX < x). Example. If we oss wo fair coins, here are four possible oucomes: HH HT TH TT where H is heads and T is ails. Since he coins are fair and he osses are independen he oucome of one oss doesn affec he oucome of he oher), each of he four oucomes has probabiliy 2 2 4. Le Y be he random variable defined by if he oucome is HH if he oucome is HT Y 2 if he oucome is TH if he oucome is TT

2 Then PrY k) for k,, 2, 4 PrY ) PrY π) PrY > 2) PrY ) 4 PrY 2) PrY or Y or Y 2) PrY ) + PrY ) + PrY 2) 4 PrY 2) PrY > 2) 4 4 The random variable Y is an example of a discree random variable. A random variable is called a discree random variable if i assume only finiely many or counably many values, ha is, if we can lis he values i assumes as x, x 2,...,. Roughly, a coninuous random variable is one ha can assume a coninuum of values. We will give a precise definiion below afer saing some erminology, bu here are some hings ha can be modelled by a coninuous random variables: he amoun of rainfall in vancouver nex week he lifespan of a lighbulb he heigh of a randomly seleced person in Canada The cumulaive disribuion funcion CDF) of a random variable X is he funcion F x) PrX x). A funcion F is a CDF of some random variable if and only if he following properies hold. ) F is righ-coninuous: lim x c + F x) F c) for all real numbers c. 2) F is non-decreasing: F x) F y) when x y for all real numbers x, y. ) lim F x). x 4) lim F x). x Properies 2), ), and 4) imply F x) for all real numbers x. Example. Le a > be a consan. Show ha F x) funcion. is a cumulaive disribuion + e ax ) Since + e ax is coninuous and never, F x) is coninuous and, herefore, righ-coninuous everywhere. 2) Since d dx F x) d dx + e ax ) + e ax ) 2 ae ax ) for all x, F is non-decreasing. ) lim F x) lim x x + e ax + e ax + e ax ) 2,

4) lim x F x) Therefore F x) lim x + e ax is a CDF. + e ax Exra Example. The funcion F x) k arcanx) + 2 is a cumulaive disribuion funcion. Find he value of k. We mus have lim F x). So x Solving for k yields k π. lim F x) lim x x k arcanx) + ) k π 2 2 + 2 A random variable is called a coninuous random variable if is CDF is coninuous. If X is a coninuous random variable, hen PrX x), PrX x) PrX < x), PrX x) PrX > x), Pra X b) Pra < X b) Pra X < b) Pra < X < b). for all real numbers x, a, b. We will prove PrX x) below; all he oher formulas follow easily from i. For a coninuous random variable X whose cumulaive disribuion funcion F is differeniable, he probabiliy densiy funcion PDF) of X is defined o be and, moreover, for all real numbers x, a, b wih a b. fx) d dx F x), PrX x) F x) Pra X b) F b) F a) f) d b a fx) dx A funcion f is a PDF of some random variable if and only if he following properies hold. ) f is non-negaive: fx) for all real numbers x. 2) Example. Le fx) dx fx) { kx x) 2 if x oherwise be he probabiliy disribuion funcion of a random variable X. a) Find he value of he consan k. b) Find he probabiliy ha 2 X <. c) Find he cumulaive disribuion funcion of X.

4 Par a): We mus have fx) dx. Therefore k k fx) dx kx x) 2 dx x 2x 2 + x ) dx k ) k 2. 2 2 + 4 2 x2 2 x + ) 4 x4 So k 2. Par b): ) Pr 2 X < /2 fx) dx 2 /2 x x) 2 dx 2 x 2x 2 + x ) dx 2 /2 2 x2 2 x + ) 4 x4 [ 2 2 )2 2 ) + ) ) 2 4 )4 2 2 2 2 [ 2 2 8 2 + 64 )] 5 6. /2 ) + 4 ) )] 4 2 Par c). For x <, F x) PrX x) f) d d. For x, F x) PrX x) f) d 2 ) 2 d 2 2 2 + ) d 2 2 2 2 + ) x 4 4 2 2 x2 2 x + ) 4 x4.

5 For x >, F x) PrX x) 2 2 f) d + d + 2 f) d f) d + ) 2 d + 2 2 + ) d ). 2 2 + 4 f) d d 2 2 2 + 4 4 ) Par b) again: Remember ha Pra X b) F b) F a) b a fx) dx, where F is he CDF of X and f is he PDF of X. So if we had done par c) before par b), we could have used ha if x < F x) 2 2 x2 2 x + 4 x4) if x if x > o compue ) ) Pr 2 X < F ) F 2 2 2 )2 2 ) + ) ) 2 4 )4 2 2 ) + ) ) 4 2 2 2 4 2 5 6. Example. Find he probabiliy disribuion funcion fx) for a random variable wih cumulaive disribuion funcion { F x) e 2 x if x if x < For x >, For x <, fx) d dx F x) d e x) 2 dx 2 e 2 x. fx) d dx F x) d dx. F x) is no differeniable a, bu i s okay o have fx) undefined a finiely many poins because his won affec he inergal of f. In conclusion, { fx) 2 e 2 x if x > if x <.

6 Le X be a coninuous random variable wih probabiliy densiy funcion f. The expeced value or expecaion or mean or average) of X is The variance of X is VarX) EX) xfx) dx. x EX)) 2 fx) dx EX 2 ) EX)) 2 The sandard deviaion of X is σx) VarX). Here is a useful fac see below for a proof): EX 2 x 2 fx) dx. The expeced value of a random variable is a measure of he cener of is disribuion. The variance and sandard deviaion of a random variable are measures of he dispersion or horizonal spread) of is disribuion. Example. Find he sandard deviaion of he random variable X wih probabiliy densiy funcion fx) x + ) 4 if x if x < Firs we find he expeced value: EX) xfx) dx xx + ) 4 dx + + xx + ) 4 dx u )u 4 du u x + u u 4 ) du 2 u 2 + ) + u du 2 + ) 2 + ) + ) + + 2 ) 2. 2 + ))

7 Then we compue EX 2 ) x 2 fx) dx x 2 x + ) 4 dx + + x 2 x + ) 4 dx u ) 2 u 4 du u x + u 2 2u + u 4 ) du u + u 2 ) + u du + ) + + ) 2 ) + ) + + ) + )) Therefore and. VarX) EX 2 ) EX)) 2 σx) VarX) 2. ) 2 2 4

8 Proofs of Two Facs Fac. If X is a coninuous random variable, hen PrX c) for all real numbers c. If X has a probabiliy densiy funcion, he proof is easy: PrX c) Prc X c) c c fx) dx. If X is a coninuous random variable wihou a probabiliy densiy funcion, we have o work harder. We will need o recall he definiion of a coninuous random variable and a propery of limis. Recall: X is a coninuous random variable if is CDF, F x) PrX x), is coninuous. Recall: If m gx) for all x < c, hen m lim x c fx). Proof of Fac. Sep. For any x < c, and herefore PrX c) PrX x or x < X c) PrX x) + Prx < X c) Prx < X c) PrX c) PrX x) F c) F x). Sep 2. For any x < c, if X c, hen x < X c. So X c canno be more likely han x < X c. Therefore PrX c) Prx < X c). Sep. PrX c) lim PrX c) x c lim Prx < X c) x c lim F c) F x)) x c F c) lim F x) x c F c) F c).

9 Fac 2. If X is a coninuous random variable wih probabiliy densiy funcion f, hen EX 2 ) x 2 fx) dx. Remark. Fac 2 is a special case of a more general formula called he law of he unconscious saisician, EgX)) gx)fx) dx, which is valid whenever he inegral on he righ converges. Proof of Fac 2. Le F and f be, respecively, he CDF and PDF of X. Le G and g be, respecively, he CDF and PDF of he random variable X 2. If x <, If x, Gx) PrX 2 x). Gx) PrX 2 x) Pr X x) Pr x X x) F x) F x). Now we compue gx). If x <, If x >, gx) d dx Gx) d dx. gx) d dx Gx) d ) F x) F x) dx F x) d dx x) F x) d dx x) F x) 2 x + F x) 2 x 2 ) f x) + f x). x We don need o worry abou gx) a x, since he value of g a one poin won affec he inegral of g. We can now compue Making he subsiuion EX 2 ) 2 2 lim xgx) dx x 2 ) f x) + f x) dx x ) x f x) + f x) dx x f x) + f x) ) dx. u x, u 2 x, 2u du dx x u, x u

gives EX 2 ) lim u 2 fu) + f u)) du ) lim u 2 fu) du + u 2 f u) du. In he second inegral we make he subsiuion v u o ge EX 2 ) lim u 2 fu) du lim lim v 2 fv) dv u 2 fu) du + v 2 fv) dv u 2 fu) du + lim u 2 fu) du + x 2 fx) dx + x 2 fx) dx. v 2 fv) dv x 2 fx) dx ) ) v 2 fv) dv