The matching, birthday and the strong birthday problem: a contemporary review
type: Item
instance of: scholarly article
title: The matching, birthday and the strong birthday problem: a contemporary review
zbMATH Open document ID: 1089.60502
author: Anirban DasGupta
published in: Journal of Statistical Planning and Inference
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 60C05
Mathematics Subject Classification ID: 60E05
zbMATH DE Number: 2136322
zbMATH Keywords: Coincidences
zbMATH Keywords: Matching problem
zbMATH Keywords: Poisson
zbMATH Keywords: Random permutation
Wikidata QID: Q122167010
MaRDI profile type: Publication
full work available at URL: j.jspi.2003.11.015
OpenAlex ID: W2055634358
cites work: More Birthday Surprises
cites work: Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
cites work: Two moments suffice for Poisson approximations: The Chen-Stein method
cites work: Poisson approximation and the Chen-Stein method. With comments and a rejoinder by the authors
cites work: On the distribution of the length of the longest increasing subsequence of random permutations
cites work: Q4002919
cites work: Limit distributions and random trees derived from the birthday problem with unequal probabilities
cites work: Q3580372
cites work: Q5512461
cites work: Q5645369
cites work: Q3915689
cites work: A variational problem for random Young tableaux
cites work: Q4000424
cites work: Q4845263
cites work: Q5691080
cites work: Concentration of measure and isoperimetric inequalities in product spaces
cites work: Q5184913
cites work: Level-spacing distributions and the Airy kernel
cites work: Q4192066
DOI: 10.1016/J.JSPI.2003.11.015
description: scientific article; zbMATH DE number 2136322