Calculating Expected Collisions: Probability Question on Keys and Boxes

  • Thread starter Thread starter economist13
  • Start date Start date
  • Tags Tags
    Probability
AI Thread Summary
The discussion centers on calculating the expected number of collisions when placing r keys into k boxes, where each key has a specific probability of being placed in a given box. The initial approach involves using the expected value of keys in each box but leads to an incorrect conclusion of negative collisions when more boxes than keys are present. A suggestion is made to utilize an indicator function to better model the situation. The proposed method involves determining the expected value of Y, defined as the maximum of X-1 and 0, to accurately reflect the number of collisions. Overall, the focus is on refining the approach to correctly calculate expected collisions using probability theory.
economist13
Messages
13
Reaction score
0
A total of r keys are to be put one at a time, in k boxes, with each key
independently being put in box i with probability pi ,
∑pi = 1. Each time a key is put in a nonempty box, we say that a collision occurs. Find
the expected number of collisions.

My professor hinted that we should use an indicator function, but I went about it a different way...(which I know to be wrong)

let X be the number of keys put into box i,

then E[X] = rpi. Since any key after key 1 will result in a collision, the rpi - 1 represents the expected number of collision for box i. then ∑(rpi -1) for all i and we get then that the total expected number of collisions is r-k.

Now, I know that cannot be correct, simply by thinking of the case where we have more boxes than keys (we cannot have negative collisions)

any hints?? what indicator function should I focus on?
 
Physics news on Phys.org
economist13 said:
let X be the number of keys put into box i

one way is to determine E[Y] where Y=max(X-1,0)
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top