Z.-D. Bai, H.-K. Hwang, and W.-Q. Liang. Normal approximations of the number of records in geometrically distributed random variables. Random Structures and Algorithms, 13:319-334, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Combinatorics of Geometrically Distributed Random.. - Knopfmacher, Prodinger (Correct)
....be larger or equal to the previous ones. The paper [12] contains asymptotic results about the average and the variance of the number of left to right maxima in the context of geometric random variables. H. K. Hwang and his collaborators obtained further results about the limiting behaviour in [1]. Motivated by Wilf s study we consider here the two parameters value and position of the rth left to right maximum for geometric random variables. Summarizing our results, we obtain the asymptotic formulae Gamma p resp. rq in the weak case. Date: September 6, 1999. A ....
Z.-D. Bai, H.-K. Hwang, and W.-Q. Liang. Normal approximations of the number of records in geometrically distributed random variables. Random Structures and Algorithms, 13:319--334, 1998.
Phase Change of Limit Laws in the Quicksort Recurrence Under .. - Hwang, Neininger (2001) (7 citations) Self-citation (Hwang) (Correct)
....When T = 1) 1 U ) then Var(X n ) o(n (n) 29 Tree traversals. The simplest example is when T n = 1 for n 1. The distribution is essentially the Stirling numbers of the rst kind; see (49) This classical example also appears in a large number of problems; see Bai et al. [3] for some examples. This distribution also has another concrete interpretation: the depth of the rst node in inorder traversal. Interestingly, the depth of the rst node in postorder traversal of a random binary search tree satis es a slightly di erent recurrence: P 0 (y) P 1 (y) 1 and for ....
Z.-D. Bai, H.-K. Hwang and W.-Q. Liang, Normal approximations of the number of records in geometrically distributed random variables, Random Structures and Algorithms, 13, 319-334 (1998).
Hua-Huai Chern - Department Of Mathematics Self-citation (Hwang) (Correct)
No context found.
Z.-D. Bai, H.-K. Hwang and W.-Q. Liang, Normal approximations of the number of records in geometrically distributed random variables, Random Structures and Algorithms, 13 (1998), 319-334.
Distribution of the Number of Consecutive Records - Chern, Hwang, Yeh (2000) Self-citation (Hwang) (Correct)
No context found.
Z.-D. Bai, H.-K. Hwang and W.-Q. Liang, Normal approximations of the number of records in geometrically distributed random variables, Random Structures and Algorithms, 13 (1998), 319--334.
Phase Change of Limit Laws in the Quicksort Recurrence Under .. - Hwang, Neininger (2001) (7 citations) Self-citation (Hwang) (Correct)
..... When T = # 1) 1 ) #, then Var(X n ) o(n (n) 29 Tree traversals. The simplest example is when T n = 1 for n 1. The distribution is essentially the Stirling numbers of the first kind; see (49) This classical example also appears in a large number of problems; see Bai et al. [3] for some examples. This distribution also has another concrete interpretation: the depth of the first node in inorder traversal. Interestingly, the depth of the first node in postorder traversal of a random binary search tree satisfies a slightly di#erent recurrence: P 0 (y) P 1 (y) 1 and ....
Z.-D. Bai, H.-K. Hwang and W.-Q. Liang, Normal approximations of the number of records in geometrically distributed random variables, Random Structures and Algorithms, 13, 319--334 (1998).
Phase Change of Limit Laws in the Quicksort Recurrence Under .. - Hwang, Neininger (2001) (7 citations) Self-citation (Hwang) (Correct)
....When T = 1) 1 U ) then Var(X n ) o(n 2 L 2 (n) Tree traversals. The simplest example is when T n = 1 for n 1. The distribution is essentially the Stirling numbers of the rst kind; see (49) This classical example also appears in a large number of problems; see Bai et al. [3] for some examples. This distribution also has another concrete interpretation: the depth of the rst node in inorder traversal. Interestingly, the depth of the rst node in postorder traversal of a random binary search tree satis es a slightly di erent recurrence: P 0 (y) P 1 (y) 1 and for n ....
Z.-D. Bai, H.-K. Hwang and W.-Q. Liang, Normal approximations of the number of records in geometrically distributed random variables, Random Structures and Algorithms, 13, 319-334 (1998).
The Number of Distinct Values in a Geometrically.. - Archibald.. (Correct)
No context found.
Z.-D. Bai, H.-K. Hwang, and W.-Q. Liang. Normal approximations of the number of records in geometrically distributed random variables. Random Structures and Algorithms, 13:319-334, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC