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

DOI10.1016/j.jspi.2003.11.015zbMath1089.60502OpenAlexW2055634358WikidataQ122167010 ScholiaQ122167010MaRDI QIDQ1763461

Anirban DasGupta

Publication date: 22 February 2005

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jspi.2003.11.015

zbMATH Keywords

PoissonRandom permutationCoincidencesMatching problem

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Combinatorial probability (60C05)

Related Items (15)

A Bayesian analysis of the matching problem ⋮ Asymptotics of multivariate contingency tables with fixed marginals ⋮ A factorial Moment Distance and an Application to the Matching Problem ⋮ A fourth‐moment phenomenon for asymptotic normality of monochromatic subgraphs ⋮ Normal approximation and fourth moment theorems for monochromatic triangles ⋮ Birth, death, coincidences and occupancies: solutions and applications of generalized birthday and occupancy problems ⋮ A generalised matching distribution for the problem of coincidences ⋮ A non-uniform birthday problem with applications to discrete logarithms ⋮ Asymptotic distribution of Bernoulli quadratic forms ⋮ Methods for Studying Generalized Birthday and Coupon Collection Problems ⋮ Limit theorems for monochromatic stars ⋮ Multinomial goodness-of-fit based on \(U\)-statistics: high-dimensional asymptotic and minimax optimality ⋮ The Second-Moment Phenomenon for Monochromatic Subgraphs ⋮ Non-uniform birthday problem revisited: refined analysis and applications to discrete logarithms ⋮ Monochromatic subgraphs in randomly colored graphons

Cites Work

• Two moments suffice for Poisson approximations: The Chen-Stein method
• A variational problem for random Young tableaux
• Level-spacing distributions and the Airy kernel
• Poisson approximation and the Chen-Stein method. With comments and a rejoinder by the authors
• Concentration of measure and isoperimetric inequalities in product spaces
• Limit distributions and random trees derived from the birthday problem with unequal probabilities
• More Birthday Surprises
• On the distribution of the length of the longest increasing subsequence of random permutations
• Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The matching, birthday and the strong birthday problem: a contemporary review