Tree-dependent extreme values: the exponential case

1990 ◽  
Vol 27 (01) ◽  
pp. 124-133 ◽  
Author(s):  
Vijay K. Gupta ◽  
Oscar J. Mesa ◽  
E. Waymire
Keyword(s):  
Branching Process ◽  
Extreme Values ◽  
Rooted Tree ◽  
Domain Of Attraction ◽  
Extreme Value Distribution ◽  
Value Theory ◽  
Extreme Value ◽  
Extinction Time ◽  
Brownian Excursion ◽  
Weighted Trees

The length of the main channel in a river network is viewed as an extreme value statistic L on a randomly weighted binary rooted tree having M sources. Questions of concern for hydrologic applications are formulated as the construction of an extreme value theory for a dependence which poses an interesting contrast to the classical independent theory. Equivalently, the distribution of the extinction time for a binary branching process given a large number of progeny is sought. Our main result is that in the case of exponentially weighted trees, the conditional distribution of n–1/2 L given M = n is asymptotically distributed as the maximum of a Brownian excursion. When taken with an earlier result of Kolchin (1978), this makes the maximum of the Brownian excursion a tree-dependent extreme value distribution whose domain of attraction includes both the exponentially distributed and almost surely constant weights. Moment computations are given for the Brownian excursion which are of independent interest.

Tree-dependent extreme values: the exponential case

1990 ◽  
Vol 27 (1) ◽  
pp. 124-133 ◽  
Author(s):  
Vijay K. Gupta ◽  
Oscar J. Mesa ◽  
E. Waymire
Keyword(s):  
Branching Process ◽  
Extreme Values ◽  
Rooted Tree ◽  
Domain Of Attraction ◽  
Extreme Value Distribution ◽  
Value Theory ◽  
Extreme Value ◽  
Extinction Time ◽  
Brownian Excursion ◽  
Weighted Trees

The length of the main channel in a river network is viewed as an extreme value statistic L on a randomly weighted binary rooted tree having M sources. Questions of concern for hydrologic applications are formulated as the construction of an extreme value theory for a dependence which poses an interesting contrast to the classical independent theory. Equivalently, the distribution of the extinction time for a binary branching process given a large number of progeny is sought. Our main result is that in the case of exponentially weighted trees, the conditional distribution of n–1/2L given M = n is asymptotically distributed as the maximum of a Brownian excursion. When taken with an earlier result of Kolchin (1978), this makes the maximum of the Brownian excursion a tree-dependent extreme value distribution whose domain of attraction includes both the exponentially distributed and almost surely constant weights. Moment computations are given for the Brownian excursion which are of independent interest.

Convergence rates for the ultimate and pentultimate approximations in extreme-value theory

1982 ◽  
Vol 14 (04) ◽  
pp. 833-854 ◽  
Author(s):  
Jonathan P. Cohen
Keyword(s):  
Extreme Value Theory ◽  
Convergence Rates ◽  
Domain Of Attraction ◽  
Extreme Value Distribution ◽  
Rates Of Convergence ◽  
Value Theory ◽  
Extreme Value ◽  
Value Distribution ◽  
Type I ◽  
Type Ii

Let F be a distribution in the domain of attraction of the type I extreme-value distribution Λ(x). In this paper we derive uniform rates of convergence of Fn to Λfor a large class of distributions F. We also generalise the penultimate approximation of Fisher and Tippett (1928) and show that for many F a type II or type III extreme-value distribution gives a better approximation than the limiting type I distribution.

Convergence rates for the ultimate and pentultimate approximations in extreme-value theory

1982 ◽  
Vol 14 (4) ◽  
pp. 833-854 ◽  
Author(s):  
Jonathan P. Cohen
Keyword(s):  
Extreme Value Theory ◽  
Convergence Rates ◽  
Domain Of Attraction ◽  
Extreme Value Distribution ◽  
Rates Of Convergence ◽  
Value Theory ◽  
Extreme Value ◽  
Value Distribution ◽  
Type I ◽  
Type Ii

Let F be a distribution in the domain of attraction of the type I extreme-value distribution Λ(x). In this paper we derive uniform rates of convergence of Fn to Λfor a large class of distributions F. We also generalise the penultimate approximation of Fisher and Tippett (1928) and show that for many F a type II or type III extreme-value distribution gives a better approximation than the limiting type I distribution.

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.

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.

Consideration of Epistemic Uncertainty in Extreme Wave Height Estimation

2014 ◽  
Author(s):  
Ryota Wada ◽  
Takuji Waseda
Keyword(s):  
Gulf Of Mexico ◽  
Observational Data ◽  
Wave Height ◽  
Extreme Values ◽  
Epistemic Uncertainty ◽  
Extreme Value Distribution ◽  
Predictive Distribution ◽  
Extreme Value ◽  
Posterior Predictive Distribution ◽  
Value Estimation

