Yet another application of a binomial recurrence order statistics

@article{Szpankowski2005YetAA,
  title={Yet another application of a binomial recurrence order statistics},
  author={W. Szpankowski and V. Rego},
  journal={Computing},
  year={2005},
  volume={43},
  pages={401-410}
}
We investigate the moments of the maximum of a set of i.i.d geometric random variables. Computationally, the exact formula for the moments (which does not seem to be available in the literature) is inhibited by the presence of an alternating sum. A recursive expression for the moments is shown to be superior. However, the recursion can be both computationally intensive as well as subject to large round-off error when the set of random variables is large, due to the presence of factorial terms… Expand
A result in order statistics related to probabilistic counting
The binomial transform and the analysis of skip lists
COMBINATORIAL PROBLEMS RELATED TO SEQUENCES WITH REPEATED ENTRIES
The Largest Missing Value in a Sample of Geometric Random Variables
The path length of random skip lists
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 10 REFERENCES
Some Results on V-ary Asymmetric Tries
Exploiting Parallelism Across Program Execution: A Unification Technique and Its Analysis
Handbook of Mathematical Functions
The Evaluation of an Alternative Sum With Applications to the Analysis of Some Data Structures
Order Statistics. Second Edition
  • 1981
Applied and Computational Complex Analysis
The art of computer programming, sorting and searching, Addison-Wesley
  • 1973