A Poisson limit law for a generalized birthday problem

被引:9
作者
Henze, N [1 ]
机构
[1] Univ Karlsruhe, Inst Math Stochast, D-76128 Karlsruhe, Germany
关键词
sequential occupancy problem; general birthday problem; coincidences; inclusion-exclusion principle;
D O I
10.1016/S0167-7152(98)00076-5
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
Balls are placed sequentially at random into n cells. Write T-n,c((m)) for the number of balls needed until for the mth time a ball is placed into a cell already containing c - 1 balls, where m greater than or equal to 1 and c greater than or equal to 2 are fixed integers. For fixed t > 0, let X-n,X-c denote the number of cells containing at least c balls after the placement of k(n) = [n(1-1/c) . t] balls. It is shown that, as n --> infinity, the limit distribution of X-n,X-c is Poisson with parameter t(c)/c! As a consequence, the limit law of n(1-c)(T-n,c((m)))(c)/c! is a Gamma distribution. (C) 1998 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:333 / 336
页数:4
相关论文
共 13 条
[1]  
[Anonymous], 1977, URN MODELS THEIR APP
[2]   METHODS FOR STUDYING COINCIDENCES [J].
DIACONIS, P ;
MOSTELLER, F .
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1989, 84 (408) :853-861
[3]  
DWASS M, 1969, J COMBIN THEORY, V0007, P00258
[4]  
Feller W., 1968, INTRO PROBABILITY TH
[5]   THE GENERAL BIRTHDAY PROBLEM [J].
HOLST, L .
RANDOM STRUCTURES & ALGORITHMS, 1995, 6 (2-3) :201-208
[7]   BIRTHDAY PROBLEM WITH UNLIKE PROBABILITIES [J].
JOAGDEV, K ;
PROSCHAN, F .
AMERICAN MATHEMATICAL MONTHLY, 1992, 99 (01) :10-12
[8]  
Johnson N.L., 1997, DISCRETE MULTIVARIAT
[9]  
Klamkin M.S., 1967, Journal of Combinatorial Theory, DOI [10.1016/S0021-9800(67)80075-9, DOI 10.1016/S0021-9800(67)80075-9]
[10]  
MASE S, 1992, ANN I STAT MATH, V44, P479