Skip to main content Accessibility help
×
Home

A simple construction of an upper bound for the mean of the maximum of n identically distributed random variables

  • A. Gravey (a1)

Abstract

This note gives a method of finding an upper bound for the mean of the maximum of n identically distributed non-negative random variables. The bound is explicitly given and numerically compared with the exact value of the mean of the maximum for some classical distributions (geometric, Poisson, Erlang, hyperexponential).

Copyright

Corresponding author

Postal address: CNET, BP 40, 22301 Lannion Cedex, France.

References

Hide All
David, H. A. (1972) Order Statistics. Wiley, New York.
Dupuis, A., Hebuterne, G. and Pitie, J.-M. (1984) A comparison of two mutual exclusion algorithms for computer networks. International Workshop on Modelling and Performance Evaluation of Parallel Systems, December 1984, Grenoble (France).
Ricart, G. and Agrawala, A. K. (1981) An optimal algorithm for mutual exclusion in computer networks. Comm. ACM 24, 917.

Keywords

A simple construction of an upper bound for the mean of the maximum of n identically distributed random variables

  • A. Gravey (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed