Combinatorics of geometrically distributed random variables: Length of ascending runs

被引:8
|
作者
Prodinger, H [1 ]
机构
[1] Univ Witwatersrand, Dept Math, John Knopfmacher Ctr Appl Anal & Number Theory, ZA-2050 Johannesburg, South Africa
来源
关键词
D O I
10.1007/10719839_47
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
For n independently distributed geometric random variables we consider the average length of the m-th run, for fixed m and n -> infinity. One particular result is that this parameter approaches 1 + q. In the limiting case q -> 1 we thus rederive known results about runs in permutations.
引用
收藏
页码:473 / 482
页数:10
相关论文
共 50 条