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.

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

Introduction to Probability and Statistics Slides 4 Chapter 4

Basic notions of probability theory (Part 2)

Mathematics. ( : Focus on free Education) (Chapter 16) (Probability) (Class XI) Exercise 16.2

Discrete Markov Processes. 1. Introduction

Lecture 3: Random variables, distributions, and transformations

Concept of Random Variables

Cash Flow Valuation Mode Lin Discrete Time

MATH 351 Solutions: TEST 3-B 23 April 2018 (revised)

Signals and Systems Linear Time-Invariant (LTI) Systems

5. Stochastic processes (1)

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

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

The Quantum Theory of Atoms and Molecules: The Schrodinger equation. Hilary Term 2008 Dr Grant Ritchie

Vehicle Arrival Models : Headway

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

Roller-Coaster Coordinate System

15. Vector Valued Functions

Transform Techniques. Moment Generating Function

Lecture #6: Continuous-Time Signals

KINEMATICS IN ONE DIMENSION

Chapter 2. Models, Censoring, and Likelihood for Failure-Time Data

Chapter 3: Random Variables 1

Constant Acceleration

Chapter 1 Probability Theory

Stochastic models and their distributions

Conditional Probability

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

Notes for Lecture 17-18

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

On Multicomponent System Reliability with Microshocks - Microdamages Type of Components Interaction

Mixing times and hitting times: lecture notes

in Engineering Prof. Dr. Michael Havbro Faber ETH Zurich, Switzerland Swiss Federal Institute of Technology

Events A and B are said to be independent if the occurrence of A does not affect the probability of B.

Zürich. ETH Master Course: L Autonomous Mobile Robots Localization II

Conditional Probability

CHAPTER 2 Signals And Spectra

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

Non-uniform circular motion *

EXERCISES FOR SECTION 1.5

Probability Distributions for Discrete RV

Lecture 4 Kinetics of a particle Part 3: Impulse and Momentum

SINUSOIDAL WAVEFORMS

SDS 321: Introduction to Probability and Statistics

