The number of winners in a discrete geometrically distributed sample
From MaRDI portal
Publication:1814758
DOI10.1214/AOAP/1034968150zbMath0859.60009OpenAlexW1967105343MaRDI QIDQ1814758
Prodinger, Helmut, Peter Kirschenhofer
Publication date: 31 October 1996
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoap/1034968150
Related Items (7)
Limit laws for the cumulative number of ties for the maximum in a random sequence ⋮ The Largest Missing Value in a Sample of Geometric Random Variables ⋮ Running minimum in the best-choice problem ⋮ On the multiplicity of the maximum in a discrete random sample ⋮ Geometric random variables: descents following maxima ⋮ The average position of the \(d\)th maximum in a sample of geometric random variables ⋮ Descents following maximal values in samples of geometric random variables
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mellin transforms and asymptotics: Finite differences and Rice's integrals
- A note on binomial recurrences arising in the analysis of algorithms
- The evaluation of an alternative sum with applications to the analysis of some data structures
- On The variance of the extremal path length in a symmetric digital trie
- A result in order statistics related to probabilistic counting
- The asymptotic probability of a tie for first place
- Mellin transforms and asymptotics: Digital sums
- On the number of maxima in a discrete sample
- A necessary and sufficient condition for the existence of the limiting probability of a tie for first place
- Digital Search Trees Revisited
- On some applications of formulae of Ramanujan in the analysis of algorithms
- Generalized Digital Trees and Their Difference—Differential Equations
This page was built for publication: The number of winners in a discrete geometrically distributed sample
