Polya, inverse Polya, and circular Polya distributions of order k for l-overlapping success runs

被引:24
作者
Makri, Frosso S. [1 ]
Philippou, Andreas N.
Psillakis, Zaharias M.
机构
[1] Univ Patras, Dept Math, Patras 26500, Greece
[2] Univ Patras, Dept Phys, Patras 26500, Greece
关键词
binomial; circular; distributions of order k; inverse Polya; l-overlapping; negative binomial; non overlapping; overlapping; Polya; success runs;
D O I
10.1080/03610920601033942
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
The Polya-Eggenberger sampling scheme is considered, i.e., a ball is drawn at random from an urn containing w white (success) balls and b black (failure) balls, its color is observed, and then it is returned to the urn along with s additional balls of the same color of the ball drawn. This scheme is repeated n times, and N-n,N-k,N-l,N-s denotes the number of l-overlapping success runs of length k. If the balls drawn are arranged on a circle, the number of I-overlapping success runs of length k is denoted by N-n,k,l,s(c).. Finally, W-r,W-k,W-l,W-s denotes the number of drawings according to the Polya-Eggenberger sampling scheme until the rth occurrence of the l-overlapping success run of length k. Polya, inverse Polya, and circular Polya distributions of order k for l-overlapping success runs of length k are introduced as the distributions, respectively, of N-n,N-k,N-l,N-s, W-r,W-k,W-l,W-s, and N-n,k,l,s(c). These distributions include as special cases known and new distributions of order k. Exact formulae are derived for their probability distribution functions and means, which generalize several results on well-known distributions of order k. Asymptotic results of the new distributions are also given, relating them, respectively, to the binomial, negative binomial, and circular binomial distributions of order k for l-overlapping success runs of length k.
引用
收藏
页码:657 / 668
页数:12
相关论文
共 21 条
[1]   Numbers of success-runs of specified length until certain stopping time rules and generalized binomial distributions of order k [J].
Aki, S ;
Hirano, K .
ANNALS OF THE INSTITUTE OF STATISTICAL MATHEMATICS, 2000, 52 (04) :767-777
[2]  
[Anonymous], 1964, INTRO COMBINATORIAL
[3]   Waiting times and number of appearances of runs: A unified approach [J].
Antzoulakos, DL .
COMMUNICATIONS IN STATISTICS-THEORY AND METHODS, 2003, 32 (07) :1289-1315
[4]  
BALAKRISHNANA N, 2002, RUNS SCANS APPL
[5]  
Charalambides C. A., 1994, RUNS PATTERNS PROBAB, P15
[6]  
Freund JE, 1956, AM MATH MON, V63, P20
[7]   THE EXACT AND ASYMPTOTIC-DISTRIBUTION OF OVERLAPPING SUCCESS RUNS [J].
GODBOLE, AP .
COMMUNICATIONS IN STATISTICS-THEORY AND METHODS, 1992, 21 (04) :953-967
[8]   ON HYPERGEOMETRIC AND RELATED DISTRIBUTIONS OF ORDER-K [J].
GODBOLE, AP .
COMMUNICATIONS IN STATISTICS-THEORY AND METHODS, 1990, 19 (04) :1291-1301
[9]   SPECIFIC FORMULAS FOR SOME SUCCESS RUN DISTRIBUTIONS [J].
GODBOLE, AP .
STATISTICS & PROBABILITY LETTERS, 1990, 10 (02) :119-124
[10]   A unified approach to binomial-type distributions of order K [J].
Han, S ;
Aki, S .
COMMUNICATIONS IN STATISTICS-THEORY AND METHODS, 2000, 29 (08) :1929-1943