Introduction to Discrete Mathematics

Slides:



Advertisements
Similar presentations
Lecture Discrete Probability. 5.3 Bayes’ Theorem We have seen that the following holds: We can write one conditional probability in terms of the.
Advertisements

Great Theoretical Ideas in Computer Science.
Lectures prepared by: Elchanan Mossel Yelena Shvets Introduction to probability Stat 134 FAll 2005 Berkeley Follows Jim Pitman’s book: Probability Section.
Section 7.4 (partially). Section Summary Expected Value Linearity of Expectations Independent Random Variables.
1 Discrete Structures & Algorithms Discrete Probability.
Math 310 Section 7.2 Probability. Succession of Events So far, our discussion of events have been in terms of a single stage scenario. We might be looking.
Great Theoretical Ideas in Computer Science.
The probabilistic method & infinite probability spaces Great Theoretical Ideas In Computer Science Steven Rudich, Anupam GuptaCS Spring 2004 Lecture.
Great Theoretical Ideas in Computer Science.
Probability Theory: Counting in Terms of Proportions Great Theoretical Ideas In Computer Science Steven Rudich, Anupam GuptaCS Spring 2004 Lecture.
Lectures prepared by: Elchanan Mossel Yelena Shvets Introduction to probability Stat 134 FAll 2005 Berkeley Follows Jim Pitman’s book: Probability Section.
Great Theoretical Ideas In Computer Science Steven Rudich, Anupam GuptaCS Spring 2004 Lecture 22April 1, 2004Carnegie Mellon University
Simple Mathematical Facts for Lecture 1. Conditional Probabilities Given an event has occurred, the conditional probability that another event occurs.
Lecture Discrete Probability. 5.3 Bayes’ Theorem We have seen that the following holds: We can write one conditional probability in terms of the.
Probability III: The probabilistic method & infinite probability spaces Great Theoretical Ideas In Computer Science Steven Rudich, Avrim BlumCS
Basic Business Statistics, 10e © 2006 Prentice-Hall, Inc.. Chap 5-1 Chapter 5 Some Important Discrete Probability Distributions Basic Business Statistics.
Great Theoretical Ideas in Computer Science.
ENGG 2040C: Probability Models and Applications Andrej Bogdanov Spring Properties of expectation.
Dan Boneh Introduction Discrete Probability (crash course) Online Cryptography Course Dan Boneh.
CSCE 411 Design and Analysis of Algorithms Set 9: Randomized Algorithms Prof. Jennifer Welch Fall 2014 CSCE 411, Fall 2014: Set 9 1.
Chapter 5: Probability Analysis of Randomized Algorithms Size is rarely the only property of input that affects run time Worst-case analysis most common.
COMPSCI 102 Introduction to Discrete Mathematics.
Analysis of Algorithms CS 477/677 Instructor: Monica Nicolescu Lecture 7.
Great Theoretical Ideas in Computer Science for Some.
Tutorial 5: Discrete Probability I Reference: cps102/lecture11.ppt Steve Gu Feb 15, 2008.
Great Theoretical Ideas In Computer Science John LaffertyCS Fall 2006 Lecture 10 Sept. 28, 2006Carnegie Mellon University Classics.
Chapter 6 Large Random Samples Weiqi Luo ( 骆伟祺 ) School of Data & Computer Science Sun Yat-Sen University :
Dan Boneh Introduction Discrete Probability (crash course, cont.) Online Cryptography Course Dan Boneh See also:
Probability Distribution. Probability Distributions: Overview To understand probability distributions, it is important to understand variables and random.
Theory of Computational Complexity Probability and Computing Ryosuke Sasanuma Iwama and Ito lab M1.
Section 7.3. Why we need Bayes?  How to assess the probability that a particular event occurs on the basis of partial evidence.  The probability p(F)
Great Theoretical Ideas in Computer Science.
Chapter 7. Section 7.1 Finite probability  In a lottery, players win a large prize when they pick four digits that match, in the correct order, four.
1 COMP2121 Discrete Mathematics Principle of Inclusion and Exclusion Probability Hubert Chan (Chapters 7.4, 7.5, 6) [O1 Abstract Concepts] [O3 Basic Analysis.
Data Structures and Algorithms (AT70. 02) Comp. Sc. and Inf. Mgmt
Introduction to Discrete Probability
ICS 253: Discrete Structures I
Chapter 11 Probability.
Chapter 6: Discrete Probability
Copyright © 2016, 2013, and 2010, Pearson Education, Inc.
Applied Discrete Mathematics Week 11: Relations
Introduction to Discrete Mathematics
What is Probability? Quantification of uncertainty.
CS104:Discrete Structures
Conditional Probability
Probability III: The Probabilistic Method
Lecture 8 Randomized Algorithms
Chapter. 5_Probability Distributions
Econ 113 Lecture Module 2.
3.1 Expectation Expectation Example
Now it’s time to look at…
Mathematics for Computer Science MIT 6.042J/18.062J
Chapter 4 – Part 2.
Chapter 16.
CSCE 411 Design and Analysis of Algorithms
Great Theoretical Ideas In Computer Science
Probability Theory: Counting in Terms of Proportions
Discrete Distributions
Great Theoretical Ideas In Computer Science
Discrete Distributions
I flip a coin two times. What is the sample space?
Applied Discrete Mathematics Week 12: Discrete Probability
Discrete Distributions.
Probability Theory: Counting in Terms of Proportions
5. Conditioning and Independence
Randomized Algorithms CS648
Discrete Distributions
Data Structures and Algorithms (AT70. 02) Comp. Sc. and Inf. Mgmt
Lecture 9 Randomized Algorithms
Discrete Math for CS CMPSC 360 LECTURE 34 Last time:
Presentation transcript:

Introduction to Discrete Mathematics COMPSCI 102 Introduction to Discrete Mathematics

CPS 102 Classics Lecture 11 (October 3, 2007)

Today, we will learn about a formidable tool in probability that will allow us to solve problems that seem really really messy…

åk k Pr(k letters end up in correct envelopes) If I randomly put 100 letters into 100 addressed envelopes, on average how many letters will end up in their correct envelopes? Hmm… åk k Pr(k letters end up in correct envelopes) = åk k (…aargh!!…)

åk k Pr(exactly k collisions) On average, in class of size m, how many pairs of people will have the same birthday? åk k Pr(exactly k collisions) = åk k (…aargh!!!!…) Did Pr(…) before for k=0, but gets more complicated for larger k. e.g., if 3 people on same day, then have 3 pairs but only 3 people involved.

The new tool is called “Linearity of Expectation”

Today’s lecture: not too much material, but need to understand it well Random Variable To use this new tool, we will also need to understand the concept of a Random Variable Today’s lecture: not too much material, but need to understand it well

Random Variable Let S be sample space in a probability distribution A Random Variable is a real-valued function on S Examples: X = value of white die in a two-dice roll X(3,4) = 3, X(1,6) = 1 Y = sum of values of the two dice Y(3,4) = 7, Y(1,6) = 7 W = (value of white die)value of black die W(3,4) = 34, Y(1,6) = 16

Tossing a Fair Coin n Times S = all sequences of {H, T}n D = uniform distribution on S  D(x) = (½)n for all x  S Random Variables (say n = 10) X = # of heads X(HHHTTHTHTT) = 5 Y = (1 if #heads = #tails, 0 otherwise) Y(HHHTTHTHTT) = 1, Y(THHHHTTTTT) = 0

Notational Conventions Use letters like A, B, E for events Use letters like X, Y, f, g for R.V.’s R.V. = random variable

Two Views of Random Variables Input to the function is random Think of a R.V. as A function from S to the reals  Or think of the induced distribution on  Randomness is “pushed” to the values of the function

Two Coins Tossed X: {TT, TH, HT, HH} → {0, 1, 2} counts the number of heads Distribution on the reals 1 2 TT HT TH HH ¼ S ¼ ¼ ½

It’s a Floor Wax And a Dessert Topping It’s a function on the sample space S It’s a variable with a probability distribution on its values You should be comfortable with both views

From Random Variables to Events For any random variable X and value a, we can define the event A that X = a Pr(A) = Pr(X=a) = Pr({x  S| X(x)=a}) E.g., if A is the event that both coins are heads, then X=1 when both coins are heads and X=0 otherwise.

Two Coins Tossed X S X: {TT, TH, HT, HH} → {0, 1, 2} counts # of heads 1 2 TT HT TH HH ¼ S Pr(X = a) = Pr({x  S| X(x) = a}) X ¼ ¼ Pr(X = 1) ½ = Pr({x  S| X(x) = 1}) Distribution on X = Pr({TH, HT}) = ½

From Events to Random Variables For any event A, can define the indicator random variable for A: XA(x) = 1 if x  A 0 if x  A 0.3 0.2 0.1 0.05 1 E.g., if A is the event that both coins are heads, then X=1 when both coins are heads and X=0 otherwise. 0.55 0.45

Definition: Expectation The expectation, or expected value of a random variable X is written as E[X], and is  Pr(x) X(x) =  k Pr[X = k] x  S k E[X] = X is a function on the sample space S X has a distribution on its values

A Quick Calculation… What if I flip a coin 3 times? What is the expected number of heads? E[X] = (1/8)×0 + (3/8)×1 + (3/8)×2 + (1/8)×3 = 1.5 But Pr[ X = 1.5 ] = 0 Moral: don’t always expect the expected. Pr[ X = E[X] ] may be 0 !

Type Checking A Random Variable is the type of thing you might want to know an expected value of If you are computing an expectation, the thing whose expectation you are computing is a random variable

Indicator R.V.s: E[XA] = Pr(A) For any event A, can define the indicator random variable for A: XA(x) = 1 if x  A 0 if x  A E[XA] = 1 × Pr(XA = 1) = Pr(A) E.g., if A is the event that both coins are heads, then X=1 when both coins are heads and X=0 otherwise.

Adding Random Variables If X and Y are random variables (on the same set S), then Z = X + Y is also a random variable Z(x) = X(x) + Y(x) E.g., rolling two dice. X = 1st die, Y = 2nd die, Z = sum of two dice

Adding Random Variables Example: Consider picking a random person in the world. Let X = length of the person’s left arm in inches. Y = length of the person’s right arm in inches. Let Z = X+Y. Z measures the combined arm lengths

How about the case of X=1st die, Y=2nd die? X = left arm, Y=right arm? Independence Two random variables X and Y are independent if for every a,b, the events X=a and Y=b are independent How about the case of X=1st die, Y=2nd die? X = left arm, Y=right arm?

Linearity of Expectation If Z = X+Y, then E[Z] = E[X] + E[Y] Even if X and Y are not independent

 Pr[x] X(x) +  Pr[x] Y(x))  Pr[x] Z(x) x  S E[Z] =  Pr[x] (X(x) + Y(x)) x  S =  Pr[x] X(x) +  Pr[x] Y(x)) x  S = = E[X] + E[Y]

