Normal approximations of the number of records in geometrically distributed random variables

Random Structures and Algorithms

Volumn 13, Issue 3-4, 1998, Pages 319-334

  Bai, Zhi Dong ^a   Hwang, Hsien Kuei ^b   Liang, Wen Qi ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b INSTITUTE OF STATISTICAL SCIENCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032221886     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(sici)1098-2418(199810/12)13:3/4<319::aid-rsa7>3.0.co;2-y     Document Type: Article

References (28)

1. G. E. Andrews, The theory of partitions, in Encyclopedia of Mathematics and Its Applications, Vol. 2, Gian-Carlo Rota, Ed., Addison-Wesley, Reading, MA, 1976.
2. I. Bárány, J. Lee, and M. Shubik, Classification of two-person ordinal bimatrix games, Internat. J. Game Theory, 21, 267-290 (1992/93).
3. O. Barndorff-Nielsen and M. Sobel, On the distribution of the number of admissible points in a vector random sample. Theory Probab. Appl., 11, 249-269 (1966).
4. F. Bergeron, P. Flajolet, and B. Salvy, Varieties of increasing trees, Proceedings CAAP '92, Lecture Notes in Computer Science, 581, Springer-Verlag, New York, 1992, pp. 24-48.
5. A. Erdélyi, Higher Transcendental Functions, Vol. I, Robert E. Publishing Company, Malabar, FL, 1953.
6. W. Feller, An Introduction to Probability Theory, Vol. 1, 3rd ed., John Wiley, New York, 1968.
7. P. Flajolet, X. Gourdon, and P. Dumas, Mellin transforms and asymptotics: harmonic sums, Theoret. Comput. Sci., 144, 3-58, (1995).
8. P. Flajolet, H.-K. Hwang, and M. Soria, The ubiquitous Gaussian law in analytic combinatorics, preprint.
9. P. Flajolet, G. Labelle, L. Laforest, and B. Salvy, Hypergeometrics and the cost structure of quadtrees, Random Structures Algorithms, 7, 117-144 (1995).
10. P. Flajolet and A. M. Odlyzko, Singularity analysis of generating functions, SIAM J. Discrete Math. 3, 216-240 (1990).
11. P. Flajolet and B. Richmond, Generalized digital search trees and their difference-differential equations, Random Structures Algorithms, 3, 305-320 (1992).
12. P. Flajolet and R. Sedgewick, Mellin transforms and asymptotics: Finite differences and Rice's integrals, Theoret. Comput. Sci., 144, 101-124 (1995).
13. C. M. Goldie, Records, permutations and greatest convex minorants. Math. Proc. Cambridge Philos. Soc., 106, 169-177 (1989).
14. V. L. Goncharov, On the field of combinatorial analysis, Izvestiya Akademii Nauk SSSR Ser. Mat., 8, 3-48 (1944) (translated in Amer. Math. Soc. Trans. Ser. 2, 19, 1-46 (1962).
15. V. L. Goncharov, On the field of combinatorial analysis, Izvestiya Akademii Nauk SSSR Ser. Mat., 8, 3-48 (1944) (translated in Amer. Math. Soc. Trans. Ser. 2, 19, 1-46 (1962).
16. H-K. Hwang, Théorèmes limites pour les structures combinatoires et les fonctions arithmétiques, Thèse, École polytechnique, 1994.
17. H.-K. Hwang, Asymptotics of Poisson approximation to random discrete distributions: An analytic approach, Adv. Appl. Probab., in press.
18. P. Kirschenhofer, C. Martínez, and H. Prodinger, Analysis of an optimized search algorithms for skip lists, Theoret. Comput. Sci., 144, 199-220 (1995).
19. P. Kirschenhofer and H. Prodinger, The path length of random skip lists, Acta Inform., 31, 775-792 (1994).
20. D. E. Knuth, The Art of Computer Programming, Vol. I, Fundamental Algorithms, 3rd ed., Addison-Wesley, Reading, MA, 1997.
21. V. F. Kolchin, B. A. Sevast'yanov, and V. P. Chistyakov, Random Allocations, John Wiley & Sons, Washington, DC, 1978.
22. V. B. Nevzorov, Records, Theory Probab. Appl., 32, 201-228 (1987).
23. B. O'Neill, The number of outcomes in the Pareto-optimal set of discrete bargaining games, Math. Oper. Res., 6, 571-578 (1980).
24. H. Prodinger, Combinatorial problems of geometrically distributed random variables and applications in computer science, Publ. Inst. Rech. Math. Av. 30, 87-95 (1993).
25. H. Prodinger, Combinatorics of geometrically distributed random variables; Left-to-right maxima, Discrete Math., 153, 253-270 (1996).
26. S. M. Ross, A simple heuristic approach to simplex efficiency, European J. Oper. Res., 9, 344-346 (1982).
27. A. V. Stepanov, Limit theorems for weak records, Theory Probab. Appl. 37, 570-574 (1992).
28. J. Vervaat, Limit theorems for records from discrete distributions, Stochastic Process. Appl. 1, 317-334 (1973).