THE GENERAL BIRTHDAY PROBLEM

被引：13
作者：
HOLST, L
机构：
[1] Department of Mathematics, Royal Institute of Technology, Stockholm
来源：
RANDOM STRUCTURES & ALGORITHMS | 1995年 / 6卷 / 2-3期
关键词：
D O I：
10.1002/rsa.3240060207
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
The general birthday problem with unlike birth probabilities and the waiting time N until c people with the same birthday have been obtained is studied in this article. It is shown that N is stochastically largest when the birth probabilities are equal. By embedding in Poisson processes it is shown how the moments of N can be expressed in moments of the minimum of gamma random variables. (C) 1995 John Wiley & Sons, Inc.
引用
收藏
页码：201 / 208
页数：8
相关论文
共 14 条
[1]  
[Anonymous], 1968, INTRO PROBABILITY TH
[2]  
[Anonymous], 1968, ART COMPUTER PROGRAM
[3]  
Blom G., 1991, MATH SCI, V16, P29
[4]   SIOBHAN PROBLEM - THE COUPON COLLECTOR REVISITED [J].
DAWKINS, B .
AMERICAN STATISTICIAN, 1991, 45 (01) :76-82
[5]   METHODS FOR STUDYING COINCIDENCES [J].
DIACONIS, P ;
MOSTELLER, F .
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1989, 84 (408) :853-861
[6]   BIRTHDAY PARADOX, COUPON COLLECTORS, CACHING ALGORITHMS AND SELF-ORGANIZING SEARCH [J].
FLAJOLET, P ;
GARDY, D ;
THIMONIER, L .
DISCRETE APPLIED MATHEMATICS, 1992, 39 (03) :207-229
[7]  
FLAJOLET P, 1993, INRIA1760 REP
[8]   ON BIRTHDAY, COLLECTORS, OCCUPANCY AND OTHER CLASSICAL URN PROBLEMS [J].
HOLST, L .
INTERNATIONAL STATISTICAL REVIEW, 1986, 54 (01) :15-27
[9]   BIRTHDAY PROBLEM WITH UNLIKE PROBABILITIES [J].
JOAGDEV, K ;
PROSCHAN, F .
AMERICAN MATHEMATICAL MONTHLY, 1992, 99 (01) :10-12
[10]   A REPRESENTATION FOR MULTINOMIAL CUMULATIVE DISTRIBUTION-FUNCTIONS [J].
LEVIN, B .
ANNALS OF STATISTICS, 1981, 9 (05) :1123-1126
12