DISCRETE RANDOM VARIABLES: PMF s & CDF s [DEVORE 3.2]

Similar documents
Statistics and Econometrics I

Continuous r.v. s: cdf s, Expected Values

Summary of basic probability theory Math 218, Mathematical Statistics D Joyce, Spring 2016

Review of Probability. CS1538: Introduction to Simulations

Lecture 3. Discrete Random Variables

Random Variables. Statistics 110. Summer Copyright c 2006 by Mark E. Irwin

Lecture 2. October 21, Department of Biostatistics Johns Hopkins Bloomberg School of Public Health Johns Hopkins University.

Deep Learning for Computer Vision

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

E X A M. Probability Theory and Stochastic Processes Date: December 13, 2016 Duration: 4 hours. Number of pages incl.

To find the median, find the 40 th quartile and the 70 th quartile (which are easily found at y=1 and y=2, respectively). Then we interpolate:

Bernoulli Trials, Binomial and Cumulative Distributions

Lecture 2: Repetition of probability theory and statistics

M378K In-Class Assignment #1

Probability Theory for Machine Learning. Chris Cremer September 2015

Probability measures A probability measure, P, is a real valued function from the collection of possible events so that the following

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

Chapter 2 Random Variables

MATH 3670 First Midterm February 17, No books or notes. No cellphone or wireless devices. Write clearly and show your work for every answer.

Probability Review. Chao Lan

Probability Theory Review

Recitation 2: Probability

L2: Review of probability and statistics

Chapter 3 Discrete Random Variables

STAT 430/510 Probability Lecture 7: Random Variable and Expectation

MAS108 Probability I

Topic 5 Basics of Probability

3 Multiple Discrete Random Variables

Lecture 10: Probability distributions TUESDAY, FEBRUARY 19, 2019

Brief Review of Probability

Discrete Random Variables

Math 151. Rumbos Fall Solutions to Review Problems for Exam 2. Pr(X = 1) = ) = Pr(X = 2) = Pr(X = 3) = p X. (k) =

Algorithms for Uncertainty Quantification

EE514A Information Theory I Fall 2013

ELEG 3143 Probability & Stochastic Process Ch. 2 Discrete Random Variables

Statistics 100A Homework 1 Solutions

More on Distribution Function

Probability and Statisitcs

Random Variables. Saravanan Vijayakumaran Department of Electrical Engineering Indian Institute of Technology Bombay

for valid PSD. PART B (Answer all five units, 5 X 10 = 50 Marks) UNIT I

Random variables. DS GA 1002 Probability and Statistics for Data Science.

Basics on Probability. Jingrui He 09/11/2007

Name: Firas Rassoul-Agha

Lecture 3: Random variables, distributions, and transformations

A brief review of basics of probabilities

Fundamental Tools - Probability Theory II

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

Lecture Notes 1 Probability and Random Variables. Conditional Probability and Independence. Functions of a Random Variable

MATH Solutions to Probability Exercises

Random Variables. Will Perkins. January 11, 2013

Probability: Axioms, Properties, Interpretations

Probability Distributions for Discrete RV

Continuous Distributions

1 Random Variable: Topics

18.440: Lecture 19 Normal random variables

EXAM. Exam #1. Math 3342 Summer II, July 21, 2000 ANSWERS

MATH MW Elementary Probability Course Notes Part I: Models and Counting

Topics. Probability Theory. Perfect Secrecy. Information Theory

ECE 302: Probabilistic Methods in Electrical Engineering

Random variable X is a mapping that maps each outcome s in the sample space to a unique real number x, < x <. ( ) X s. Real Line

Lecture 1. ABC of Probability

ECE353: Probability and Random Processes. Lecture 5 - Cumulative Distribution Function and Expectation

Relationship between probability set function and random variable - 2 -

MATH 3C: MIDTERM 1 REVIEW. 1. Counting

The random variable 1

Stochastic Models in Computer Science A Tutorial

Lecture Notes 1 Probability and Random Variables. Conditional Probability and Independence. Functions of a Random Variable

Appendix A : Introduction to Probability and stochastic processes

p. 6-1 Continuous Random Variables p. 6-2

The probability of an event is viewed as a numerical measure of the chance that the event will occur.

Probability theory for Networks (Part 1) CS 249B: Science of Networks Week 02: Monday, 02/04/08 Daniel Bilar Wellesley College Spring 2008

Chapter 2. Random Variable. Define single random variables in terms of their PDF and CDF, and calculate moments such as the mean and variance.

Chapter 2: Random Variables

p. 4-1 Random Variables

Communication Theory II

Some Basic Concepts of Probability and Information Theory: Pt. 2

CSE 312: Foundations of Computing II Random Variables, Linearity of Expectation 4 Solutions

Discrete Random Variables (1) Solutions

Random Variables. Cumulative Distribution Function (CDF) Amappingthattransformstheeventstotherealline.

Example 1. The sample space of an experiment where we flip a pair of coins is denoted by:

Discrete Probability Distributions

CMPSCI 240: Reasoning Under Uncertainty

MAT 271E Probability and Statistics

Conditional Probability

Probability Theory and Simulation Methods

LECTURE 1. 1 Introduction. 1.1 Sample spaces and events

Lecture Notes 5 Convergence and Limit Theorems. Convergence with Probability 1. Convergence in Mean Square. Convergence in Probability, WLLN

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

What does independence look like?

Uncertain Quantities 7.1 DISCRETE UNCERTAIN QUANTITIES

Part IA Probability. Definitions. Based on lectures by R. Weber Notes taken by Dexter Chua. Lent 2015

MATH 3510: PROBABILITY AND STATS July 1, 2011 FINAL EXAM

Statistical Preliminaries. Stony Brook University CSE545, Fall 2016

STAT2201. Analysis of Engineering & Scientific Data. Unit 3

Statistika pro informatiku

Chapter 2.5 Random Variables and Probability The Modern View (cont.)

Binomial and Poisson Probability Distributions

Discrete Random Variables. David Gerard Many slides borrowed from Linda Collins

ECE531: Principles of Detection and Estimation Course Introduction

Lecture 1: Basics of Probability

Transcription:

DISCRETE RANDOM VARIABLES: PMF s & CDF s [DEVORE 3.2] PROBABILITY MASS FUNCTION (PMF) DEFINITION): Let X be a discrete random variable. Then, its pmf, denoted as p X(k), is defined as follows: p X(k) := P(X = k) k Supp(X) PROBABILITY MASS FUNCTION (PMF) AXIOMS): The pmf p X(k) of a discrete r.v. X satisfies: Non-negativity on its Support: p X(k) 0 k Supp(X) Universal Sum of Unity: k Supp(X) p X(k) = 1 CUMULATIVE DENSITY FCN (CDF) DEFN: Let X be a discrete random variable s.t. Supp(X) = {k 1, k 2, k 3, } Then, its cdf, denoted as F X(x), is defined as follows: F X(x) := P(X x) = k i x p X(k i) x R CUMULATIVE DENSITY FCN (CDF) AXIOMS: The cdf F X(x) of a discrete r.v. X satisfies: Eventually Zero (One) to the Left (Right): lim FX(x) = 0, lim FX(x) = 1 x x + Non-decreasing: x 1 x 2 = F X(x 1) F X(x 2) Right-continuous: Piecewise Constant: lim F X(x) = F X(x 0) x x0 (AKA step function) x 0 R COMPUTING PROBABILITIES USING A DISCRETE PMF: Let scalars a, b R s.t. a < b. Then: Let X be a discrete r.v. with cdf F X(x). P(X a) = F X(a) P(X < a) = F X(a ) P(a X b) = F X(b) F X(a ) P(a < X < b) = F X(b ) F X(a) P(a < X b) = F X(b) F X(a) P(a X < b) = F X(b ) F X(a ) P(X b) = 1 F X(b ) P(X > b) = 1 F X(b) P(X = a) = F X(a) F X(a ) where: a represents the largest k Supp(X) such that k < a b represents the largest k Supp(X) such that k < b

DISCRETE RANDOM VARIABLES: PMF & CDF PLOTS [DEVORE 3.2] k 0 1 p W (k) 1/2 1/2 k 0 1 p X(k) 1/8 7/8 k 0 1 2 3 p Y (k) 1/8 3/8 3/8 1/8

EX 3.2.1: Consider the following experiment: Flip two fair coins and observe their top faces. Let random variable Z (Is at least One Tail Observed? (1 = Yes, 0 = No)) (a) List all the possible outcomes in the sample space Ω for the experiment. (b) For each outcome in the sample space Ω, determine the associated value of each random variable X, Z. (c) Determine the support of each random variable X, Z for the experiment. (d) Determine the probability mass function (pmf) for each random variable X, Z. (e) Determine the cumulative distribution function (cdf) for each random variable X, Z. (f) Sketch the cdf for each random variable.

EX 3.2.2: Consider the following experiment: Repeatedly flip a fair coin and observe its top face until a tail occurs. Let random variable Z (Is at least One Tail Observed? (1 = Yes, 0 = No)) (a) List four possible outcomes in the sample space Ω for the experiment. (b) For the four outcomes in the sample space Ω listed in part (a), determine the associated value of each rv X, Z. (c) Determine the support of each random variable X, Z for the experiment. (d) Determine the probability mass function (pmf) for each random variable X, Z. (e) Write the pmf of random variable X in closed-form by means of pattern recognition.

EX 3.2.3: Consider the following experiment: Repeatedly flip an unfair coin and observe its top face until a tail occurs. The coin is unfair because tails occurs twice as often as heads. Let random variable Z (Is at least One Tail Observed? (1 = Yes, 0 = No)) (a) List four possible outcomes in the sample space Ω for the experiment. (b) For the four outcomes in the sample space Ω listed in part (a), determine the associated value of each rv X, Z. (c) Determine the support of each random variable X, Z for the experiment. (d) Determine the probability mass function (pmf) for each random variable X, Z. (e) Write the pmf of random variable X in closed-form by means of pattern recognition.

EX 3.2.4: Consider the following experiment: Flip two fair coins and observe their top faces. Compute the following probabilities in two ways, one way using the pmf of X and the second way using the cdf of X: P(Either no heads or two heads) = P(Either no heads or two heads) = EX 3.2.5: Consider the following experiment: Repeatedly flip a fair coin and observe its top face until a tail occurs. Compute the following probabilities using the pmf of X: P(Between two heads and six heads, inclusive) = P(Between two heads and six heads, exclusive) = EX 3.2.6: Consider the following experiment: Repeatedly flip an unfair coin and observe its top face until a tail occurs. The coin is unfair because tails occurs twice as often as heads. Compute the following probabilities using the pmf of X: P(Between two heads and six heads, inclusive) = P(Between two heads and six heads, exclusive) =