YET ANOTHER APPLICATION OF A BINOMIAL RECURRENCE - ORDER-STATISTICS

被引：36

作者：

SZPANKOWSKI, W

REGO, V

机构：

[1] Department of Computer Sciences, Purdue University, West Lafayette, 47906, IN

来源：

COMPUTING | 1990年 / 43卷 / 04期

关键词：

asymptotic approximation; binomial recurrence; concurrency enhancement; geometric distribution; order statistics; program unification;

D O I：

10.1007/BF02241658

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We investigate the moments of the maximum of a set of i.i.d geometric random variables. Computationally, the exact formula for the moments (which does not seem to be available in the literature) is inhibited by the presence of an alternating sum. A recursive expression for the moments is shown to be superior. However, the recursion can be both computationally intensive as well as subject to large round-off error when the set of random variables is large, due to the presence of factorial terms. To get around this difficulty we develop accurate asymptotic expressions for the moments and verify our results numerically. © 1990 Springer-Verlag.

引用

页码：401 / 410

页数：10

共 9 条

[1] Abramowitz M., 1964, HDB MATH FUNCTIONS
[2] DAVID HA, 1981, ORDER STATISTICS
[3] Galambos J., 1987, ASYMPTOTIC THEORY EX, V2nd
[4] HENRICI P, 1975, APPLIED COMPUTATIONA, V2
[5] Knuth DE, 1973, ART COMPUTER PROGRAM
[6] REGO V, 1990, IN PRESS IEEE T COMP
[7] THE EVALUATION OF AN ALTERNATIVE SUM WITH APPLICATIONS TO THE ANALYSIS OF SOME DATA-STRUCTURES
SZPANKOWSKI, W
[J]. INFORMATION PROCESSING LETTERS, 1988, 28 (01) : 13 - 19
[8] SOME RESULTS ON V-ARY ASYMMETRIC TRIES
SZPANKOWSKI, W
[J]. JOURNAL OF ALGORITHMS, 1988, 9 (02) : 224 - 244
[9] [No title captured]

← 1 →