Let us start with a two dimensional case. We consider a vector ( x,

Motion along a Straight Line

Section 3.5 Nonhomogeneous Equations; Method of Undetermined Coefficients

Chapter 1 Fundamental Concepts

3.1.3 INTRODUCTION TO DYNAMIC OPTIMIZATION: DISCRETE TIME PROBLEMS. A. The Hamiltonian and First-Order Conditions in a Finite Time Horizon

Chapter 7: Solving Trig Equations

Physics for Scientists & Engineers 2

Basic definitions and relations

4. Electric field lines with respect to equipotential surfaces are

CS Homework Week 2 ( 2.25, 3.22, 4.9)

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

2. Nonlinear Conservation Law Equations

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.

Solutions from Chapter 9.1 and 9.2

18 Biological models with discrete time

The Arcsine Distribution

EE 435. Lecture 31. Absolute and Relative Accuracy DAC Design. The String DAC

Appendix to Creating Work Breaks From Available Idleness

3, so θ = arccos

Sensors, Signals and Noise

Chapter 3 Common Families of Distributions

Overview. COMP14112: Artificial Intelligence Fundamentals. Lecture 0 Very Brief Overview. Structure of this course

Solutions to Assignment 1

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

Laplace Transforms. Examples. Is this equation differential? y 2 2y + 1 = 0, y 2 2y + 1 = 0, (y ) 2 2y + 1 = cos x,

Kinematics Vocabulary. Kinematics and One Dimensional Motion. Position. Coordinate System in One Dimension. Kinema means movement 8.

Continuous Time Linear Time Invariant (LTI) Systems. Dr. Ali Hussein Muqaibel. Introduction

EECE 301 Signals & Systems Prof. Mark Fowler

6. Stochastic calculus with jump processes

Asymptotic Equipartition Property - Seminar 3, part 1

Lecture 2 April 04, 2018

Weyl sequences: Asymptotic distributions of the partition lengths

Guest Lectures for Dr. MacFarlane s EE3350 Part Deux

Module 2 F c i k c s la l w a s o s f dif di fusi s o i n

Comparison between the Discrete and Continuous Time Models

TEACHER NOTES MATH NSPIRED

Chapter 2. First Order Scalar Equations

Reliability of Technical Systems

From Particles to Rigid Bodies

MODULE 2 RANDOM VARIABLE AND ITS DISTRIBUTION LECTURES DISTRIBUTION FUNCTION AND ITS PROPERTIES

Expected Value 7/7/2006

Week 1 Lecture 2 Problems 2, 5. What if something oscillates with no obvious spring? What is ω? (problem set problem)

Stochastic Structural Dynamics. Lecture-6

Lecture 1 : The Mathematical Theory of Probability

Notation: X = random variable; x = particular value; P(X = x) denotes probability that X equals the value x.

Two Coupled Oscillators / Normal Modes

Lecture 20: Riccati Equations and Least Squares Feedback Control

An introduction to the theory of SDDP algorithm

Lecture 4 Notes (Little s Theorem)

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

What is Probability? Probability. Sample Spaces and Events. Simple Event

(1) (2) Differentiation of (1) and then substitution of (3) leads to. Therefore, we will simply consider the second-order linear system given by (4)

Chapter 2 Basic Reliability Mathematics

Maintenance Models. Prof. Robert C. Leachman IEOR 130, Methods of Manufacturing Improvement Spring, 2011

d 1 = c 1 b 2 - b 1 c 2 d 2 = c 1 b 3 - b 1 c 3

CHAPTER 12 DIRECT CURRENT CIRCUITS

Transcription:

Random variables Some random eperimens may yield a sample space whose elemens evens are numbers, bu some do no or mahemaical purposes, i is desirable o have numbers associaed wih he oucomes A random variable is a funcion ha assigns a real number, ζ, o each oucome ζ in he sample space of a random eperimen The sample space S is he domain of he random variable and he se S of all values aken on by is he range of he random variable Noe ha S R, R is se of all real numbers

S ζ ζ real number line S Eample A random eperimen of ossing 3 fair coins Sample space S {HHH, HHT, HTH, HTT, THH, THT, TTH, TTT} Le be he number of heads; hen S {,,, 3} eg 3 3 THH ; P[ ], P[ ], P[ ], P[ 3]

Equivalen evens Le A be he se of oucomes ζ in S ha leads o he se of values ζ in B A B eg A B { ζ S : ζ B} in he above coins ossing eample, {, 3} {HHT, HTH, THH, HHH} se of all preimages of elemens in B {, 3}

Since even B in S occurs whenever even A in S occurs, and vice versa Hence P[B] P[A] P[{ζ: ζ in B}] A and B are called equivalen evens wih respec o If we assign probabiliies in his manner, hen he probabiliies assigned o subses of he real line will saisfy he hree aioms of probabiliy P[B] for all B S P[S ] 3 If B and B are muually eclusive, hen P[B B ] P [B ] + P[B ] In he ossing coins eperimen, we observe 7 P[ ], P[ ], P[ ], P[ 3] Hence, P[ ] is a number whose value depends on, and so i is a funcion of

Eample Consider he random eperimen of ossing 3 coins S {HHH, HHT, HTH, HTT, THH, THT, TTH, TTT} no of heads in he 3 coins, S {,,, 3} A {HTT, TTT} A {HHT, HTH, THH, TTT} {HTT, THT, TTH, TTT} A 3 A {, } se of all values aken by ζ, ζ A A {, } {, } se of all preimages of elemens in {, } {HTT, THT, TTH, TTT} A 3

Noe ha A 3 and {, } are equivalen evens since Noe ha A 3 S and {, } S Consider anoher random variable: P[ A3 ] P[ or ] Y number of heads number of ails hen Y can assume he values 3,, and 3 Now, Y {3, } {TTT, HTT, THT, TTH}, so {TTT, HTT, THT, TTH}, and {3, } are equivalen evens

Eample A poin is seleced a random from inside he uni circle cenered a he origin Le Y be he random variable represening he disance of he poin from he origin a S Y {y: y } range of Y y cener seleced poin b The equivalen even in he sample space S for he even {Y y} in S Y is ha he seleced poin falls inside he region cenered a he origin and wih radius y c P[Y y] y probabiliy of selecing a poin inside he uni circle, and whose disance is less han or equal o y πy y π

Le Z be he random variable represening he disance of he seleced poin from, a 3 z : z S Z, z y The equivalen even in S for he even {Z z} is he region formed by he inersecion of he circles: + + z y y b

Cumulaive disribuion funcion cdf The cdf of a random variable is defined as P[ ], < < Aioms of probabiliy following properies of cdf lim sure even 3 lim impossible even 4 is a non-decreasing funcion of This is obvious since for >, we have P[ ] P[ ]

5 is coninuous from he righ ie for h > lim + + + b h b b h Eample The ossing coins eperimen again, where number of heads appearing in ossing 3 coins Take h > and h +, ] [ head} or { ] [ head} { ] [ + + h P h P P P h P h

Hence, he cdf of is coninuous from he righ Define he uni sep funcion: 7 u <, 3 3 3 u + u + u + u 3 The jump a is given by P[ ], and similarly, for he jump a, and 3

6 P[a < b] b a since { a} {a < b} { b}, and { a} and {a < b} are muually eclusive so a + P[a < b] b Suppose we ake a b h, h >, P[b h < b] b b h As h +, P[ b] b b The probabiliy ha akes on he special value b is given by he magniude of he jump of he cdf a b h If he cdf is coninuous a b, hen he even { b} has probabiliy zero essenially h If he cdf is coninuous a a and b, hen P[a < < b], P[a < b], P[a < b], P[a b] have he same value 7 P[ > ]

Eample Le T be he random variable which equals he life of a diode Suppose he cdf of T akes he form, ] [ - T e u e - P T µ µ < hen he probabiliy ha he diode fails beween imes a and b is P[a < T b] P[T b] P[T a] e µa e µb T

Three ypes of random variables Discree random variable The cdf is a righ-coninuous, saircase funcion of wih jumps a a counable se of poins,, P u k where P k P[ k ] gives he magniude of he jump a k in he cdf Coninuous random variable The cdf is coninuous everywhere, so P[ ] for all k k

3 Random variable of mied ype The cdf has jumps on a counable se of poins and also increases coninuously over a leas one inerval of values of p + p, < p < cdf of a discree random variable cdf of a coninuous random variable

Eample Le be he ime insan ha a cusomer in a queue is being served We have: is zero if he sysem is idle and eponenially disribued if he sysem is busy P[ ] P[ idle] P[idle] + P[ busy] P[busy] p probabiliy ha he sysem is idle p idle + p busy p + pu + p e λ p u e < λ p idle is a discree random variable wih P[ idle ] so ha idle u; busy is coninuous wih busy u - e λ

Probabiliy densiy funcion pdf, if eiss, is defined as d d f f + P[ < + ] f since ] [ P + + + <

Properies of pdf f since cdf is a non-decreasing funcion of f d d Proof: rom f, we obain d f d The consan c is deermined by, given c c 3 P [ a < Proof: b] P[ a < b a f d b] b a 4 d f b f d f d a b a f d

Eample Le radius of bull-eye b and radius of arge a Probabiliy of he dar sriking beween r and r + dr is ] [ dr a r C dr r R r P + R disance of hi from he cener of he arge a b The densiy funcion akes he form a r C r f R Assume ha he arge is always hi:, 3 a C dr a r C a probabiliy of hiing bull-eye 3 ] [ 3 a b a b dr r f b R P b R How o deermine C?

pdf for a discree random variable The dela funcion δ is relaed o u via d δ u or u δ d Noe ha δ d d Recall ha P u k k k probabiliy mass funcion According o f d, we hen have when k f P k δ k, where δ k k oherwise u k δ k k k

Eample The coins ossing eperimen cdf: pdf: f 3 3 u + u + u + u 3 3 3 δ + δ + δ + δ 3 P[ < ] + f d P[ ] 3 Noe ha he dela funcion locaed a is ecluded bu he dela funcion locaed a is included Similarly, [ < 3] P f d P[ 3 ] 3

Condiional cdf of given A P[{ } ] A A if P[ A] > P[ A] h cdf of wih reference o he reduced sample space A Condiional pdf of given A f d A A d S { } A

Eample The lifeime of a machine has a coninuous cdf, ind he condiional cdf and pdf given he even A { > }, ha is, he machine is sill working a ime Condiional cdf > P[ > ] P[{ } { P[ > ] > }] i ii > { > } { } { > } { }

Noe ha, } { } { } { > < > φ > > so Condiional pdf is found by differeniaing wih respec o > > > f f Noe ha > is coninuous a, bu f > has a jump a

Eample Tossing of 3 coins; number of heads; A { > } 3 if 3 if if ] [ ] [ if ] [ }] { } [{ < > < > > > P P P P A A 3 Noe ha P[ > ] P[ 3] and 3 if 3 if < P[ < ]