CIS 2033 based on Dekking et al. A Modern Introduction to Probability and Statistics. 2007 Instructor Longin Jan Latecki C2: Outcomes, events, and probability.

Slides:



Advertisements
Similar presentations
Chapter 2 Concepts of Prob. Theory
Advertisements

Introduction to Probability Experiments, Outcomes, Events and Sample Spaces What is probability? Basic Rules of Probability Probabilities of Compound Events.
CIS 2033 based on Dekking et al. A Modern Introduction to Probability and Statistics Instructor Longin Jan Latecki C3: Conditional Probability And.
A.P. STATISTICS LESSON 6 – 2 (DAY2) PROBABILITY RULES.
Week 21 Basic Set Theory A set is a collection of elements. Use capital letters, A, B, C to denotes sets and small letters a 1, a 2, … to denote the elements.
Chapter 4 Probability and Probability Distributions
COUNTING AND PROBABILITY
SI485i : NLP Day 2 Probability Review. Introduction to Probability Experiment (trial) Repeatable procedure with well-defined possible outcomes Outcome.
Probability and Statistics Dr. Saeid Moloudzadeh Sample Space and Events 1 Contents Descriptive Statistics Axioms of Probability Combinatorial.
Basic Probability Sets, Subsets Sample Space Event, E Probability of an Event, P(E) How Probabilities are assigned Properties of Probabilities.
1. Probability 2. Random variables 3. Inequalities 4. Convergence of random variables 5. Point and interval estimation 6. Hypotheses testing 7. Nonparametric.
Math 310 Section 7.1 Probability. What is a probability? Def. In common usage, the word "probability" is used to mean the chance that a particular event.
C4: DISCRETE RANDOM VARIABLES CIS 2033 based on Dekking et al. A Modern Introduction to Probability and Statistics Longin Jan Latecki.
5.2A Probability Rules! AP Statistics.
Lecture 7 Dustin Lueker.  Experiment ◦ Any activity from which an outcome, measurement, or other such result is obtained  Random (or Chance) Experiment.
Copyright ©2011 Nelson Education Limited. Probability and Probability Distributions CHAPTER 4 Part 2.
Sets, Combinatorics, Probability, and Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesProbability.
Sets, Combinatorics, Probability, and Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesProbability.
MATH 3033 based on Dekking et al. A Modern Introduction to Probability and Statistics Slides by Tim Birbeck Instructor Longin Jan Latecki C2: Outcomes,
5.1 Basic Probability Ideas
+ The Practice of Statistics, 4 th edition – For AP* STARNES, YATES, MOORE Chapter 6: Probability: What are the Chances? Section 6.3 Conditional Probability.
10/1/20151 Math a Sample Space, Events, and Probabilities of Events.
Chapter 8 Probability Section R Review. 2 Barnett/Ziegler/Byleen Finite Mathematics 12e Review for Chapter 8 Important Terms, Symbols, Concepts  8.1.
Sample space The set of all possible outcomes of a chance experiment –Roll a dieS={1,2,3,4,5,6} –Pick a cardS={A-K for ♠, ♥, ♣ & ♦} We want to know the.
Chapter 11 Probability Sample spaces, events, probabilities, conditional probabilities, independence, Bayes’ formula.
Econ 3790: Business and Economics Statistics Instructor: Yogesh Uppal
CPSC 531: Probability Review1 CPSC 531:Probability & Statistics: Review Instructor: Anirban Mahanti Office: ICT Class.
LECTURE 15 THURSDAY, 15 OCTOBER STA 291 Fall
Lecture PowerPoint Slides Basic Practice of Statistics 7 th Edition.
Computing Fundamentals 2 Lecture 6 Probability Lecturer: Patrick Browne
1 CHAPTERS 14 AND 15 (Intro Stats – 3 edition) PROBABILITY, PROBABILITY RULES, AND CONDITIONAL PROBABILITY.
PROBABILITY, PROBABILITY RULES, AND CONDITIONAL PROBABILITY
5.1 Randomness  The Language of Probability  Thinking about Randomness  The Uses of Probability 1.
1 CHAPTER 7 PROBABILITY, PROBABILITY RULES, AND CONDITIONAL PROBABILITY.
Basic Principles (continuation) 1. A Quantitative Measure of Information As we already have realized, when a statistical experiment has n eqiuprobable.
Probability You’ll probably like it!. Probability Definitions Probability assignment Complement, union, intersection of events Conditional probability.
Statistics Lecture 4. Last class: measures of spread and box-plots Have completed Chapter 1 Today - Chapter 2.
Sixth lecture Concepts of Probabilities. Random Experiment Can be repeated (theoretically) an infinite number of times Has a well-defined set of possible.
How likely is it that…..?. The Law of Large Numbers says that the more times you repeat an experiment the closer the relative frequency of an event will.
Natural Language Processing Giuseppe Attardi Introduction to Probability IP notice: some slides from: Dan Jurafsky, Jim Martin, Sandiway Fong, Dan Klein.
EMIS 7300 SYSTEMS ANALYSIS METHODS Spring 2006 Dr. John Lipp Copyright © Dr. John Lipp.
Lecture 7 Dustin Lueker. 2STA 291 Fall 2009 Lecture 7.
C4: DISCRETE RANDOM VARIABLES CIS 2033 based on Dekking et al. A Modern Introduction to Probability and Statistics Longin Jan Latecki.
Lecture 6 Dustin Lueker.  Standardized measure of variation ◦ Idea  A standard deviation of 10 may indicate great variability or small variability,
+ Chapter 5 Overview 5.1 Introducing Probability 5.2 Combining Events 5.3 Conditional Probability 5.4 Counting Methods 1.
Stat 1510: General Rules of Probability. Agenda 2  Independence and the Multiplication Rule  The General Addition Rule  Conditional Probability  The.
Lecture 7 Dustin Lueker.  Experiment ◦ Any activity from which an outcome, measurement, or other such result is obtained  Random (or Chance) Experiment.
Probability theory is the branch of mathematics concerned with analysis of random phenomena. (Encyclopedia Britannica) An experiment: is any action, process.
Random Variables and Stochastic Processes – Dr. Ghazi Al Sukkar Office Hours: will be.
5.2 Day One Probability Rules. Learning Targets 1.I can describe a probability model for a chance process. 2.I can use basic probability rules, including.
From Randomness to Probability
Basic Probability. Introduction Our formal study of probability will base on Set theory Axiomatic approach (base for all our further studies of probability)
AP Statistics From Randomness to Probability Chapter 14.
Probability and Probability Distributions. Probability Concepts Probability: –We now assume the population parameters are known and calculate the chances.
Concepts of Probability Introduction to Probability & Statistics Concepts of Probability.
Probability and Statistics for Computer Scientists Second Edition, By: Michael Baron Chapter 2: Probability CIS Computational Probability and Statistics.
Probability and Statistics for Computer Scientists Second Edition, By: Michael Baron Chapter 2: Probability CIS Computational Probability and.
Chapter 6 6.1/6.2 Probability Probability is the branch of mathematics that describes the pattern of chance outcomes.
PROBABILITY AND PROBABILITY RULES
What is Probability? Quantification of uncertainty.
Lecture 11 Sections 5.1 – 5.2 Objectives: Probability
STA 291 Spring 2008 Lecture 7 Dustin Lueker.
Probability Models Section 6.2.
Probability and Statistics for Computer Scientists Second Edition, By: Michael Baron Chapter 2: Probability CIS Computational Probability and.
C3: Conditional Probability And Independence
Honors Statistics From Randomness to Probability
C3: Conditional Probability And Independence
C3: Conditional Probability And Independence
A random experiment gives rise to possible outcomes, but any particular outcome is uncertain – “random”. For example, tossing a coin… we know H or T will.
Sets, Combinatorics, Probability, and Number Theory
Presentation transcript:

