Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Assume that we have $n$ bins(indistinguishable and numbered from $1$ to $n$). We pick a bin and add a ball to it subject to the constraint that each bin can have no more than $n$ balls.

If we know that after iterating this process for a while, there is a total of $m$ ball in the bins, then can we say something about the probability that for example the first bin contains $m_1$ balls, the second $m_2$ and etc? in other words: $\text{Pr} [(m_1,m_2,\cdots,m_n)]$.

Thank you!

share|cite|improve this question
This problem looks quite tough, I was wondering where did you find it? – Lord Soth Jul 5 '13 at 22:50
This is what I came up while solving another problem in randomized gossip algorithms and need to have the answer or some bounds for the above probability to solve the original problem. – shirin Jul 5 '13 at 22:54

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.