The analysis of singletons in generalized birthday problems

Authors
Publication date 2012
Journal Probability in the Engineering and Informational Sciences
Volume | Issue number 26 | 2
Pages (from-to) 245-262
Organisations
  • Faculty of Science (FNWI) - Informatics Institute (IVI)
Abstract
This paper describes techniques to characterize the number of singletons in the setting of the generalized birthday problem, that is, the birthday problem in which the birthdays are non-uniformly distributed over the year. Approximations for the mean and variance presented which explicitly indicate the impact of the heterogeneity (expressed in terms of the Kullback-Leibler distance with respect to the homogeneous distribution). Then an iterative scheme is presented for determining the distribution of the number of singletons. The approximations are validated by experiments with demographic data.
Document type Article
Language English
Published at https://doi.org/10.1017/S0269964811000350
Permalink to this page
Back