×

The number of winners in a discrete geometrically distributed sample. (English) Zbl 0859.60009

Statistics on the number of people who tie for first place are considered. It is demonstrated that the so-called Rice’s method from the calculus of finite differences is a very convenient tool both to rederive known results as well as to gain new ones with ease. Some new results concerning higher moments of distribution as well as the number of persons reaching a specified level beyond the winner(s) are given.

MSC:

60C05 Combinatorial probability
60G70 Extreme value theory; extremal stochastic processes
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] BARy SHNIKOV, Y., EISENBERG, B. and STENGLE, G. 1995. A necessary and sufficient condition for the existence of the limiting probability of a tie for first place. Statist. Probab. Lett. 23 203 209. · Zbl 0823.60029
[2] BRANDS, J. J. A. M., STEUTEL, F. W. and WILMS, R. J. G. 1994. On the number of maxima in a discrete sample. Statist. Probab. Lett. 20 209 217. · Zbl 0802.60048
[3] EISENBERG, B., STENGLE, G. and STRANG, G. 1993. The asy mptotic probability of a tie for first place. Ann. Appl. Probab. 3 731 745. · Zbl 0787.60029
[4] FLAJOLET, P., GRABNER, P., KIRSCHENHOFER, P., PRODINGER, H. and TICHY, R. F. 1994. Mellin transforms and asy mptotics: digital sums. Theoret. Comput. Sci. 123 291 314. · Zbl 0788.44004
[5] FLAJOLET, P. and RICHMOND, L. B. 1992. Generalized digital trees and their differencedifferential equations. Random Structures and Algorithms 3 305 320. · Zbl 0758.60015
[6] FLAJOLET, P. and SEDGEWICK, R. 1986. Digital search trees revisited. SIAM J. Comput. 15 748 767. · Zbl 0611.68041
[7] FLAJOLET, P. and SEDGEWICK, R. 1995. Mellin transforms and asy mptotics: finite differences and Rice’s integrals. Theoret. Comput. Sci. 144 101 124. · Zbl 0869.68056
[8] GRAHAM, R., KNUTH, D. E. and PATASHNIK, O. 1989. Concrete Mathematics. Addison-Wesley, Reading, MA. · Zbl 0668.00003
[9] HENRICI, P. 1977. Applied and Computational Complex Analy sis 1. Wiley, New York.
[10] KIRSCHENHOFER, P. and PRODINGER, H. 1991. On some applications of formulae of Ramanujan in the analysis of algorithms. Mathematika 38 14 33. · Zbl 0765.68051
[11] KIRSCHENHOFER, P. and PRODINGER, H. 1993. A result in order statistics related to probabilistic counting. Computing 51 15 27. · Zbl 0782.60021
[12] KIRSCHENHOFER, P., PRODINGER, H. and SZPANKOWSKI, W. 1989. On the variance of the external pathlength in a sy mmetric digital trie. Discrete Appl. Math. 25 129 143. · Zbl 0685.68059
[13] KNUTH, D. E. 1973. The Art of Computer Programming 3. Addison-Wesley, Reading, MA. · Zbl 1178.68372
[14] MAHMOUD, H. M. 1992. Evolution of Random Search Trees. Wiley, New York. · Zbl 0762.68033
[15] PRODINGER, H. and SZPANKOWSKI, W. 1993. A note on binomial recurrences arising in the Z. analysis of algorithms letter to the editor. Inform. Process. Lett. 46 309 311. · Zbl 0800.68497
[16] SZPANKOWSKI, W. 1988. The evaluation of an alternative sum with applications to the analysis of some data structures. Inform. Process. Lett. 28 13 19. · Zbl 0657.68071
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.