EE126: Probability and Random Processes

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

With Question/Answer Animations. Chapter 7

CSC Discrete Math I, Spring Discrete Probability

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).

Probabilistic models

Lecture 3 Probability Basics

2.4 Conditional Probability

Lecture 3. January 7, () Lecture 3 January 7, / 35

Probability Distributions. Conditional Probability.

Lower bound for sorting/probability Distributions

Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 14

Probabilistic models

Notes slides from before lecture. CSE 21, Winter 2017, Section A00. Lecture 15 Notes. Class URL:

Venn Diagrams; Probability Laws. Notes. Set Operations and Relations. Venn Diagram 2.1. Venn Diagrams; Probability Laws. Notes

Lecture 2. Conditional Probability

Probability Distributions. Conditional Probability

the time it takes until a radioactive substance undergoes a decay

Lecture 1. ABC of Probability

1. When applied to an affected person, the test comes up positive in 90% of cases, and negative in 10% (these are called false negatives ).

Conditional Probability, Independence, Bayes Theorem Spring January 1, / 23

Elementary Discrete Probability

LECTURE 1. 1 Introduction. 1.1 Sample spaces and events

Probability 1 (MATH 11300) lecture slides

HW1 Solutions. October 5, (20 pts.) Random variables, sample space and events Consider the random experiment of ipping a coin 4 times.

ECE 302: Chapter 02 Probability Model

Bayes Rule for probability

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

Statistical Inference

Conditional Probability, Independence, Bayes Theorem Spring January 1, / 28

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

Introduction to Probability Theory, Algebra, and Set Theory

ORF 245 Fundamentals of Statistics Chapter 5 Probability

CMPSCI 240: Reasoning about Uncertainty

Introduction to Probability 2017/18 Supplementary Problems

Lecture 3 - More Conditional Probability

CS626 Data Analysis and Simulation

Where are we in CS 440?

Final Examination. Adrian Georgi Josh Karen Lee Min Nikos Tina. There are 12 problems totaling 150 points. Total time is 170 minutes.

Lecture 1: Review of Probability

STOR Lecture 4. Axioms of Probability - II

Conditional Probability. CS231 Dianna Xu

Conditional probability

Conditional Probability, Independence, Bayes Theorem Spring 2018

Topic 5 Basics of Probability

Lecture 04: Conditional Probability. Lisa Yan July 2, 2018

Great Theoretical Ideas in Computer Science

STAT509: Probability

Lecture 8: Conditional probability I: definition, independence, the tree method, sampling, chain rule for independent events

STAT 111 Recitation 1

Axioms of Probability

STAT 430/510 Probability

Basic Statistics for SGPE Students Part II: Probability theory 1

CS 361: Probability & Statistics

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 10

Probability and Independence Terri Bittner, Ph.D.

Problems and results for the ninth week Mathematics A3 for Civil Engineering students

Intermediate Math Circles November 15, 2017 Probability III

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

CS 441 Discrete Mathematics for CS Lecture 19. Probabilities. CS 441 Discrete mathematics for CS. Probabilities

Lecture notes for probability. Math 124

STAT:5100 (22S:193) Statistical Inference I

First Digit Tally Marks Final Count

Statistical Theory 1

Chapter 2. Probability. Math 371. University of Hawai i at Mānoa. Summer 2011

Recap. The study of randomness and uncertainty Chances, odds, likelihood, expected, probably, on average,... PROBABILITY INFERENTIAL STATISTICS

IE 230 Probability & Statistics in Engineering I. Closed book and notes. 60 minutes. Four Pages.

Formalizing Probability. Choosing the Sample Space. Probability Measures

Mathematical Foundations of Computer Science Lecture Outline October 18, 2018

Lecture 1: Probability Fundamentals

Discrete Probability

What is a random variable

Homework 4 Solution, due July 23

The enumeration of all possible outcomes of an experiment is called the sample space, denoted S. E.g.: S={head, tail}

Outcomes, events, and probability

Chapter 14. From Randomness to Probability. Copyright 2012, 2008, 2005 Pearson Education, Inc.

Lecture 4: Probability, Proof Techniques, Method of Induction Lecturer: Lale Özkahya

Name: Exam 2 Solutions. March 13, 2017

EnM Probability and Random Processes

Chap 1: Experiments, Models, and Probabilities. Random Processes. Chap 1 : Experiments, Models, and Probabilities

4 Lecture 4 Notes: Introduction to Probability. Probability Rules. Independence and Conditional Probability. Bayes Theorem. Risk and Odds Ratio

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

MAT 271E Probability and Statistics

Uncertainty. Russell & Norvig Chapter 13.

Where are we in CS 440?

Tutorial 3: Random Processes

2. Conditional Probability

ORF 245 Fundamentals of Statistics Chapter 1 Probability

Probability Pr(A) 0, for any event A. 2. Pr(S) = 1, for the sample space S. 3. If A and B are mutually exclusive, Pr(A or B) = Pr(A) + Pr(B).

Probability Year 10. Terminology

Probability COMP 245 STATISTICS. Dr N A Heard. 1 Sample Spaces and Events Sample Spaces Events Combinations of Events...

Chapter 1 (Basic Probability)

Statistical Methods for the Social Sciences, Autumn 2012

Dept. of Linguistics, Indiana University Fall 2015

STAT 516: Basic Probability and its Applications

