Probability Tree Simulator
Statistics & probability • 2026 edition
Probability Tree Formula:
Show the calculator\( P(A \cap B) = P(A) \times P(B|A) \)
Where:
- \( P(A \cap B) \) = Joint probability of A and B
- \( P(A) \) = Probability of event A
- \( P(B|A) \) = Conditional probability of B given A
Probability trees visualize sequential events and their conditional probabilities. Each branch represents an event with its probability, and paths through the tree represent sequences of events. The probability of reaching a specific outcome is the product of probabilities along the path.
Example: For two stages with P(A₁) = 0.6, P(A₂) = 0.4, P(B₁|A₁) = 0.7, P(B₂|A₁) = 0.3, P(B₁|A₂) = 0.2, P(B₂|A₂) = 0.8:
Path A₁→B₁: P(A₁) × P(B₁|A₁) = 0.6 × 0.7 = 0.42
Path A₁→B₂: P(A₁) × P(B₂|A₁) = 0.6 × 0.3 = 0.18
Path A₂→B₁: P(A₂) × P(B₁|A₂) = 0.4 × 0.2 = 0.08
Path A₂→B₂: P(A₂) × P(B₂|A₂) = 0.4 × 0.8 = 0.32
All paths sum to 0.42 + 0.18 + 0.08 + 0.32 = 1.00.
Input Parameters
Advanced Options
Results
Comprehensive Statistics Guide
A probability tree is a visual representation of a sequence of events where each branch represents a possible outcome and its associated probability. The tree structure allows for easy calculation of combined probabilities by multiplying along the branches. Each level of the tree represents a stage in the process, and the final nodes represent complete sequences of events.
Key principles for probability trees:
Probability trees naturally incorporate Bayes theorem for updating probabilities:
- Prior Probabilities: Initial probabilities at the root
- Likelihood: Conditional probabilities along branches
- Posterior Probabilities: Updated probabilities after observing outcomes
- Reversing Paths: Calculating P(A|B) from P(B|A)
- Multiplication Rule: Multiply probabilities along paths
- Addition Rule: Add probabilities of mutually exclusive paths
- Conditional Probabilities: Probabilities change based on prior events
- Verification: All final probabilities sum to 1
Statistics Fundamentals
Diagram showing sequential events and their conditional probabilities with multiplication along branches.
\( P(\text{Path}) = \prod P(\text{Events along path}) \)
Probability of path = product of all branch probabilities.
- Branches from each node sum to 1
- Multiply along paths
- Add across mutually exclusive outcomes
Applications
Used in decision analysis, medical diagnosis, quality control, and game theory.
- Identify decision stages
- List possible outcomes at each stage
- Assign probabilities to each outcome
- Calculate path probabilities
- Sum probabilities for desired outcomes
- Make decisions based on calculated probabilities
- Verify probability sums at each node
- Check for mutual exclusivity
- Consider all possible paths
- Update probabilities with new information
Statistics Learning Quiz
Which of the following statements about probability trees is CORRECT?
The answer is B) Probabilities are multiplied along each path. In probability trees, the probability of a complete path is calculated by multiplying the probabilities of each branch along that path. This represents the joint probability of all events in sequence occurring.
This is a fundamental principle of probability trees. When events occur sequentially, their joint probability is the product of their individual probabilities (assuming independence). For example, if the probability of event A is 0.6 and the probability of event B given A is 0.7, then P(A and B) = 0.6 × 0.7 = 0.42.
Joint Probability: Probability of two or more events occurring together
Conditional Probability: Probability of an event given that another event occurred
Sequential Events: Events that occur in a specific order
• Multiply probabilities along paths
• Add probabilities across mutually exclusive paths
• Branches from each node sum to 1
• Always verify that branches sum to 1
• Use parentheses to track multiplications
• Draw tree systematically from left to right
• Adding instead of multiplying along paths
• Forgetting to sum branches to 1
• Miscounting number of possible outcomes
Draw a probability tree for flipping a fair coin twice. What is the probability of getting exactly one head? Show your work.
First flip: P(Head) = 0.5, P(Tail) = 0.5
Second flip: P(Head) = 0.5, P(Tail) = 0.5 (for each branch)
Paths for exactly one head:
• Head → Tail: P = 0.5 × 0.5 = 0.25
• Tail → Head: P = 0.5 × 0.5 = 0.25
Total probability of exactly one head = 0.25 + 0.25 = 0.50
All possible outcomes: HH(0.25), HT(0.25), TH(0.25), TT(0.25) = 1.00 ✓
This demonstrates how probability trees systematically enumerate all possible outcomes. Each branch represents a possible event, and the path probabilities are calculated by multiplication. The total probability of mutually exclusive outcomes (like exactly one head) is found by addition.
Mutually Exclusive: Events that cannot occur simultaneously
Exhaustive: Set of events covers all possibilities
Independent Events: Occurrence of one doesn't affect the other
• All final probabilities sum to 1
• Multiply along paths
• Add across mutually exclusive outcomes
• Organize tree with consistent structure
• Check that all probabilities sum to 1
• Label all branches clearly
• Missing some possible outcomes
• Adding instead of multiplying along paths
• Not accounting for all ways to achieve outcome
A disease affects 1% of the population. A test for the disease is 95% accurate for positive results and 98% accurate for negative results. Draw a probability tree and find the probability that a person who tests positive actually has the disease.
Stage 1: Disease status
• P(Disease) = 0.01
• P(No Disease) = 0.99
Stage 2: Test results
Given Disease:
• P(Positive | Disease) = 0.95
• P(Negative | Disease) = 0.05
Given No Disease:
• P(Positive | No Disease) = 0.02
• P(Negative | No Disease) = 0.98
Paths for positive test:
• Disease → Positive: 0.01 × 0.95 = 0.0095
• No Disease → Positive: 0.99 × 0.02 = 0.0198
Total P(Positive) = 0.0095 + 0.0198 = 0.0293
P(Disease | Positive) = P(Disease and Positive) / P(Positive) = 0.0095 / 0.0293 = 0.324 or 32.4%
This classic example demonstrates Bayes theorem using a probability tree. Even with a highly accurate test, the probability of having the disease given a positive test result is surprisingly low because the disease prevalence is so low. This shows the importance of considering base rates in probability calculations.
Sensitivity: Probability of positive test given disease (true positive rate)
Specificity: Probability of negative test given no disease (true negative rate)
Prevalence: Proportion of population with condition
• Consider base rates in probability calculations
• Distinguish between P(A|B) and P(B|A)
• Verify all path probabilities sum to 1
• Use probability trees for complex conditional probability problems
• Always consider the base rate
• Check calculations with total probability law
• Confusing P(A|B) with P(B|A)
• Ignoring base rates
• Miscalculating conditional probabilities
A factory has two machines. Machine A produces 60% of items with 5% defect rate. Machine B produces 40% of items with 8% defect rate. An item is randomly selected and found to be defective. What's the probability it came from machine A? Use a probability tree to solve.
Stage 1: Machine selection
• P(Machine A) = 0.60
• P(Machine B) = 0.40
Stage 2: Defect status
Given Machine A:
• P(Defective | A) = 0.05
• P(Good | A) = 0.95
Given Machine B:
• P(Defective | B) = 0.08
• P(Good | B) = 0.92
Paths for defective item:
• A → Defective: 0.60 × 0.05 = 0.03
• B → Defective: 0.40 × 0.08 = 0.032
Total P(Defective) = 0.03 + 0.032 = 0.062
P(A | Defective) = P(A and Defective) / P(Defective) = 0.03 / 0.062 = 0.484 or 48.4%
This demonstrates how probability trees can be used for reverse probability calculations. Even though Machine A has a lower defect rate, it produces more items overall, so a defective item is almost equally likely to come from either machine. The probability tree makes it clear how to apply Bayes theorem.
Reverse Probability: Finding P(A|B) from P(B|A)
Law of Total Probability: P(B) = P(B|A)P(A) + P(B|¬A)P(¬A)
Bayes Theorem: P(A|B) = P(B|A)P(A) / P(B)
• Apply Bayes theorem for reverse probability
• Use law of total probability to find denominator
• Consider all contributing factors
• Use probability trees for multistage problems
• Always check that probabilities sum correctly
• Practice with different scenarios
• Forgetting to normalize by total probability
• Misapplying Bayes theorem
• Not considering all possible sources
Which of the following is TRUE about probability trees?
The answer is B) The sum of probabilities from each node equals 1. This is a fundamental property of probability trees. At each decision point (node), all possible outcomes must be accounted for, so their probabilities must sum to 1, representing all possibilities.
This is a crucial constraint in probability trees. From any given node, the branches represent all possible outcomes of that event, so their probabilities must sum to 1. This ensures that no possibilities are missed and that the probabilities are properly normalized. This property helps verify that the tree is constructed correctly.
Probability Space: Set of all possible outcomes with assigned probabilities
Normalization: Property that all probabilities sum to 1
Exhaustive Events: Events that cover all possible outcomes
• Branches from each node sum to 1
• All final outcomes sum to 1
• Each path represents a unique sequence of events
• Verify that branches sum to 1 at each node
• Use this property to check your work
• Ensure all possible outcomes are included
• Missing possible outcomes from nodes
• Probabilities not summing to 1 at nodes
• Double-counting overlapping events
FAQ
Q: How do probability trees relate to Bayes theorem?
A: Probability trees naturally illustrate Bayes theorem. The tree shows forward probabilities P(B|A), while Bayes theorem allows us to calculate reverse probabilities P(A|B):
\( P(A|B) = \frac{P(B|A) \times P(A)}{P(B)} \)
In the tree:
- P(A) = Prior probability (at the root)
- P(B|A) = Conditional probability (along branches)
- P(A|B) = Posterior probability (after observing B)
The tree structure makes it clear how to apply Bayes theorem by identifying the relevant paths and their probabilities.
Q: When should I use probability trees vs other methods?
A: Use probability trees when:
- You have sequential events with conditional probabilities
- There are multiple stages or decision points
- You need to visualize all possible outcomes
- Calculating joint probabilities of sequences
- Applying Bayes theorem with multiple conditioning events
For simpler problems with few events, direct calculation might be more efficient. For complex systems with many variables, consider simulation or Bayesian networks.