Discrete Probability & Distributions Comprehensive Study Guide
Units 2A & 2B: Discrete Probability Notes
Introduction to Discrete Probability
Three Branches of Probability and Statistics:
Descriptive Statistics
Inferential Statistics
Probability
Definition of Probability: Probability is used to draw conclusions about the likelihood that an arbitrary sample will have certain characteristics given information about a known population it is drawn from. It assigns a numerical value from to inclusive to an event to measure the degree of uncertainty.
Key Characteristics:
Works from a known population or historical data.
Direction: Population (\rightarrow) Sample (Inverse of Inferential Statistics).
Scale: The closer the probability is to , the more likely the event is to occur; the closer to , the less likely.
Forms: Decimal, Fraction, Percentage, or Ratio.
Basic Probability Concepts
Probability Experiment: A process or activity that has a measurable outcome each time it is repeated. The outcome might vary from trial to trial and is typically unknown in advance.
Trial: Performing the experiment one time.
Simple Event: The most basic individual outcome of an experiment.
Sample Space (): The set of all possible simple events.
Event: A subset of the sample space.
Power Set (): The set of all possible events (all subsets of the sample space). The number of events in a sample space with simple events is .
Probability Function Definition: A function that assigns probabilities subject to:
for every event .
(Guaranteed/Certain event).
(Impossible event).
Addition Rule: .
Computing Probability with Finite Sample Space:
(Size of event divided by size of sample space).
This is equivalent to the population relative frequency.
Unions and Intersections
Intersection (AND): Corresponds to symbols . The event occurs only if both A and B occur.
.
Union (OR): Corresponds to symbols . Inclusive OR: occurs if A occurs, B occurs, or both occur.
.
Mutually Exclusive Events: Events that cannot occur at the same time.
.
.
Addition Rule for excluding events: .
Partition: A set of events forms a partition of sample space if they are pairwise mutually exclusive and their union equals . The sum of probabilities of a partition is always .
Complementary Events: The complement of A ( or ) is the event that A does not occur.
.
.
Odds and Probabilities
Probability vs. Odds: Probability is a part-to-whole relationship (). Odds is a part-to-part ratio.
Odds Against A: Ratio of failures to successes, denoted .
Odds For A: Ratio of successes to failures, denoted .
Conversion Formulas:
If odds against are , then .
If , then odds against are .
Gaming context: Payoff "odds" in gambling are usually a payoff ratio, not actual mathematical odds. In a fair game, payoff odds equal actual odds against. Casinos maintain a "house advantage."
Empirical Probability and Law of Large Numbers
Empirical (Experimental) Probability: The sample relative frequency of an event.
Simulation (Monte Carlo Methods): Using experiments to find empirical probabilities.
Law of Large Numbers: As the number of trials increases, the experimental relative frequency becomes more likely to be close to the actual theoretical probability.
Fallacy Check: The "Law of Averages" is erroneous; independent trials (like coin flips) are not "due" for a specific result based on previous outcomes.
Conditional Probability
Definition: The likelihood of event A occurring given that event B has already occurred.
.
Finite Sample Space Calculation: .
Multiplication Rule: .
Tables: Cross-tabulation (contingency) tables show marginal probabilities on the outer edges and joint probabilities in the internal cells.
Discrete Random Variables and PDF/CDF
Random Variable (): A function that assigns a unique number to each outcome in a sample space.
Probability Density Function (PDF):
Maps values to .
.
.
Cumulative Density Function (CDF):
Gives accumulated probability up to a value.
.
Graph is a step function (broken line graph).
Parameters:
Mean (Expected Value, ): .
Variance (): .
Standard Deviation (): .
Skewness: . Measures deviations from symmetry.
Transformations:
Adding constant : ; remains unchanged.
Multiplying by constant : ; .
Adding independent variables: ; .
Multistage Probability and Trees
Probability Trees: Used to visualize multiple stages.
Root vertex starts the tree.
Edges from a vertex must sum to .
First stage edges are basic probabilities; subsequent edges are conditional.
Multiply probabilities along a path to find the probability of the intersection (joint probability).
Monty Hall Problem: A counterintuitive result where switching doors doubles the winning probability from to because the host's knowledge changes the conditional probability of the remaining door.
Independent Events
Definition: Two events are independent if the occurrence of one does not affect the probability of the other.
Conditions (Equivalent):
Note: Mutually exclusive events are not independent (if they are mutually exclusive, knowing B happened tells you A cannot happen).
Bayesian Techniques
Core Concept: Comparing two related trees (reversing the condition). One tree starts with partition and leads to ; the other starts with and leads to .
Bayes' Theorem: Allows finding given and .
Formula: .
Combinatorics (Counting Techniques)
Factorial (): Number of ways to order distinct objects. . Note: .
Power Rule: Choosing from with replacement (repeats allowed), order matters: .
Permutations (): Choosing from without replacement, order matters: .
Combinations (): Choosing from without replacement, order does not matter: .
Pascal's Triangle: Illustrates the recursive property .
Indistinguishable Objects: Arranging objects where there are types (): .
Stars and Bars (Extension): Choosing from with replacement, order does not matter: .
Named Families of Discrete Distributions
Discrete Uniform: All outcomes are equally likely ().
Bernoulli: Single trial with two outcomes: success () and failure ().
.
Geometric: Number of independent Bernoulli trials () until the first success.
.
.
Binomial: Number of successes in independent Bernoulli trials ().
.
.
Hypergeometric: Successes in a sample () from a finite population () with a specific number of successes (), without replacement.
.
, where .
(Finite Population Correction Factor).
Poisson: Number of occurrences over a fixed interval (time/space).
.
.