Extreme value estimation of significant wave height is essential for designing robust and economically efficient ocean structures. But in most cases, the duration of observational wave data is not efficient to make a precise estimation of the extreme value for the desired period. When we focus on hurricane dominated oceans, the situation gets worse. The uncertainty of the extreme value estimation is the main topic of this paper. We use Likelihood-Weighted Method (LWM), a method that can quantify the uncertainty of extreme value estimation in terms of aleatory and epistemic uncertainty. We considered the extreme values of hurricane-dominated regions such as Japan and Gulf of Mexico. Though observational data is available for more than 30 years in Gulf of Mexico, the epistemic uncertainty for 100-year return period value is notably large. Extreme value estimation from 10-year duration of observational data, which is a typical case in Japan, gave a Coefficient of Variance of 43%. This may have impact on the design rules of ocean structures. Also, the consideration of epistemic uncertainty gives rational explanation for the past extreme events, which were considered as abnormal. Expected Extreme Value distribution (EEV), which is the posterior predictive distribution, defined better extreme values considering the epistemic uncertainty.

The extremal index for a Markov chain

1992 ◽  
Vol 29 (01) ◽  
pp. 37-45 ◽  
Author(s):  
Richard L. Smith
Keyword(s):  
Markov Chain ◽  
Random Walk ◽  
Extreme Values ◽  
Domain Of Attraction ◽  
Extreme Value Distribution ◽  
Extremal Index ◽  
Scaling Properties ◽  
Continuous State Space ◽  
Continuous State ◽  
Tail Behaviour

The paper presents a method of computing the extremal index for a discrete-time stationary Markov chain in continuous state space. The method is based on the assumption that bivariate margins of the process are in the domain of attraction of a bivariate extreme value distribution. Scaling properties of bivariate extremes then lead to a random walk representation for the tail behaviour of the process, and hence to computation of the extremal index in terms of the fluctuation properties of that random walk. The result may then be used to determine the asymptotic distribution of extreme values from the Markov chain.

Limit laws for maxima of a sequence of random variables defined on a Markov chain

1970 ◽  
Vol 2 (2) ◽  
pp. 323-343 ◽  
Author(s):  
Sidney I. Resnick ◽  
Marcel F. Neuts
Keyword(s):  
Markov Chain ◽  
Random Variables ◽  
Domain Of Attraction ◽  
Extreme Value Distribution ◽  
Extreme Value ◽  
Value Distribution ◽  
Extreme Value Distributions ◽  
Limit Laws ◽  
Limiting Behavior ◽  
Normalizing Constants

Consider the bivariate sequence of r.v.'s {(Jn, Xn), n ≧ 0} with X0 = - ∞ a.s. The marginal sequence {Jn} is an irreducible, aperiodic, m-state M.C., m < ∞, and the r.v.'s Xn are conditionally independent given {Jn}. Furthermore P{Jn = j, Xn ≦ x | Jn − 1 = i} = pijHi(x) = Qij(x), where H1(·), · · ·, Hm(·) are c.d.f.'s. Setting Mn = max {X1, · · ·, Xn}, we obtain P{Jn = j, Mn ≦ x | J0 = i} = [Qn(x)]i, j, where Q(x) = {Qij(x)}. The limiting behavior of this probability and the possible limit laws for Mn are characterized.Theorem. Let ρ(x) be the Perron-Frobenius eigenvalue of Q(x) for real x; then:(a)ρ(x) is a c.d.f.;(b) if for a suitable normalization {Qijn(aijnx + bijn)} converges completely to a matrix {Uij(x)} whose entries are non-degenerate distributions then Uij(x) = πjρU(x), where πj = limn → ∞pijn and ρU(x) is an extreme value distribution;(c) the normalizing constants need not depend on i, j;(d) ρn(anx + bn) converges completely to ρU(x);(e) the maximum Mn has a non-trivial limit law ρU(x) iff Qn(x) has a non-trivial limit matrix U(x) = {Uij(x)} = {πjρU(x)} or equivalently iff ρ(x) or the c.d.f. πi = 1mHiπi(x) is in the domain of attraction of one of the extreme value distributions. Hence the only possible limit laws for {Mn} are the extreme value distributions which generalize the results of Gnedenko for the i.i.d. case.

Rate of convergence for the generalized Pareto approximation of the excesses

2003 ◽  
Vol 35 (04) ◽  
pp. 1007-1027 ◽  
Author(s):  
J.-P. Raoult ◽  
R. Worms
Keyword(s):  
Distribution Function ◽  
Uniform Convergence ◽  
Rate Of Convergence ◽  
Pareto Distribution ◽  
Generalized Pareto Distribution ◽  
Domain Of Attraction ◽  
Extreme Value Distribution ◽  
Extreme Value ◽  
Value Distribution ◽  
Generalized Pareto

Let F be a distribution function in the domain of attraction of an extreme-value distribution H γ. If F u is the distribution function of the excesses over u and G γ the distribution function of the generalized Pareto distribution, then it is well known that F u (x) converges to G γ(x/σ(u)) as u tends to the end point of F, where σ is an appropriate normalizing function. We study the rate of (uniform) convergence to 0 of F̅ u (x)-G̅γ((x+u-α(u))/σ(u)), where α and σ are two appropriate normalizing functions.

Sign in / Sign up

Export Citation Format

Share Document