ผลต่างระหว่างรุ่นของ "Probstat/notes/balls and bins"
Jittat (คุย | มีส่วนร่วม) |
Jittat (คุย | มีส่วนร่วม) |
||
แถว 12: | แถว 12: | ||
== Number of empty bins == | == Number of empty bins == | ||
+ | Let random variable ''X'' be the number of empty bins. | ||
+ | |||
+ | '''Question 1:''' ''What is P{ X'' = 0 }?'' | ||
+ | |||
+ | If there is no empty bin, every ball must land into different bin. In this case, the first ball has n choices, the second ball has n-1 choices, and in general the ''i''-th ball has ''n - i +1'' choices. Therefore, there are <math>n\cdot (n-1)\cdot(n-2)\cdots(2)(1) = n!</math> outcomes. The probability is <math>\frac{n!}{n^n}</math>. | ||
+ | |||
+ | It will be very hard to compute E[''X''] directly. | ||
== Fullest bins == | == Fullest bins == |
รุ่นแก้ไขเมื่อ 03:39, 18 กันยายน 2557
- This is part of probstat. The materials on this part is from this course at Berkeley.
We consider a balls-and-bins experiment where we throw n balls independently into n bins uniformly at random.
Question 1: How many possible outcomes are there?
Since each ball has n choices and their choices are independent, there are outcomes.
Question 2: What is the probability that bin 1 is empty?
In this case, each ball only have n - 1 choices (because they have to avoid bin 1); therefore there are outcomes where bin 1 is empty. Since each outcome is equally likely, the probability that bin 1 is empty is .
Number of empty bins
Let random variable X be the number of empty bins.
Question 1: What is P{ X = 0 }?
If there is no empty bin, every ball must land into different bin. In this case, the first ball has n choices, the second ball has n-1 choices, and in general the i-th ball has n - i +1 choices. Therefore, there are outcomes. The probability is .
It will be very hard to compute E[X] directly.