Probability with Engineering Applications ECE 313 Section C Lecture 6. Lav R. Varshney 11 September 2017

Similar documents
Probability Theory. Introduction to Probability Theory. Principles of Counting Examples. Principles of Counting. Probability spaces.

Dept. of Linguistics, Indiana University Fall 2015

LECTURE 1. 1 Introduction. 1.1 Sample spaces and events

CMPSCI 240: Reasoning Under Uncertainty

Week 2. Section Texas A& M University. Department of Mathematics Texas A& M University, College Station 22 January-24 January 2019

Math 416 Lecture 3. The average or mean or expected value of x 1, x 2, x 3,..., x n is

Probability and Statisitcs

Lecture 10: Probability distributions TUESDAY, FEBRUARY 19, 2019

Review of Probability. CS1538: Introduction to Simulations

Discrete Mathematics and Probability Theory Fall 2014 Anant Sahai Note 15. Random Variables: Distributions, Independence, and Expectations

Permutations and Combinations

Elementary Discrete Probability

Chapter 6 Expectation and Conditional Expectation. Lectures Definition 6.1. Two random variables defined on a probability space are said to be

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

Homework 2. Spring 2019 (Due Thursday February 7)

Probability: Sets, Sample Spaces, Events

Random Variables Example:

Conditional Probability

Properties of Probability

1. Discrete Distributions

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

Example. What is the sample space for flipping a fair coin? Rolling a 6-sided die? Find the event E where E = {x x has exactly one head}

P [(E and F )] P [F ]

Combinatorial Analysis

Language as a Stochastic Process

Statistics and Econometrics I

Chapter 1 Probability Theory

Probability Theory and Simulation Methods

Notes 6 Autumn Example (One die: part 1) One fair six-sided die is thrown. X is the number showing.

Probability with Engineering Applications ECE 313 Section C Lecture 2. Lav R. Varshney 30 August 2017

Lecture 1. ABC of Probability

Northwestern University Department of Electrical Engineering and Computer Science

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

Lecture 2: Repetition of probability theory and statistics

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

Probabilistic Systems Analysis Spring 2018 Lecture 6. Random Variables: Probability Mass Function and Expectation

Lecture 1 Introduction to Probability and Set Theory Text: A Course in Probability by Weiss

Yin Wood Aggressive Power Grandparent 96. Ox Yin Earth Friends Sibling 60. Sheep Yin Earth Friends Sibling 60. Yin Fire Inconsistent Resource

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

Before Reading. Practice. wave. east. west. A. Fill in the blanks using the word list. west east tired wave pull shines. The Lazy Moon.

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

ECE353: Probability and Random Processes. Lecture 2 - Set Theory

Axioms of Probability

6.041SC Probabilistic Systems Analysis and Applied Probability, Fall 2013 Transcript Tutorial:A Random Number of Coin Flips

Countability Sets of Measure Zero Random Reals Normal Numbers There s a Bear in There. The Real Thing. Paul McCann. Wednesday, 3 August, 2011

Dynamic Programming Lecture #4

Preliminary Statistics Lecture 2: Probability Theory (Outline) prelimsoas.webs.com

k P (X = k)

Probability Notes. Definitions: The probability of an event is the likelihood of choosing an outcome from that event.

Discrete Random Variables

Sociology 6Z03 Topic 10: Probability (Part I)

Lecture 3. Discrete Random Variables

Lecture 6. Probability events. Definition 1. The sample space, S, of a. probability experiment is the collection of all

Business Statistics. Lecture 3: Random Variables and the Normal Distribution

Lecture 9: Conditional Probability and Independence

COMPSCI 240: Reasoning Under Uncertainty

Sample Spaces, Random Variables

Statistics for Linguists. Don t pannic

HW2 Solutions, for MATH441, STAT461, STAT561, due September 9th

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

Discrete Random Variables

Monty Hall Puzzle. Draw a tree diagram of possible choices (a possibility tree ) One for each strategy switch or no-switch

P (A B) P ((B C) A) P (B A) = P (B A) + P (C A) P (A) = P (B A) + P (C A) = Q(A) + Q(B).

CMPSCI 240: Reasoning about Uncertainty

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

