I have an extreme version of the birthday problem. I want to know:
- The probability that $m$ individuals will share a birthday
- The expected $m$ given the number of individuals
The slight complication is that:
- An individual can have multiple birthdays
- The number of "days" is almost infinite, meaning that each day has a very low probability
- The probability space isn't uniform, e.g. Jan 1 is slightly more probable than Jan 2.
This is an abstracted explanation of the problem in this paper (equations 3 and 4). If someone can please help me understand equations 3 and 4 that would be super helpful.
In particular, what is a generating function in the context of the paper? It's explained as...
$M_m$s are the coefficients of the polynomial $G(x,{N i})$, and can be calculated just by expanding the polynomial in $x$ and summing over $s$.
Throughout the manuscript the term $x$ isn't really discussed, so I don't know where it comes from all of a sudden. Also, what is it supposed to represent? The Github repo from this paper doesn't say anything either. Thanks in advance. If there's any suggestions on code implementation that would be also helpful!