CIS 2033 based on Dekking et al. A Modern Introduction to Probability and Statistics Instructor Longin Jan Latecki C2: Outcomes, events, and probability

2.1 – Sample Spaces  Sample Space: A sample space is a set whose elements describe the outcomes of the experiment in which we are interested.  Example: If we ask arbitrary people on the street what month they were born, the following is an obvious sample space:

2.1 – Sample Spaces  Permutation: the order in which n different objects can be placed.  Example: If we have three envelopes and number them 1, 2, and 3, the following sample space consists of every different permutation we can make using all three envelopes:

2.2 – Events  Event: A subset of the sample space  Example: In the birthday experiment, if we ask for the outcomes that only involve the months with 31 days, we would have the following event:

2.2 – Events  We can use set operators to combine events:  Example: In the birthday experiment, if we intersect the event R, where the month has the letter ‘r’ in it, and the event L, where the month has 31 days, we get the following: NameDefinition Union Intersection Compliment

2.2 – Events  Disjoint / Mutually Exclusive: Two events that have no outcomes in common. A∩B = ∅  Example: In the birthday experiment, the event L, all the birthdays with 31 days, and the event {Feb} are mutually exclusive.  We say the event A implies event B if the outcomes of A also lie in B. A ⊂ B  DeMorgan’s laws: For any two events A and B we have: (A ∪ B) c = A c ∩ B c and (A ∩ B) c = A c ∪ B c

2.3 – Probability  Probability function: A probability function P on a finite sample space Ω assigns to each event A in Ω a number P(A) in [0,1] such that: (i) P(Ω) = 1, and (ii) P(A ∪ B) = P(A) + P(B) if A and B are disjoint. The number P(A) is called the probability that A occurs.  Example: In an experiment where we flip a perfectly weighted coin and record whether the coin lands on heads or tails, we could define the probability function P such that: P({H}) = P({T}) =1/2