Linearity of Expectation E.g., 2 fair flips: X = 1st coin, Y = 2nd coin Z = X+Y = total # heads What is E[X]? E[Y]? E[Z]? 1,1,2 HH 0,1,1 TH 1,0,1 HT 0,0,0 TT

Linearity of Expectation E.g., 2 fair flips: X = at least one coin is heads Y = both coins are heads, Z = X+Y Are X and Y independent? What is E[X]? E[Y]? E[Z]? 1,1,2 HH 1,0,1 TH 1,0,1 HT 0,0,0 TT

The expectation of the sum = The sum of the expectations By Induction E[X1 + X2 + … + Xn] = E[X1] + E[X2] + …. + E[Xn] The expectation of the sum = The sum of the expectations

It is finally time to show off our probability prowess…

åk k Pr(k letters end up in correct envelopes) If I randomly put 100 letters into 100 addressed envelopes, on average how many letters will end up in their correct envelopes? Hmm… åk k Pr(k letters end up in correct envelopes) = åk k (…aargh!!…)

Use Linearity of Expectation Let Ai be the event the ith letter ends up in its correct envelope Let Xi be the indicator R.V. for Ai Xi = 1 if Ai occurs 0 otherwise Let Z = X1 + … + X100 We are asking for E[Z] E[Xi] = Pr(Ai) = 1/100 So E[Z] = 1

