The general birthday problem

DOI10.1002/rsa.3240060207zbMath0819.60008OpenAlexW2160424485WikidataQ123316903 ScholiaQ123316903MaRDI QIDQ4697810

Lars Holst

Publication date: 21 August 1995

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240060207

zbMATH Keywords

Poisson processSchur convexitygeneral birthday problem

Mathematics Subject Classification ID

Combinatorial probability (60C05)

Related Items (9)

Some bounds on the coupon collector problem ⋮ Fragment Length Distributions and Collision Probabilities for AFLP Markers ⋮ Card guessing and the birthday problem for sampling without replacement ⋮ The Move-to-Front Rule: A Case Study for two Perfect Sampling Algorithms ⋮ Asymptotic distribution for the birthday problem with multiple coincidences, via an embedding of the collision process ⋮ Games of chance with multiple objectives ⋮ A Poisson limit law for a generalized birthday problem ⋮ On a game of chance in Marc Elsberg's thriller ``GREED ⋮ On the number of overflown urns and excess balls in an allocation model with limited urn capacity

Cites Work

• A representation for multinomial cumulative distribution functions
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• Approximations to the birthday problem with unequal occurrence probabilities and their application to the surname problem in Japan
• On Ramanujan's \(Q\)-function
• On Birthday, Collectors', Occupancy and Other Classical Urn Problems
• Birthday Problem with Unlike Probabilities
• Inequalities: theory of majorization and its applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The general birthday problem