scholarly journals The Asymptotic Distribution of Sums of Extreme Values from a Regularly Varying Distribution

1986 ◽  
Vol 14 (3) ◽  
pp. 974-983 ◽  
Author(s):  
Sandor Csorgo ◽  
David M. Mason
Keyword(s):  
Asymptotic Distribution ◽  
Extreme Values ◽  
Regularly Varying ◽  
Regularly Varying Distribution

Limit distributions for compounded sums of extreme order statistics

1992 ◽  
Vol 29 (03) ◽  
pp. 557-574 ◽  
Author(s):  
Jan Beirlant ◽  
Jozef L. Teugels
Keyword(s):  
Order Statistics ◽  
Asymptotic Distribution ◽  
Counting Process ◽  
Extreme Values ◽  
Random Variables ◽  
Limit Distributions ◽  
Extreme Order Statistics ◽  
Renewal Counting Process ◽  
Independent Identically Distributed

Let X (1) ≦ X (2) ≦ ·· ·≦ X (N(t)) be the order statistics of the first N(t) elements from a sequence of independent identically distributed random variables, where {N(t); t ≧ 0} is a renewal counting process independent of the sequence of X's. We give a complete description of the asymptotic distribution of sums made from the top kt extreme values, for any sequence kt such that kt → ∞, kt /t → 0 as t → ∞. We discuss applications to reinsurance policies based on large claims.

Extreme values of phase-type and mixed random variables with parallel-processing examples

1999 ◽  
Vol 36 (01) ◽  
pp. 194-210 ◽  
Author(s):  
Sungyeol Kang ◽  
Richard F. Serfozo
Keyword(s):  
Parallel Processing ◽  
Asymptotic Distribution ◽  
Extreme Values ◽  
Random Variables ◽  
Extreme Value Distribution ◽  
Rates Of Convergence ◽  
Value Theory ◽  
Extreme Value ◽  
Independent Random Variables ◽  
Phase Type

A basic issue in extreme value theory is the characterization of the asymptotic distribution of the maximum of a number of random variables as the number tends to infinity. We address this issue in several settings. For independent identically distributed random variables where the distribution is a mixture, we show that the convergence of their maxima is determined by one of the distributions in the mixture that has a dominant tail. We use this result to characterize the asymptotic distribution of maxima associated with mixtures of convolutions of Erlang distributions and of normal distributions. Normalizing constants and bounds on the rates of convergence are also established. The next result is that the distribution of the maxima of independent random variables with phase type distributions converges to the Gumbel extreme-value distribution. These results are applied to describe completion times for jobs consisting of the parallel-processing of tasks represented by Markovian PERT networks or task-graphs. In these contexts, which arise in manufacturing and computer systems, the job completion time is the maximum of the task times and the number of tasks is fairly large. We also consider maxima of dependent random variables for which distributions are selected by an ergodic random environment process that may depend on the variables. We show under certain conditions that their distributions may converge to one of the three classical extreme-value distributions. This applies to parallel-processing where the subtasks are selected by a Markov chain.

Linear Estimation of the Scale Parameter of the First Asymptotic Distribution of Extreme Values

1973 ◽  
Vol R-22 (5) ◽  
pp. 259-264 ◽  
Author(s):  
J. William Shelnutt ◽  
Albert H. Moore ◽  
H. Leon Harter
Keyword(s):  
Asymptotic Distribution ◽  
Scale Parameter ◽  
Extreme Values ◽  
Linear Estimation

Limit distributions for compounded sums of extreme order statistics

1992 ◽  
Vol 29 (3) ◽  
pp. 557-574 ◽  
Author(s):  
Jan Beirlant ◽  
Jozef L. Teugels
Keyword(s):  
Order Statistics ◽  
Asymptotic Distribution ◽  
Counting Process ◽  
Extreme Values ◽  
Random Variables ◽  
Limit Distributions ◽  
Extreme Order Statistics ◽  
Renewal Counting Process ◽  
Independent Identically Distributed

LetX(1)≦X(2)≦ ·· ·≦X(N(t))be the order statistics of the firstN(t) elements from a sequence of independent identically distributed random variables, where {N(t);t≧ 0} is a renewal counting process independent of the sequence ofX's. We give a complete description of the asymptotic distribution of sums made from the topktextreme values, for any sequencektsuch thatkt→ ∞,kt/t→ 0 ast→ ∞. We discuss applications to reinsurance policies based on large claims.

Extreme values of phase-type and mixed random variables with parallel-processing examples

1999 ◽  
Vol 36 (1) ◽  
pp. 194-210 ◽  
Author(s):  
Sungyeol Kang ◽  
Richard F. Serfozo
Keyword(s):  
Parallel Processing ◽  
Asymptotic Distribution ◽  
Extreme Values ◽  
Random Variables ◽  
Extreme Value Distribution ◽  
Rates Of Convergence ◽  
Value Theory ◽  
Extreme Value ◽  
Independent Random Variables ◽  
Phase Type

A basic issue in extreme value theory is the characterization of the asymptotic distribution of the maximum of a number of random variables as the number tends to infinity. We address this issue in several settings. For independent identically distributed random variables where the distribution is a mixture, we show that the convergence of their maxima is determined by one of the distributions in the mixture that has a dominant tail. We use this result to characterize the asymptotic distribution of maxima associated with mixtures of convolutions of Erlang distributions and of normal distributions. Normalizing constants and bounds on the rates of convergence are also established. The next result is that the distribution of the maxima of independent random variables with phase type distributions converges to the Gumbel extreme-value distribution. These results are applied to describe completion times for jobs consisting of the parallel-processing of tasks represented by Markovian PERT networks or task-graphs. In these contexts, which arise in manufacturing and computer systems, the job completion time is the maximum of the task times and the number of tasks is fairly large. We also consider maxima of dependent random variables for which distributions are selected by an ergodic random environment process that may depend on the variables. We show under certain conditions that their distributions may converge to one of the three classical extreme-value distributions. This applies to parallel-processing where the subtasks are selected by a Markov chain.

Sign in / Sign up

Export Citation Format

Share Document