Question: were the Xi independent? So, in expectation, 1 letter will be in the same correct envelope Pretty neat: it doesn’t depend on how many letters! Question: were the Xi independent? No! E.g., think of n=2

Use Linearity of Expectation General approach: View thing you care about as expected value of some RV Write this RV as sum of simpler RVs (typically indicator RVs) Solve for their expectations and add them up!

Example We flip n coins of bias p. What is the expected number of heads? We could do this by summing k k Pr(X = k) = åk k pk(1-p)n-k n k But now we know a better way!

Linearity of Expectation! Let X = number of heads when n independent coins of bias p are flipped Break X into n simpler RVs: Xj = 1 if the jth coin is heads 0 if the jth coin is tails E[ X ] = E[ Si Xi ] = np

What About Products? No! If Z = XY, then E[Z] = E[X] × E[Y]? X=indicator for “1st flip is heads” Y=indicator for “1st flip is tails” E[XY]=0

But It’s True If RVs Are Independent Proof: E[X] = åa a × Pr(X=a) E[Y] = åb b × Pr(Y=b) E[XY] = åc c × Pr(XY = c) = åc åa,b:ab=c c × Pr(X=a  Y=b) = åa,b ab × Pr(X=a  Y=b) Look at event that XY=c with a magnifying glass, break down into all a,b whose product is c. = åa,bab × Pr(X=a) Pr(Y=b) = E[X] E[Y]

