1998
DOI: 10.1002/(sici)1098-2418(199810/12)13:3/4<319::aid-rsa7>3.3.co;2-j
|Get access via publisher |Summarize |Cite
Normal approximations of the number of records in geometrically distributed random variables
Search citation statements
Paper Sections
Select...
10
6
0
0
Citation Types
2
15
0
0
Year Published
2000
2018
Publication Types
Select...
12
1
Relationship
0
13
Authors
Journals
Cited by 13 publications
(17 citation statements)
References 0 publications
2
15
0
0
Abstract
Smart CitationsHow this paper cites the one you are viewing
“…It can be shown that P(I k = 1) ∼ b/k as k → ∞. From this, as n → ∞, the expectation and the variance of X n are both asymptotically equal to b log n. By the central limit theorem, the distribution of (X n − b log n)/ √ b log n converges to the standard normal law, which again agrees with Theorem 3.1, case (1). The latter result is classics which dates back to [17].…”
Section: Number Of Collisions
supporting
confidence: 74%
Abstract
Smart CitationsHow this paper cites the one you are viewing
“…It can be shown that P(I k = 1) ∼ b/k as k → ∞. From this, as n → ∞, the expectation and the variance of X n are both asymptotically equal to b log n. By the central limit theorem, the distribution of (X n − b log n)/ √ b log n converges to the standard normal law, which again agrees with Theorem 3.1, case (1). The latter result is classics which dates back to [17].…”
Section: Number Of Collisions
supporting
confidence: 74%
Abstract
Smart CitationsHow this paper cites the one you are viewing
“…The above result was obtained by Bai et al [3], using generating function methods. With some extra effort, our results could be extended to functional central limit theorems such as…”
Section: Examples
supporting
confidence: 61%
Abstract
Smart CitationsHow this paper cites the one you are viewing
“…In this latter situation some results on the asymptotic behavior of recursion (1.1) with (1.3) are available, for example, in the context of random composition structures [4], [18], [20], [21], of coalescent theory [19], [24], [26] (see also Section 7 of the present work), and in the context of random trees [11], [14], [24], [29], [30]. We also refer the 208 A. IKSANOV AND M. MÖHLE reader to [3] for a number of interpretations of the random recursion (1.1), where…”
Section: Introduction and Main Results
mentioning
confidence: 98%