Course: ESO-209 Home Work: 1 Instructor: Debasis Kundu

Lectures on Elementary Probability. William G. Faris

Statistics 251: Statistical Methods

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

Discrete Random Variable

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

Probability Rules. MATH 130, Elements of Statistics I. J. Robert Buchanan. Fall Department of Mathematics

Probability: Axioms, Properties, Interpretations

Algorithms for Uncertainty Quantification

1 Random variables and distributions

Theorem 1.7 [Bayes' Law]: Assume that,,, are mutually disjoint events in the sample space s.t.. Then Pr( )

Introduction to Probability. Ariel Yadin. Lecture 1. We begin with an example [this is known as Bertrand s paradox]. *** Nov.

CMPSCI 240: Reasoning Under Uncertainty

Chapter 8: An Introduction to Probability and Statistics

Lecture 8: Probability

12 1 = = 1

Discrete Probability Refresher

ECE 340 Probabilistic Methods in Engineering M/W 3-4:15. Lecture 2: Random Experiments. Prof. Vince Calhoun

2.6 Tools for Counting sample points

Topic -2. Probability. Larson & Farber, Elementary Statistics: Picturing the World, 3e 1

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

Advanced Herd Management Probabilities and distributions

MATH 10 INTRODUCTORY STATISTICS

MATH 3C: MIDTERM 1 REVIEW. 1. Counting

Probability theory basics

Module 1. Probability

Probability Theory. Probability and Statistics for Data Science CSE594 - Spring 2016

Lecture Notes 1 Basic Probability. Elements of Probability. Conditional probability. Sequential Calculation of Probability

Chapter 3 : Conditional Probability and Independence

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

Lecture 2. Constructing Probability Spaces

Probability 1 (MATH 11300) lecture slides

Binomial and Poisson Probability Distributions

Statistics for Financial Engineering Session 2: Basic Set Theory March 19 th, 2006

the time it takes until a radioactive substance undergoes a decay

Transcription:

Probability with Engineering Applications ECE 313 Section C Lecture 6 Lav R. Varshney 11 September 2017 1

Counting for cellular communication In frequency division multiple access (FDMA), a service provider purchases a fixed number of calling frequencies f Assume at any given time, there are n callers distributed at random over r cells To avoid crosstalk, all callers within a cell and immediately adjacent cells must be assigned unique frequencies Frequencies can be reused otherwise 2

Counting for cellular communication If n i are the cell occupancy numbers, and i and j are adjacent cells, then n i + n j f For purposes of frequency assignment, ordering of users within cell is irrelevant Thus we are partitioning n users into r subsets of sizes n 1, n 2,, n r Hence the number of arrangements of n over r cells with specified occupancy numbers is given by the multinomial coefficient The total number of arrangements of n distinguishable users into r cells is r n 3

Counting for cellular communication The probability of a particular set of occupancy numbers is therefore: n n P n 1, n 2,, n r = 1 n 2 n r n r This probability can then be used to determine the probability that f frequencies will suffice 4

Random experiment A random experiment E is characterized by three components: Possible outcomes (sample space), Ω Collection of sets of outcomes of interest, F Numerical assessment of likelihood of occurrence of each outcome of interest, P 5

Random variable Let X be a random variable for a probability space Ω, F, P If the probability experiment is performed, i.e. a value ω is selected from Ω, then the value of the random variable is X ω The value X ω is called the realized value of X for outcome ω 6

Random variable is a mapping [cnx.org] 7

Pass the Pigs (like dice) Position ω Ω Side (no dot) 1 Side (dot) 2 Razorback 3 Trotter 4 Snouter 5 Leaning Jowler 6 X ω 8

Pass the Pigs (with points) Position ω Ω Side (no dot) 0 Side (dot) 1 Razorback 5 Trotter 7 Snouter 15 Leaning Jowler 20 Y ω 9

Discrete random variable A random variable is said to be discrete if there is a finite set u 1,, u n or a countably infinite set u 1, u 2, such that P X u 1, u 2, = 1 The probability mass function (pmf) for a discrete random variable X, p X, is defined by p X u = P X = u 10

Probability mass function The pmf is sufficient to determine the probability of any event determined by X, because for any set A, P X A = p X u i i:u i A 11

Probability mass function The pmf sums to unity: i p X u i = 1 The support of a pmf p X is the set of u such that p X u > 0 12

Example of pmf Consider a random variable Z corresponding to the flip of a fair coin, where heads maps to 0 and tails maps to 3 What is the support of the pmf p Z? What is the pmf p Z? Does the pmf p Z sum to unity? 13

English letters (map to number 1:26) [By Nandhp - Own work; en:letter frequency., Public Domain, https://commons.wikimedia.org/w/index.php?curid=9971073] 14

Convex combinations [https://en.wikipedia.org/wiki/letter_frequency] What if we first randomly select the language i of a text, and then look at the letter frequencies? 15

Convex combinations A convex combination p of pmfs p i is readily verified to be a pmf, in particular the pmf corresponding to the convex combination P of measures P i : P A = λ i P i A, p ω = λ i p i ω i i The λ i are the probabilities with which the ith language is chosen 16

Pass the Pigs (empirical) Position Percentage Side (no dot) 34.9% Side (dot) 30.2% Razorback 22.4% Trotter 8.8% Snouter 3.0% Leaning Jowler 0.61% Sketch the pmfs p X and p Y {1,2,3,4,5,6} {0,1,5,7,15,20} 17

Probability mass function p X p Y 18

Mean of a random variable The mean of a random variable is a weighted average of the possible values of the random variable, such that the weights are given by the pmf: E X = i u i p X u i 19

Mean of a random variable What is the mean of the coin flip random variable Z? 20

Mean of a random variable What is the mean of the coin flip random variable Z? E Z = i u i p Z u i = 0 1 2 + 3 1 2 = 3 2 21

Mean of two random variables Ω 2 3 4 5 6 7 8 9 10 11 12 13 14 U Ω 2 3 4 5 6 7 8 9 10 11 12 13 1 V What are means of random variables U and V? 22

Mean of two random variables E U = 1 13 E V = 1 13 2 + + 14 = 104 13 = 8 1 + + 13 = 91 13 = 7 23

A new random variable Suppose we care about the energy of the card, so we consider W = V 2 What is the support of the pmf of W? What is the mean of W? 24

A new random variable Suppose we care about the energy of the card, so we consider W = V 2 What is the support of the pmf of W? 1, 4, 9, 16,, 169 What is the mean of W? E W = 1 819 1 + + 169 = 13 13 = 63 25

Functions of random variables ω Ω X ω Y ω Side (no dot) 1 0 Side (dot) 2 1 Razorback 3 5 Trotter 4 7 Snouter 5 15 Leaning Jowler 6 20 y = g x 26

Functions of random variables In general, the law of the unconscious statistician (LOTUS) says that: E g X = g u i p X u i i 27

Linearity of expectation If the function has linear components, things become even easier, since the expectation operation is linear: E ag X + bh X + c = ae g X + be h X + c How does one prove linearity of expectation? 28

Notable functions Let μ X = E X The difference X μ X is called the deviation of X from its mean What is the mean of the deviation? 29

Notable functions Let μ X = E X The difference X μ X is called the deviation of X from its mean What is the mean of the deviation? E X μ X = E X μ X = μ X μ X = 0 30

Notable functions The mean squared deviation is called the variance: var X = E X μ X 2 Also, Why? var X = E X 2 μ X 2 Its square root is called the standard deviation 31

Notable functions The mean squared deviation is called the variance: var X = E X μ X 2 Also, var X = E X 2 μ X 2 Why? E X 2 2Xμ X + μ X 2 = E X 2 2μ X E X + μ X 2 = E X 2 2μ X 2 + μ X 2 = E X 2 μ X 2 Its square root is called the standard deviation 32

33

Rat Ox Tiger Rabbit Dragon Snake Horse Sheep Monkey Cock Dog Boar Rat 1-1 1 Ox 1-1 1 Tiger 1-1 1 Rabbit 1-1 1 Dragon 1 1-1 Snake 1 1-1 Horse -1 1 1 Sheep -1 1 1 Monkey 1-1 1 Cock 1-1 1 Dog 1-1 1 Boar 1 1-1