A generalization of the Birthday problem and the chromatic polynomial
read the original abstract
The birthday paradox states that there is at least a 50% chance that some two out of twenty-three randomly chosen people will share the same birth date. The calculation for this problem assumes that all birth dates are equally likely. We consider the following two modifications of this question. If the distribution of birthdays is non-uniform, does that increase or decrease the probability of matching birth dates? Further, what if we focus on birthdays shared by some particular pairs rather than any two people. Does a non-uniform distribution on birth dates increase or decrease the probability of a matching pair? In this paper we present our results in this generalized setting. We use some results and methods due to Sokal concerning bounds on the roots of chromatic polynomials to prove our results.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Counting birthday collisions using partitions
Gives partition-based formulae for counting s-collisions and related events in the birthday problem.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.