2.3 – Probability  Formally, we should write P({T}) and not P(T) because a probability function works on events and not outcomes. However, in practice, we often drop the curly braces for a singleton set.  If we consider an experiment that only has two outcomes, such as success or failure, one outcome has a probability p to occur where 0 < p < 1, and the other outcome has a probability of 1 - p to occur.

2.3 – Probability  Compute P(L) and P(R) in the birthday experiment.

2.3 – Probability  To assign probability to an event, we can use the additivity property.  Example: Ω = {123, 132, 213, 231, 312, 321} P(213) = P(231) = 1/6 T = {213, 231} P(T) = P(213) + P(231) = 1/6 + 1/6 = 1/3

2.3 – Probability  If two sets are not disjoint, we must use following rule to determine probability: P(A ∪ B) = P(A) + P(B) − P(A ∩ B)  Example: Ω = {123, 132, 213, 231, 312, 321} P(213) = P(231) = P(123) =1/6 S = {123, 213} T = {213, 231} S ∩ T = {213} P(S ∪ T) = [P(123) + P(213)] + [P(213) + P(231)] - P(213) = [1/3] + [1/3] – 1/6 = 1/2

2.3 – Probability  By setting A ∪ A c = Ω to P(A ∪ B) = P(A) + P(B) − P(A ∩ B) We obtain 1 = P( Ω )= P( A ) + P( A c ). Therefore, 1 = P( A ) + P( A c ). Further, we have another important rule for the probability of the complement event: P( A c ) = 1 - P( A )

An experiment has only two outcomes. The first has probability p to occur, the second probability p 2. What is p?

A new computer virus can enter the system through or through the internet. There is a 30% chance of receiving this virus through . There is a 40% chance of receiving it through the internet. Also, the virus enters the system simultaneously through and the internet with probability What is the probability that the virus does not enter the system at all? (Baron 2.3)

2.4 – Products of sample spaces  Usually, one experiment is not sufficient, so an experiment is performed several times.  To get a sample space of multiple experiments, we use the cross product.  Example: Ω = Ω 1 × Ω 2 = {(ω 1, ω 2 ) : ω 1 ∈ Ω 1, ω 2 ∈ Ω 2 } where Ω 1 is the sample space of the first experiment and Ω 2 is the sample space of the second experiment.  Example: If we flip a coin twice the sample space would be: Ω = {H, T}× {H, T} = {(H,H), (H, T), (T,H), (T,T)}.

2.4 – Products of sample spaces  A certain experiment may have 2 outcomes: success or failure. If we perform this experiment n times and let 0 represent failure and 1 represent success, we have the following sample space: Ω = Ω 1 × Ω 2 × … × Ω n Where Ω 1 = Ω 2 = … = Ω n = {1, 0}

2.4 – Products of sample spaces  Example: If Tim goes on 5 dates and the date is either “successful” or “unsuccessful,” we can model the event where Tim is only successful on 1 of his 5 dates as: A = {(0, 0, 0, 0, 1), (0, 0, 0, 1, 0), (0, 0, 1, 0, 0), (0, 1, 0, 0, 0), (1, 0, 0, 0, 0)}  Assuming Tim’s chance of being “successful” is p and each date’s chance of success is independent of the previous date: P(A) = 5 (1 − p) 4 p 1 Because: (1 – p) is the probability of being unsuccessful and this must happen 4 times. p is probability of being successful and this must happen 1 time. There are 5 outcomes in the event A.

 What is the probability of the event B “exactly two experiments were successful”?

2.5 – An infinite sample space  A probability function on an infinite (or finite) sample space Ω assigns to each event A in Ω a number P(A) in [0, 1] such that (i) P(Ω) = 1, and (ii) P(A 1 ∪ A 2 ∪ A 3 ∪ ・・・ ) = P(A 1 ) + P(A 2 ) + P(A 3 ) + ・・・, where A 1,A 2,A 3,... are disjoint events.

2.5 – An infinite sample space  Example: If we flip a coin until it lands on heads, the outcome of the experiment could be the number of times the coin needed to be flipped until heads came up. The sample space for this experiment would be: Ω = {1, 2, 3,... } If the chance of landing on heads is p, the chance of landing on tails is 1-p. Therefore: P(1) = p. P(2) = (1 – p) 1 p. P(3) = (1-p) 2 p P(n) = (1-p) n-1 p, e.g.,  P(3) = (1-p) 2 p, since we have (0, 0, 1).

 Suppose an experiment in a laboratory is repeated every day of the week until it is successful, the probability of success being p. The first experiment is started on a Monday. What is the probability that the series ends on the next Sunday?