Probability Theory Review

HW MATH425/525 Lecture Notes 1

Notes on probability : Exercise problems, sections (1-7)

CME 106: Review Probability theory

COS 424: Interacting with Data. Lecturer: Dave Blei Lecture #2 Scribe: Ellen Kim February 7, 2008

Math 1313 Experiments, Events and Sample Spaces

Transcription:

EE126: Probability and Random Processes Lecture 1: Probability Models Abhay Parekh UC Berkeley January 18, 2011

1 Logistics 2 Introduction 3 Model 4 Examples

What is this course about? Most real-world problems involve uncertainty 1 Predictions: Will you like this class? Will you get an A? Will the Giants win the world series next year? What are the odds? 2 Strategy/Decision Making How should you bet in blackjack? Should you buy shares of AAPL? 3 Engineering How should you build a spam filter? How should you build a wifi system? Probability is a mathematical discipline that allows one to reason about uncertainty

What is this course about? Two equally important skills taught in this class Understand the problem as an experiment Combinatorics, Calculus Many students get stuck on the first block. Solve lots of problems...

The list (set) of base outcomes is called the Sample Space. The rules by which probabilities are assigned are the Axioms of Probability. Basic Framework: The Experiment Concept 1 The experiment has base outcomes 2 These outcomes are exhaustive and mutually exclusive 3 Each base outcome, e is assigned a non-negative number P(e) called its probability 4 The probabilities summed over all of the base outcomes always equals 1 Example: Toss a fair coin twice 1 Base outcomes are HH,HT,TH,TT 2 This covers all the possibilities. M.E. 3 Each of these outcomes is equally likely 4 Assign each outcome a probability of 0.25.

Sample Space, Ω 1 Toss a Coin 3 times 2 Pick 3 balls from an urn with 2 Red and 3 Black Balls 3 Toss a coin until the first H appears

Event: A(ny) subset of the Sample Space 1 E 1 : Get 2 Heads when experiment is to toss a Coin 3 times 2 E 2 : Get 1 Black and 2 Reds when exp is to pick 3 balls from an urn with 2 Red and 3 Black Balls 3 E 3 : Even number of tosses when exp is to toss a coin until the first H appears 4 Always events: The base outcomes; The set of all base outcomes, Ω and the null outcome {}.

The Axioms of Probability Probabilities are assigned to EVENTS 1 P(A) 0 2 P(Ω) = 1 3 If A 1, A 2,..., are mutually exclusive P(A 1 A 2...) = P(A 1 ) + P(A 2 ) +...

Set Theory Can be Useful Events don t have to be mutually exclusive. 1 If A B then P(A) P(B) 2 P(A B) = P(A) + P(B) P(A B) 3 P( n i=1 A i) n i=1 P(A i) [in recitation] 4 (A B) c = A c B c 5 etc

Discrete Uniform Law Suppose all the base outcomes of an experiment are equally likely Given any event A: P(A) = Number of base outcomes in A Total number of base outcomes = A Ω.

Two Die Toss Experiment: Toss 2 six sided dice. (T 1, T 2 ) 1 2 3 4 5 6 1 2 3 4 5 6 Each base outcome has probability 1/36. P(T 1 = 1) = P(T 1 = T 2 ) = P(min{T 1, T 2 } = 3) =

Toss to First Head Example Revisited Ω = {H, TH, TTH, TTTH, TTTTH,...} Let E i = Heads on the i th toss. What should be P(E i )? Has to add up to 1 What about P(E i ) = 1 i? Adds to. Correct answer (we will see why later) is P(E i ) = 1. 2 i P(even number of tosses) = 1 2 2 + 1 2 4 + 1 2 6 +... = 1 4 3 4 = 1 3 Why not 1 2?

Example: Monty Hall Problem Game Show: 3 doors. Awesome prize behind one of them. Contestant picks a door. Monty opens one of the other two doors that does not have a prize. Contestant can either stick to the original door or change selection. What should he/she do?? Can switching help? W : contestant wins; A : picks prize door; S : decides to switch. P(W ) = P(A S c ) + P(A c S) If P(S) = 0 : P(W ) = P(A) = 1 3 If P(S) = 1 : P(W ) = P(A c ) = 2 3. Surprisingly, it is much better to switch!

Controversy The problem appeared in Parade Magazine in a column by Marilyn Vos Savant. From the Wikipedia Though vos Savant gave the correct answer that switching would win two-thirds of the time, she estimates the magazine received 10,000 letters including close to 1,000 signed by PhDs, many on letterheads of mathematics and science departments, declaring that her solution was wrong (Tierney 1991). As a result of the publicity the problem earned the alternative name Marilyn and the Goats.

Continuous Sample Spaces Experiment: At bus stop; time to next bus. Suppose the bus will definitely arrive in 1 hour. Then Ω = {t (0, 1]}. Assigning probabilities becomes a bit tricky... Example: If bus is equally likely to come at any time in (0, 1], then P(t =.5) = 0 Solution: Define a function f T (t) such that 1 0 f T (t)dt = 1 P(α t β) = β α dt = β α for 0 < α, β 1.

Continuous Sample Spaces In all engineering problems you have finite precision so the sample space is discrete Continuous sample spaces are merely approximations that make calculations and understanding easier Don t worry about continuous sample spaces right now, but now may be a good time to brush up on your calculus!