The matching, birthday and the strong birthday problem: a contemporary review

@article{Dasgupta2005TheMB,
  title={The matching, birthday and the strong birthday problem: a contemporary review},
  author={A. Dasgupta},
  journal={Journal of Statistical Planning and Inference},
  year={2005},
  volume={130},
  pages={377-389}
}
  • A. Dasgupta
  • Published 2005
  • Mathematics
  • Journal of Statistical Planning and Inference
  • This article provides a contemporary exposition at a moderately quantitative level of the distribution theory associated with the matching and the birthday problems. A large number of examples, many not well known, are provided to help a reader have a feeling for these questions at an intuitive level. 

    Tables from this paper.

    The strong birthday problem
    • 1
    Methods for Studying Generalized Birthday and Coupon Collection Problems
    • 6
    A non-uniform birthday problem with applications to discrete logarithms
    • 21
    • PDF
    Simple Approximation Formulas for the Birthday Problem
    • 3
    Fundamentals of Probability: A First Course
    • Anirban DasGupta
    • Mathematics
    • 2010
    • 23
    • PDF
    The Birthday and Matching Problems
    • Anirban DasGupta
    • Philosophy
    • 2010
    • 1
    Counting birthday collisions using partitions.
    Asymptotics of high-dimensional contingency tables with fixed marginals

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 33 REFERENCES
    Extensions of the birthday surprise
    • 74
    Limit Distributions and Random Trees Derived from the Birthday Problem with Unequal Probabilities
    • 80
    • PDF
    Problems and Snapshots from the World of Probability
    • 104
    • PDF
    Methods for studying coincidences
    • 205
    • PDF
    Natural sorting over permutation spaces
    • 69
    • PDF
    Problems in combinatorics and graph theory
    • 44