2.7.1 Geometric Flashcards

1
Q

What is a geometric distribution?

A

A discrete probability distribution that models the number of independent Bernoulli trials needed to get the first success.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What are the key assumptions of a geometric distribution?

A
  1. Each trial has only two outcomes (success or failure).
  2. The probability of success stays the same for every trial.
  3. The trials are independent.
  4. The process continues until the first success occurs.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

How do we denote that a random variable ( X ) follows a geometric distribution?

A

( X sim ext{Geometric}(p) ), where ( p ) is the probability of success on each trial.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is the probability that the first success happens on the ( k )-th trial?

A

P(X = k) = (1 - p)^{k - 1} p
This means that the first ( k - 1 ) trials must all be failures, followed by a success.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

How does the geometric distribution differ from the binomial distribution?

A
  • The binomial distribution models the number of successes in a fixed number of trials.
  • The geometric distribution models the number of trials until the first success.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is the probability that the first success happens after ( k ) trials?

A

P(X > k) = (1 - p)^k

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is the expected number of trials until the first success?

A

E[X] = rac{1}{p}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is the variance of a geometric distribution?

A

ext{Var}(X) = rac{1 - p}{p^2}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What does the memoryless property of the geometric distribution state?

A

The probability of success does not depend on past failures.
Mathematically, for any ( k ) and ( n ):
P(X > k + n mid X > k) = P(X > n)
This means that past failures do not change future probabilities.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Example: A fair coin is flipped repeatedly until heads appears. What is the expected number of flips needed?

A

Since ( p = 0.5 ):
E[X] = rac{1}{0.5} = 2

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Example: You roll a fair die until you get a 6. What is the probability that you roll at least 5 times?

A

Since ( p = 1/6 ):
P(X geq 5) = (1 - 1/6)^4 = (5/6)^4 = 0.482

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What is an alternative way to define a geometric random variable?

A

Instead of counting the total trials until the first success, we can count the failures before the first success.
This version follows:
Y sim ext{Geometric}(p)
where ( Y = X - 1 ).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

How do the PMF, mean, and variance change in this alternative definition?

A
  • PMF: ( P(Y = k) = (1 - p)^k p ) (starts at ( k = 0 ) instead of ( k = 1 )).
  • Mean: ( E[Y] = rac{1 - p}{p} ).
  • Variance: ( ext{Var}(Y) = rac{1 - p}{p^2} ) (same as original version).
How well did you know this?
1
Not at all
2
3
4
5
Perfectly