Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-05T04:59:22.513Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Published online by Cambridge University Press:  14 July 2016

A. Gravey
A. Gravey*
Affiliation:
Centre National d'Etudes des Télécommunications
*
∗ Postal address: CNET, BP 40, 22301 Lannion Cedex, France.
Get access Rights & Permissions [Opens in a new window]

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).

Keywords

ORDER STATISTICSGEOMETRIC DISTRIBUTIONPOISSON DISTRIBUTIONERLANG DISTRIBUTIONHYPEREXPONENTIAL DISTRIBUTION
Type
Research Papers
Information
Journal of Applied Probability , Volume 22 , Issue 4 , December 1985 , pp. 844 - 851
Copyright
Copyright © Applied Probability Trust 1985 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

David, H. A. (1972) Order Statistics. Wiley, New York.Google Scholar
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).Google Scholar
Ricart, G. and Agrawala, A. K. (1981) An optimal algorithm for mutual exclusion in computer networks. Comm. ACM 24, 9–17.CrossRefGoogle Scholar