Advertisement

The Birthday and Matching Problems

  • Anirban DasGuptaEmail author
Chapter
Part of the Springer Texts in Statistics book series (STS)

Abstract

In this chapter, we offer a glimpse into some problems that have earned the status of being classics in counting and combinatorial probability. They have an entertainment value, and they also present some surprises in their solutions and the final answers. The problems we present are generally known as the birthday problem and the matching problem. For greater exposure to the material in this chapter, we recommend Feller, W. (1968), Diaconis and Holmes (2002), Blom et al. (1994), DasGupta (2005), Mckinney (1966), Abramson and Moser (1970), Diaconis and Mosteller (1989), Barbour and Hall(1984), Barbour et al. (1992), Gani (2004), Ivchenko and Medvedev (1997), Johnson and Kotz (1977), and Karlin and McGregor (1965).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abramson, M. and Moser, W. (1970). More birthday surprises, Am. Math. Mon., 77, 856–858.zbMATHCrossRefMathSciNetGoogle Scholar
  2. Barbour, A. and Hall, P. (1984). On the rate of Poisson convergence, Math. Proc. Cambridge Philos. Soc., 95, 473–480.zbMATHCrossRefMathSciNetGoogle Scholar
  3. Barbour, A., Holst, L., and Janson, S. (1992). Poisson Approximation, Clarendon Press, New York.zbMATHGoogle Scholar
  4. Blom, G., Holst, L., and Sandell, D. (1994). Problems and Snapshots from the World of Probability, Springer, New York.zbMATHGoogle Scholar
  5. DasGupta, A. (2005). The matching, birthday, and the strong birthday problems: A contemporary review, J. Statist. Planning Inference, 130, 377–389.zbMATHCrossRefGoogle Scholar
  6. Diaconis, P. and Holmes, S. (2002). A Bayesian peek at Feller Volume I, Sankhya, Special Issue in Memory of Dev Basu, A. DasGupta, ed., 64(3), Part 2, 820–841.MathSciNetGoogle Scholar
  7. Diaconis, P. and Mosteller, F. (1989). Methods for studying coincidences, J. Am. Statist. Assoc. 84(408), 853–861.CrossRefMathSciNetGoogle Scholar
  8. Feller, W. (1968). Introduction to Probability Theory and Its Applications, Wiley, New York.zbMATHGoogle Scholar
  9. Gani, J. (2004). Random allocation and urn models, J. Appl. Prob., 41A, 313–320.zbMATHCrossRefMathSciNetGoogle Scholar
  10. Ivchenko, G. and Medvedev, Yu. I. (1997). The contribution of the Russian mathematicians to the study of urn models, in Probabilistic Methods in Discrete Mathematics, V. Kolchin, V. Kozlov, Y. Pavlov, and Y. Prokhorov eds., 1–9, VSP, Utrecht.Google Scholar
  11. Johnson, N. and Kotz, S. (1977). Urn Models and Their Application, Wiley, New York.zbMATHGoogle Scholar
  12. Karlin, S. and McGregor, J. (1965). Ehrenfest urn models, J. Appl. Prob., 2, 352–376.zbMATHCrossRefMathSciNetGoogle Scholar
  13. Mckinney, E. (1966). Classroom notes; generalized birthday problem, Am. Math. Mon., 73(4), 385–387.CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag New York 2010

Authors and Affiliations

  1. 1.Dept. Statistics & MathematicsPurdue UniversityWest LafayetteUSA

Personalised recommendations