Timeline for Balls and bins variation
Current License: CC BY-SA 3.0
5 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Dec 13, 2012 at 13:03 | comment | added | Aaron Meyerowitz | Fixed the $m,n$ switch. I like the explanation. | |
Dec 13, 2012 at 12:58 | history | edited | Aaron Meyerowitz | CC BY-SA 3.0 |
added 23 characters in body
|
Dec 13, 2012 at 7:35 | comment | added | Douglas Zare | By the way, you switched from $m$ bins to $n$ bins. | |
Dec 13, 2012 at 7:32 | comment | added | Douglas Zare | If $n=3$, and $m$ is not a multiple of $3$, then the pairwise equality events, that bin $i$ has the same count as bin $j$, are disjoint. When $m$ is a multiple of $3$ it is possible for all bins to have the same count. That effect looks like it is about the right magnitude to explain why it is easier to have all $3$ counts distinct if $m$ is divisible by $3$ -- the pairwise events are about the same probability but because they can overlap, the probability of the union is smaller. | |
Dec 13, 2012 at 3:39 | history | answered | Aaron Meyerowitz | CC BY-SA 3.0 |