The ratio of the extreme to the sum in a random sequence (Q1003314)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5520593
Language Label Description Also known as
default for all languages
No label defined
    English
    The ratio of the extreme to the sum in a random sequence
    scientific article; zbMATH DE number 5520593

      Statements

      The ratio of the extreme to the sum in a random sequence (English)
      0 references
      0 references
      0 references
      0 references
      28 February 2009
      0 references
      The ratio \(R_n=X_{(n)}/S_n\) is considered, where \(S_n=\sum_{i=1}^n X_i\), \(X_{(n)}=\max_{1\leq i\leq n} X_i\), \(X_i\) are i.i.d. random variables. It is shown that \({\mathbf E}R_n={{\mathbf E} X{(n)}\over {\mathbf E}S_n}(1+o(1))\) as \(n\to\infty\) if \({\mathbf E}X_i^2<\infty\) or if the survival function of \(X_i\) is regularly varying with the index of variation less then -1. The proof is based on an integral representation for \({\mathbf E}R_n\). The results are applied to a multiprocessor scheduling asymptotical analysis.
      0 references
      multiprocessor scheduling
      0 references
      regular variation
      0 references
      asymptotic expansion
      0 references

      Identifiers