E[X*X] = E[X]2? No: E[X2] = ½, E[X]2 = ¼ Example: 2 fair flips X = indicator for 1st coin heads Y = indicator for 2nd coin heads XY = indicator for “both are heads” E[X] = ½, E[Y] = ½, E[XY] = ¼ E[X*X] = E[X]2? No: E[X2] = ½, E[X]2 = ¼ In fact, E[X2] – E[X]2 is called the variance of X

Most of the time, though, power will come from using sums Mostly because Linearity of Expectations holds even if RVs are not independent

åk k Pr(exactly k collisions) On average, in class of size m, how many pairs of people will have the same birthday? åk k Pr(exactly k collisions) = åk k (…aargh!!!!…) Did Pr(…) before for k=0, but gets more complicated for larger k. e.g., if 3 people on same day, then have 3 pairs but only 3 people involved.

Use linearity of expectation Suppose we have m people each with a uniformly chosen birthday from 1 to 366 X = number of pairs of people with the same birthday E[X] = ?

X = number of pairs of people with the same birthday E[X] = ? Use m(m-1)/2 indicator variables, one for each pair of people Xjk = 1 if person j and person k have the same birthday; else 0 E[Xjk] = (1/366) 1 + (1 – 1/366) 0 = 1/366

X = number of pairs of people with the same birthday Xjk = 1 if person j and person k have the same birthday; else 0 E[Xjk] = (1/366) 1 + (1 – 1/366) 0 = 1/366 E[X] = E[ Sj ≤ k ≤ m Xjk ] = Sj ≤ k ≤ m E[ Xjk ] = m(m-1)/2 × 1/366

Step Right Up… You pick a number n  [1..6]. You roll 3 dice. If any match n, you win $1. Else you pay me $1. Want to play? Hmm… let’s see

Ai = event that i-th die matches Analysis Ai = event that i-th die matches Xi = indicator RV for Ai Expected number of dice that match: E[X1+X2+X3] = 1/6+1/6+1/6 = ½ But this is not the same as Pr(at least one die matches)

Analysis Pr(at least one die matches) = 1 – Pr(none match) = 1 – (5/6)3 = 0.416

Random Variables Expectation Definition Two Views of R.V.s Linearity How to solve problems using it Study Bee