The birthday problem
By M. Borja, John Haigh. 2007
103 citations recorded by the source corpus.
Happy Birthday! If it is not your birthday today, it may well be the birthday of someone in your office, or in your class at school. Possibly, it is the birthday of two people in your office or your class. Just how big does a group have to be before its members are likely to share a birthday? Mario Cortina Borja and John Haigh explain the birthday problem.
Subfields: Discrete Mathematics and Combinatorics, Mathematical Physics, Statistics and Probability
View Paper: https://www.semanticscholar.org/paper/9774923b4ae0c85ff59f8183ee7d06837e5967e1
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Discrete Mathematics and Combinatorics
In Mathematical Physics
- Liam Paninski
- Jayadev Acharya
- Gregory Valiant
- Paul Valiant
- Clément Louis Canonne
- Himanshu Tyagi
- Oded Goldreich
- Larry A. Wasserman
In Statistics and Probability
- Liam Paninski
- Jayadev Acharya
- Clément Louis Canonne
- Himanshu Tyagi
- Oded Goldreich
- Sivaraman Balakrishnan
- Larry A. Wasserman
- Ziteng Sun
Citations in the corpus
- A Coincidence-Based Test for Uniformity Given Very Sparsely Sampled Discrete Data (2008, methodology): “If N2ǫ4 < m log 5, then no test reliably distinguishesH0 from HA; more precisely, for any test with critical regionB and size bounded away from one, the minimum power inf p∈HA Z B p(x)dx remains bounded away from one.”