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

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.

[1]  C. O'Cinneide Characterization of phase-type distributions , 1990 .

[2]  B. Gnedenko Sur La Distribution Limite Du Terme Maximum D'Une Serie Aleatoire , 1943 .

[3]  Vidyadhar G. Kulkarni,et al.  Markov and Markov-Regenerative pert Networks , 1986, Oper. Res..

[4]  Marcel F. Neuts,et al.  Limit laws for maxima of a sequence of random variables defined on a Markov chain , 1970, Advances in Applied Probability.

[5]  M. Neuts,et al.  The limiting distribution of the maximum term in a sequence of random variables defined on a markov chain , 1970, Journal of Applied Probability.

[6]  Vidyadhar G. Kulkarni,et al.  A classified bibliography of research on stochastic PERT networks: 1966-1987 , 1989 .

[7]  Donald L. Fisher,et al.  Stochastic PERT networks as models of cognition: Derivation of the mean, variance, and distribution of reaction time using Order-of-Processing (OP) diagrams , 1983 .

[8]  Donald L. Fisher,et al.  Stochastic pert networks: OP diagrams, critical paths and the project completion time , 1985, Comput. Oper. Res..

[9]  Sidney I. Resnick,et al.  Tail equivalence and its applications , 1971, Journal of Applied Probability.

[10]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[11]  G. O'Brien,et al.  Limit Theorems for Extreme Values of Chain-Dependent Processes , 1975 .

[12]  K. Turkman,et al.  Limit laws for the maxima of chain-dependent sequences with positive extremal index , 1992, Journal of Applied Probability.