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

Journal of Statistical Planning and Inference

Volumn 130, Issue 1-2, 2005, Pages 377-389

  DasGupta, Anirban ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

Birthday problem; Coincidences; Matching problem; Poisson; Random permutation; Strong birthday problem

Indexed keywords

EID: 11244285396     PISSN: 03783758     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jspi.2003.11.015     Document Type: Article

References (27)

1. M. Abramson W. Moser More birthday surprises Amer. Math. Monthly 7 7 1970 856-858
2. D. Aldous P. Diaconis Longest increasing subsequences: From patience sorting to the Baik-Deift-Johansson theorem Bull. Amer. Math. Soc. 36 4 1999 413-432
3. R. Arratia L. Goldstein L. Gordon Two moments suffice for the Poisson approximation: The Chen-Stein method Ann. Probab. 17 1 1989 9-25
4. R. Arratia L. Goldstein L. Gordon Poisson approximation and the Chen-Stein method Statist. Sci. 5 1990 403-434
5. R.M. Baer P. Brock Natural sorting over permutation spaces Math. Comput. 22 1968 385-410
6. J. Baik P. Deift K. Johansson On the distribution of the length of the longest increasing subsequence of random permutations J. Amer. Math. Soc. 1 2 1999 1119-1178
7. A.D. Barbour L. Holst S. Janson Poisson Approximation 1992 Clarendon Press Oxford University Press, New York
8. G. Blom L. Holst D. Sandell Problems and Snapshots from the World of Probability 1991 Springer New York
9. M. Camarri J. Pitman Limit distributions and random trees derived from the birthday problem with unequal probabilities. Electron J. Probab. 5 2000 1-18
10. DasGupta, A., 1999. The matching problem with random decks and the Poisson approximation. Technical report, Purdue University.
11. DasGupta, A., 2001. Strong birthday problems and look-alikes. Preprint, Purdue University.
12. P. Diaconis F. Mosteller Methods for studying coincidences J. Amer. Statist. Assoc. 8 4 1989 408, 853-861
13. P. Diaconis S. Holmes A Bayesian peek at Feller, vol. I Sankhýa, Ser. A, Special Issue in Memory of D. Basu 64 3(ii) 2002 820-841
14. P. Erdös G. Szekeres A combinatorial theorem in geometry Comput. Math. 2 1935 463-470
15. W. Feller An Introduction to Probability Theory and its Application, vol. I 1966 Wiley New York
16. Hammersley, J.M., 1972. A few seedlings of research. Proc. Sixth Berkeley Symposium on Mathematics Statistics, and Probability, vol. I, University of California Press, California, pp. 345-394.
17. M.S. Klamkin D.J. Newman Extensions of the birthday surprise J. Combin. Theory 3 1967 279-282
18. V.F. Kolchin B.A. Sevast'yanov V.P. Chistyakov Random Allocations 1978 Wiley New York
19. B.F. Logan L. Shepp A variational problem for random Young tableaux Adv. Math. 26 1977 206-222
20. C. Stein Approximate Computation of Expectations. IMS Monograph Series 1986 Hayward CA
21. J.M. Steele Variations on the long increasing subsequence theme of Erdös and Szekeres In: D. Aldous P. Diaconis J.M. Steele (Eds.), Discr. Prob. and Algorithms 1995 Springer New York
22. J.M. Steele Probability Theory and Combinatorial Optimization 1997 SIAM Philadelphia
23. M. Talagrand Concentration of measure and isoperimetric inequalities in product spaces Publ. Math. IHES 81 1995 73-205
24. I. Tomescu Problems in Combinatorics and Graph Theory 1985 Wiley New York
25. C.A. Tracy H. Widom Level-spacing distributions and the Airy kernel Comm. Math. Phys. 159 1994 151-174
26. S. Ulam Monte Carlo calculations in problems of mathematical Physics In: E.F. Beckenbach (Eds.), Modern Mathematics for Engineers 1961 McGraw-Hill New York
27. A.M. Versik S. Kerov Asymptotics of the Plancherel measure of the symmetric group and the limiting form of Young tables Soviet Math. Dokl. 18 1977 527-531