This vignette describes the probability distributions available in EnvStats and the methods used to estimate gamma, lognormal, and generalized extreme value distribution parameters. It includes likelihood, moment, and probability-weighted moment estimators and their statistical properties.

Related vignettes:

Distribution.df

Help topic: Distribution.df.

The table below summarizes the probability distributions available in R and EnvStats. For each distribution, there are four associated functions for computing density values, percentiles, quantiles, and random numbers. The form of the names of these functions are dabb, pabb, qabb, and rabb, where abb is the abbreviated name of the distribution (see table below). These functions are described in the help file with the name of the distribution (see the first column of the table below). For example, the help file for Beta describes the behavior of dbeta, pbeta, qbeta, and rbeta.

For most distributions, there is also an associated function for estimating the distribution parameters, and the form of the names of these functions is eabb, where abb is the abbreviated name of the distribution (see table below). All of these functions are listed in the help file Estimating Distribution Parameters. For example, the function ebeta estimates the shape parameters of a Beta distribution based on a random sample of observations from this distribution.

For some distributions, there are functions to estimate distribution parameters based on Type I censored data. The form of the names of these functions is eabbSinglyCensored for singly censored data and eabbMultiplyCensored for multiply censored data. All of these functions are listed under the heading Estimating Distribution Parameters in the censored-data overview.

Table 1a. Available Distributions: Name, Abbreviation, Type, and Range

Name Abbreviation Type Range
Beta beta Continuous [0,1][0, 1]
Binomial binom Finite [0,size][0, size]
    Discrete (integer)
Cauchy cauchy Continuous (−∞,∞)(-\infty, \infty)
Chi chi Continuous [0,∞)[0, \infty)
Chi-square chisq Continuous [0,∞)[0, \infty)
Exponential exp Continuous [0,∞)[0, \infty)
Extreme evd Continuous (−∞,∞)(-\infty, \infty)
Value      
F f Continuous [0,∞)[0, \infty)
Gamma gamma Continuous [0,∞)[0, \infty)
Gamma gammaAlt Continuous [0,∞)[0, \infty)
(Alternative)      
Generalized gevd Continuous (−∞,∞)(-\infty, \infty)
Extreme     for shape=0shape = 0
Value      
      (−∞,location+scaleshape](-\infty, location + \frac{scale}{shape}]
      for shape>0shape > 0
      [location+scaleshape,∞)[location + \frac{scale}{shape}, \infty)
      for shape<0shape < 0
Geometric geom Discrete [0,∞)[0, \infty)
      (integer)
Hypergeometric hyper Finite [0,min(k,m)][0, min(k,m)]
    Discrete (integer)
Logistic logis Continuous (−∞,∞)(-\infty, \infty)
Lognormal lnorm Continuous (0,∞)(0, \infty)
Lognormal lnormAlt Continuous (0,∞)(0, \infty)
(Alternative)      
Lognormal lnormMix Continuous (0,∞)(0, \infty)
Mixture      
Lognormal lnormMixAlt Continuous (0,∞)(0, \infty)
Mixture      
(Alternative)      
Three- lnorm3 Continuous [threshold,∞)[threshold, \infty)
Parameter      
Lognormal      
Truncated lnormTrunc Continuous [min,max][min, max]
Lognormal      
Truncated lnormTruncAlt Continuous [min,max][min, max]
Lognormal      
(Alternative)      
Negative nbinom Discrete [0,∞)[0, \infty)
Binomial     (integer)
Normal norm Continuous (−∞,∞)(-\infty, \infty)
Normal normMix Continuous (−∞,∞)(-\infty, \infty)
Mixture      
Truncated normTrunc Continuous [min,max][min, max]
Normal      
Pareto pareto Continuous [location,∞)[location, \infty)
Poisson pois Discrete [0,∞)[0, \infty)
      (integer)
Student’s t t Continuous (−∞,∞)(-\infty, \infty)
Triangular tri Continuous [min,max][min, max]
Uniform unif Continuous [min,max][min, max]
Weibull weibull Continuous [0,∞)[0, \infty)
Wilcoxon wilcox Finite [0,mn][0, m n]
Rank Sum   Discrete (integer)
Zero-Modified zmlnorm Mixed [0,∞)[0, \infty)
Lognormal      
(Delta)      
Zero-Modified zmlnormAlt Mixed [0,∞)[0, \infty)
Lognormal      
(Delta)      
(Alternative)      
Zero-Modified zmnorm Mixed (−∞,∞)(-\infty, \infty)
Normal      

Table 1b. Available Distributions: Name, Parameters, Parameter Default Values, Parameter Ranges, Estimation Method(s)

    Default Parameter Estimation
Name Parameter(s) Value(s) Range(s) Method(s)
Beta shape1   (0,∞)(0, \infty) mle, mme, mmue
  shape2   (0,∞)(0, \infty)  
  ncp 0 (0,∞)(0, \infty)  
Binomial size   [0,∞)[0, \infty) mle/mme/mvue
  prob   [0,1][0, 1]  
Cauchy location 0 (−∞,∞)(-\infty, \infty)  
  scale 1 (0,∞)(0, \infty)  
Chi df   (0,∞)(0, \infty)  
Chi-square df   (0,∞)(0, \infty)  
  ncp 0 (−∞,∞)(-\infty, \infty)  
Exponential rate 1 (0,∞)(0, \infty) mle/mme
Extreme location 0 (−∞,∞)(-\infty, \infty) mle, mme, mmue, pwme
Value scale 1 (0,∞)(0, \infty)  
F df1   (0,∞)(0, \infty)  
  df2   (0,∞)(0, \infty)  
  ncp 0 (0,∞)(0, \infty)  
Gamma shape   (0,∞)(0, \infty) mle, bcmle, mme, mmue
  scale 1 (0,∞)(0, \infty)  
Gamma mean   (0,∞)(0, \infty) mle, bcmle, mme, mmue
(Alternative) cv 1 (0,∞)(0, \infty)  
Generalized location 0 (−∞,∞)(-\infty, \infty) mle, pwme, tsoe
Extreme scale 1 (0,∞)(0, \infty)  
Value shape 0 (−∞,∞)(-\infty, \infty)  
Geometric prob   (0,1)(0, 1) mle/mme, mvue
Hypergeometric m   [0,∞)[0, \infty) mle, mvue
  n   [0,∞)[0, \infty)  
  k   [1,m+n][1, m+n]  
Logistic location 0 (−∞,∞)(-\infty, \infty) mle, mme, mmue
  scale 1 (0,∞)(0, \infty)  
Lognormal meanlog 0 (−∞,∞)(-\infty, \infty) mle/mme, mvue
  sdlog 1 (0,∞)(0, \infty)  
Lognormal mean exp(1/2) (0,∞)(0, \infty) mle, mme, mmue,
(Alternative) cv sqrt(exp(1)-1) (0,∞)(0, \infty) mvue, qmle
Lognormal meanlog1 0 (−∞,∞)(-\infty, \infty)  
Mixture sdlog1 1 (0,∞)(0, \infty)  
  meanlog2 0 (−∞,∞)(-\infty, \infty)  
  sdlog2 1 (0,∞)(0, \infty)  
  p.mix 0.5 [0,1][0, 1]  
Lognormal mean1 exp(1/2) (0,∞)(0, \infty)  
Mixture cv1 sqrt(exp(1)-1) (0,∞)(0, \infty)  
(Alternative) mean2 exp(1/2) (0,∞)(0, \infty)  
  cv2 sqrt(exp(1)-1) (0,∞)(0, \infty)  
  p.mix 0.5 [0,1][0, 1]  
Three- meanlog 0 (−∞,∞)(-\infty, \infty) lmle, mme,
Parameter sdlog 1 (0,∞)(0, \infty) mmue, mmme,
Lognormal threshold 0 (−∞,∞)(-\infty, \infty) royston.skew,
        zero.skew
Truncated meanlog 0 (−∞,∞)(-\infty, \infty)  
Lognormal sdlog 1 (0,∞)(0, \infty)  
  min 0 [0,max)[0, max)  
  max Inf (min,∞)(min, \infty)  
Truncated mean exp(1/2) (0,∞)(0, \infty)  
Lognormal cv sqrt(exp(1)-1) (0,∞)(0, \infty)  
(Alternative) min 0 [0,max)[0, max)  
  max Inf (min,∞)(min, \infty)  
Negative size   [1,∞)[1, \infty) mle/mme, mvue
Binomial prob   (0,1](0, 1]  
  mu   (0,∞)(0, \infty)  
Normal mean 0 (−∞,∞)(-\infty, \infty) mle/mme, mvue
  sd 1 (0,∞)(0, \infty)  
Normal mean1 0 (−∞,∞)(-\infty, \infty)  
Mixture sd1 1 (0,∞)(0, \infty)  
  mean2 0 (−∞,∞)(-\infty, \infty)  
  sd2 1 (0,∞)(0, \infty)  
  p.mix 0.5 [0,1][0, 1]  
Truncated mean 0 (−∞,∞)(-\infty, \infty)  
Normal sd 1 (0,∞)(0, \infty)  
  min -Inf (−∞,max)(-\infty, max)  
  max Inf (min,∞)(min, \infty)  
Pareto location   (0,∞)(0, \infty) lse, mle
  shape 1 (0,∞)(0, \infty)  
Poisson lambda   (0,∞)(0, \infty) mle/mme/mvue
Student’s t df   (0,∞)(0, \infty)  
  ncp 0 (−∞,∞)(-\infty, \infty)  
Triangular min 0 (−∞,max)(-\infty, max)  
  max 1 (min,∞)(min, \infty)  
  mode 0.5 (min,max)(min, max)  
Uniform min 0 (−∞,max)(-\infty, max) mle, mme, mmue
  max 1 (min,∞)(min, \infty)  
Weibull shape   (0,∞)(0, \infty) mle, mme, mmue
  scale 1 (0,∞)(0, \infty)  
Wilcoxon m   [1,∞)[1, \infty)  
Rank Sum n   [1,∞)[1, \infty)  
Zero-Modified meanlog 0 (−∞,∞)(-\infty, \infty) mvue
Lognormal sdlog 1 (0,∞)(0, \infty)  
(Delta) p.zero 0.5 [0,1][0, 1]  
Zero-Modified mean exp(1/2) (0,∞)(0, \infty) mvue
Lognormal cv sqrt(exp(1)-1) (0,∞)(0, \infty)  
(Delta) p.zero 0.5 [0,1][0, 1]  
(Alternative)      
Zero-Modified mean 0 (−∞,∞)(-\infty, \infty) mvue
Normal sd 1 (0,∞)(0, \infty)  
  p.zero 0.5 [0,1][0, 1]  

egamma

Help topic: egamma.

If x contains any missing (NA), undefined (NaN) or infinite (Inf, -Inf) values, they will be removed prior to performing the estimation.

Let x_=x1,x2,…,xn\underline{x} = x_1, x_2, \ldots, x_n denote a random sample of nn observations from a gamma distribution with parameters shape=κ\kappa and scale=θ\theta. The relationship between these parameters and the mean (mean=μ\mu) and coefficient of variation (cv=τ\tau) of this distribution is given by:

κ=τ−2(1) \kappa = \tau^{-2} \;\;\;\;\;\; (1)

θ=μ/κ(2) \theta = \mu/\kappa \;\;\;\;\;\; (2)

μ=κθ(3) \mu = \kappa \; \theta \;\;\;\;\;\; (3)

τ=κ−1/2(4) \tau = \kappa^{-1/2} \;\;\;\;\;\; (4)

The function egamma returns estimates of the shape and scale parameters. The function egammaAlt returns estimates of the mean (μ\mu) and coefficient of variation (cvcv) based on the estimates of the shape and scale parameters.

Estimation

Maximum Likelihood Estimation (method="mle")
The maximum likelihood estimators (mle’s) of the shape and scale parameters κ\kappa and θ\theta are solutions of the simultaneous equations:

κ̂mle=1n∑i=1nlog(xi)−log(x‾)=ψ(κ̂mle)−log(κ̂mle)(5) \hat{\kappa}_{mle} = \frac{1}{n}\sum_{i=1}^n log(x_i) - log(\bar{x}) = \psi(\hat{\kappa}_{mle}) - log(\hat{\kappa}_{mle}) \ \;\;\;\;\;\; (5)

θ̂mle=x‾/κ̂mle(6) \hat{\theta}_{mle} = \bar{x} / \hat{\kappa}_{mle} \;\;\;\;\;\; (6)

where ψ\psi denotes the digamma function, and x‾\bar{x} denotes the sample mean:

x‾=1n∑i=1nxi(7) \bar{x} = \frac{1}{n}\sum_{i=1}^n x_i \;\;\;\;\;\; (7)

(Forbes et al., 2011, chapter 22; Johnson et al., 1994, chapter 17).

Bias-Corrected Maximum Likelihood Estimation (method="bcmle")
The “bias-corrected” maximum likelihood estimator of the shape parameter is based on the suggestion of Anderson and Ray (1975; see also Johnon et al., 1994, p.366 and Singh et al., 2010b, p.48), who noted that the bias of the maximum likelihood estimator of the shape parameter can be considerable when the sample size is small. This estimator is given by:

κ̂bcmle=n−3nκ̂mle+23n(8) \hat{\kappa}_{bcmle} = \frac{n-3}{n}\hat{\kappa}_{mle} + \frac{2}{3n} \;\;\;\;\;\; (8)

When method="bcmle", Equation (6) above is modified so that the estimate of the scale paramter is based on the “bias-corrected” maximum likelihood estimator of the shape parameter:

θ̂bcmle=x‾/κ̂bcmle(9) \hat{\theta}_{bcmle} = \bar{x} / \hat{\kappa}_{bcmle} \;\;\;\;\;\; (9)

Method of Moments Estimation (method="mme")
The method of moments estimators (mme’s) of the shape and scale parameters κ\kappa and θ\theta are:

κ̂mme=(x‾/sm)2(10) \hat{\kappa}_{mme} = (\bar{x}/s_m)^2 \;\;\;\;\;\; (10)

θ̂mme=sm2/x‾(11) \hat{\theta}_{mme} = s_m^2 / \bar{x} \;\;\;\;\;\; (11)

where sm2s_m^2 denotes the method of moments estimator of variance:

sm2=1n∑i=1n(xi−x‾)2(12) s_m^2 = \frac{1}{n} \sum_{i=1}^n (x_i - \bar{x})^2 \;\;\;\;\;\; (12)

Method of Moments Estimation Based on the Unbiased Estimator of Variance (method="mmue")
The method of moments estimators based on the unbiased estimator of variance are exactly the same as the method of moments estimators, except that the method of moments estimator of variance is replaced with the unbiased estimator of variance:

κ̂mmue=(x‾/s)2(13) \hat{\kappa}_{mmue} = (\bar{x}/s)^2 \;\;\;\;\;\; (13)

θ̂mmue=s2/x‾(14) \hat{\theta}_{mmue} = s^2 / \bar{x} \;\;\;\;\;\; (14)

where s2s^2 denotes the unbiased estimator of variance:

s2=1n−1∑i=1n(xi−x‾)2(15) s^2 = \frac{1}{n-1} \sum_{i=1}^n (x_i - \bar{x})^2 \;\;\;\;\;\; (15)

Confidence Intervals
This section discusses how confidence intervals for the mean μ\mu are computed.

Normal Approximation (ci.method="normal.approx")
The normal approximation method is based on the method of Kulkarni and Powar (2010), who use a power transformation of the the original data to approximate a sample from a normal distribuiton, compute the confidence interval for the mean on the transformed scale using the usual formula for a confidence interval for the mean of a normal distribuiton, and then tranform the limits back to the original space using equations based on the expected value of a gamma random variable raised to a power.

The particular power used for the normal approximation is defined by the argument
normal.approx.transform. The value normal.approx.transform="cube.root" uses the cube root transformation suggested by Wilson and Hilferty (1931), and the value
"fourth.root" uses the fourth root transformation suggested by Hawkins and Wixley (1986). The default value "kulkarni.powar" uses the “Optimum Power Normal Approximation Method” of Kulkarni and Powar (2010), who show this method performs the best in terms of maintining coverage and minimizing confidence interval width compared to eight other methods. The “optimum” power pp is determined by:

p=−0.0705−0.178κ̂+0.475κ̂p = -0.0705 - 0.178\hat{\kappa} + 0.475 \sqrt{\hat{\kappa}} if κ̂≤1.5\hat{\kappa} \le 1.5  
p=0.246p = 0.246 if κ̂>1.5\hat{\kappa} > 1.5 (16)

where κ̂\hat{\kappa} denotes the estimate of the shape parameter. Kulkarni and Powar (2010) derived this equation by determining what power transformation yields a skew closest to 0 and a kurtosis closest to 3 for a gamma random variable with a given shape parameter. Although Kulkarni and Powar (2010) use the maximum likelihood estimate of shape to determine the power to use to induce approximate normality, for the functions egamma and egammaAlt the power is based on whatever estimate of shape is used (e.g., method="mle", method="bcmle", etc.).

Likelihood Profile (ci.method="profile.likelihood")
This method was proposed by Cox (1970, p.88), and Venzon and Moolgavkar (1988) introduced an efficient method of computation. This method is also discussed by Stryhn and Christensen (2003) and Royston (2007). The idea behind this method is to invert the likelihood-ratio test to obtain a confidence interval for the mean μ\mu while treating the coefficient of variation τ\tau as a nuisance parameter.

The likelihood function is given by:

L(μ,τ|x_)=∏i=1nxiκ−1e−xi/θθκΓ(κ)(17) L(\mu, \tau | \underline{x}) = \prod_{i=1}^n \frac{x_i^{\kappa-1} e^{-x_i/\theta}}{\theta^\kappa \Gamma(\kappa)} \;\;\;\;\;\; (17)

where κ\kappa, θ\theta, μ\mu, and τ\tau are defined in Equations (1)-(4) above, and Γ(t)\Gamma(t) denotes the Gamma function evaluated at tt.

Following Stryhn and Christensen (2003), denote the maximum likelihood estimates of the mean and coefficient of variation by (μ*,τ*)(\mu^*, \tau^*). The likelihood ratio test statistic (G2G^2) of the hypothesis H0:μ=μ0H_0: \mu = \mu_0 (where μ0\mu_0 is a fixed value) equals the drop in 2log(L)2 log(L) between the “full” model and the reduced model with μ\mu fixed at μ0\mu_0, i.e.,

G2=2{log[L(μ*,τ*)]−log[L(μ0,τ0*)]}(18) G^2 = 2 \{log[L(\mu^*, \tau^*)] - log[L(\mu_0, \tau_0^*)]\} \;\;\;\;\;\; (18)

where τ0*\tau_0^* is the maximum likelihood estimate of τ\tau for the reduced model (i.e., when μ=μ0\mu = \mu_0). Under the null hypothesis, the test statistic G2G^2 follows a chi-squared distribution with 1 degree of freedom.

Alternatively, we may express the test statistic in terms of the profile likelihood function L1L_1 for the mean μ\mu, which is obtained from the usual likelihood function by maximizing over the parameter τ\tau, i.e.,

L1(μ)=maxτL(μ,τ)(19) L_1(\mu) = max_{\tau} L(\mu, \tau) \;\;\;\;\;\; (19)

Then we have

G2=2{log[L1(μ*)]−log[L1(μ0)]}(20) G^2 = 2 \{log[L_1(\mu^*)] - log[L_1(\mu_0)]\} \;\;\;\;\;\; (20)

A two-sided (1−α)100%(1-\alpha)100\% confidence interval for the mean μ\mu consists of all values of μ0\mu_0 for which the test is not significant at level alphaalpha:

μ0:G2≤χ1,1−α2(21) \mu_0: G^2 \le \chi^2_{1, {1-\alpha}} \;\;\;\;\;\; (21)

where χν,p2\chi^2_{\nu, p} denotes the pp’th quantile of the chi-squared distribution with ν\nu degrees of freedom. One-sided lower and one-sided upper confidence intervals are computed in a similar fashion, except that the quantity 1−α1-\alpha in Equation (21) is replaced with 1−2α1-2\alpha.

Chi-Square Approximation (ci.method="chisq.approx")
This method is based on the relationship between the sample mean of the gamma distribution and the chi-squared distribution (Grice and Bain, 1980):

2nx‾θ∼χ2nκ2(22) \frac{2n\bar{x}}{\theta} \sim \chi^2_{2n\kappa} \;\;\;\;\;\; (22)

Therefore, an exact one-sided upper (1−α)100%(1-\alpha)100\% confidence interval for the mean μ\mu is given by:

[0,2nx‾κχ2nκ,α2](23) [0, \, \frac{2n\bar{x}\kappa}{\chi^2_{2n\kappa, \alpha}}] \;\;\;\;\;\; (23)

an exact one-sided lower (1−α)100%(1-\alpha)100\% confidence interval is given by:

[2nx‾κχ2nκ,1−α2,∞](24) [\frac{2n\bar{x}\kappa}{\chi^2_{2n\kappa, 1-\alpha}}, \, \infty] \;\;\;\;\;\; (24)

and a two-sided (1−α)100%(1-\alpha)100\% confidence interval is given by:

[2nx‾κχ2nκ,1−α/22,2nx‾κχ2nκ,α/22](25) [\frac{2n\bar{x}\kappa}{\chi^2_{2n\kappa, 1-\alpha/2}}, \, \frac{2n\bar{x}\kappa}{\chi^2_{2n\kappa, \alpha/2}}] \;\;\;\;\;\; (25)

Because this method is exact only when the shape parameter κ\kappa is known, the method used here is called the “chi-square approximation” method because the estimate of the shape parameter, κ̂\hat{\kappa}, is used in place of κ\kappa in Equations (23)-(25) above. The Chi-Square Approximation method is not the method proposed by Grice and Bain (1980) in which the confidence interval is adjusted based on adjusting for the fact that the shape parameter κ\kappa is estimated (see the explanation of the Chi-Square Adjusted method below). The Chi-Square Approximation method used by egamma and egammaAlt is equivalent to the “approximate gamma” method of ProUCL (USEPA, 2015, equation (2-34), p.62).

Chi-Square Adjusted (ci.method="chisq.adj")
This is the same method as the Chi-Square Approximation method discussed above, execpt that the value of α\alpha is adjusted to account for the fact that the shape parameter κ\kappa is estimated rather than known. Grice and Bain (1980) performed Monte Carlo simulations to determine how to adjust α\alpha and the values in their Table 2 are given in the matrix Grice.Bain.80.mat. This method requires that the sample size nn is at least 5 and the confidence level is between 75% and 99.5% (except when n=5n=5, in which case the confidence level must be less than 99%). For values of the sample size nn and/or α\alpha that are not listed in the table, linear interpolation is used (when the sample size nn is greater than 40, linear interpolation on 1/n1/n is used, as recommended by Grice and Bain (1980)). The Chi-Square Adjusted method used by egamma and egammaAlt is equivalent to the “adjusted gamma” method of ProUCL (USEPA, 2015, equation (2-35), p.63).

elnormAlt

Help topic: elnormAlt.

If x contains any missing (NA), undefined (NaN) or infinite (Inf, -Inf) values, they will be removed prior to performing the estimation.

Let x_\underline{x} be a vector of nn observations from a lognormal distribution with parameters mean=θ\theta and cv=τ\tau. Let η\eta denote the standard deviation of this distribution, so that η=θτ\eta = \theta \tau. Set y_=log(x_)\underline{y} = log(\underline{x}). Then y_\underline{y} is a vector of observations from a normal distribution with parameters mean=μ\mu and sd=σ\sigma. See the help file for LognormalAlt for the relationship between θ,τ,η,μ\theta, \tau, \eta, \mu, and σ\sigma.

Estimation
This section explains how each of the estimators of mean=θ\theta and cv=τ\tau are computed. The approach is to first compute estimates of θ\theta and η2\eta^2 (the mean and variance of the lognormal distribution), say θ̂\hat{\theta} and η̂2\hat{\eta}^2, then compute the estimate of the cv τ\tau by τ̂=η̂/θ̂\hat{\tau} = \hat{\eta}/\hat{\theta}.

Minimum Variance Unbiased Estimation (method="mvue")
The minimum variance unbiased estimators (mvue’s) of θ\theta and η2\eta^2 were derived by Finney (1941) and are discussed in Gilbert (1987, pp. 164-167) and Cohn et al. (1989). These estimators are computed as:

θ̂mvue=ey‾gn−1(s22)(1) \hat{\theta}_{mvue} = e^{\bar{y}} g_{n-1}(\frac{s^2}{2}) \;\;\;\; (1)

η̂mvue2=e2y‾{gn−1(2s2)−gn−1[(n−2)s2n−1]}(2) \hat{\eta}^2_{mvue} = e^{2 \bar{y}} \{g_{n-1}(2s^2) - g_{n-1}[\frac{(n-2)s^2}{n-1}]\} \;\;\;\; (2)

where

y‾=1n∑i=1nyi(3) \bar{y} = \frac{1}{n} \sum_{i=1}^n y_i \;\;\;\; (3)

s2=1n−1∑i=1n(yi−y‾)2(4) s^2 = \frac{1}{n-1} \sum_{i=1}^n (y_i - \bar{y})^2 \;\;\;\; (4)

gm(z)=∑i=0∞mi(m+2i)m(m+2)⋯(m+2i)(mm+1)i(zii!)(5) g_m(z) = \sum_{i=0}^\infty \frac{m^i (m+2i)}{m(m+2) \cdots (m+2i)} (\frac{m}{m+1})^i (\frac{z^i}{i!}) \;\;\;\; (5)

The expected value and variance of the mvue of θ\theta are (Bradu and Mundlak, 1970; Cohn et al., 1989):

E[θ̂mvue]=θ(6) E[\hat{\theta}_{mvue}] = \theta \;\;\;\; (6)

Var[θ̂mvue]=e2μ{e[(2+n−1)σ2]/ngn−1(σ44n)−eσ2}(7) Var[\hat{\theta}_{mvue}] = e^{2\mu} \{e^{[(2+n-1)\sigma^2]/n} g_{n-1}(\frac{\sigma^4}{4n}) - e^{\sigma^2} \} \;\;\;\; (7)

Maximum Likelihood Estimation (method="mle")
The maximum likelihood estimators (mle’s) of θ\theta and η2\eta^2 are given by:

θ̂mle=exp(y‾+σ̂mle22)(8) \hat{\theta}_{mle} = exp(\bar{y} + \frac{\hat{\sigma}^2_{mle}}{2}) \;\;\;\; (8)

η̂mle2=θ̂mle2τ̂mle2(9) \hat{\eta}^2_{mle} = \hat{\theta}^2_{mle} \hat{\tau}^2_{mle} \;\;\;\; (9)

where

τ̂mle2=exp(σ̂mle2)−1(10) \hat{\tau}^2_{mle} = exp(\hat{\sigma}^2_{mle}) - 1 \;\;\;\; (10)

σ̂mle2=n−1ns2(11) \hat{\sigma}^2_{mle} = \frac{n-1}{n} s^2 \;\;\;\; (11)

The expected value and variance of the mle of θ\theta are (after Cohn et al., 1989):

E[θ̂mle]=θexp[−(n−1)σ22n](1−σ2n)−(n−1)/2(12) E[\hat{\theta}_{mle}] = \theta exp[\frac{-(n-1)\sigma^2}{2n}] (1 - \frac{\sigma^2}{n})^{-(n-1)/2} \;\;\;\; (12)

Var[θ̂mle]=exp(2μ+σ2n){exp(σ2n)[1−2σ2n]−(n−1)/2−[1−σ2n]−(n−1)}(13) Var[\hat{\theta}_{mle}] = exp(2\mu + \frac{\sigma^2}{n}) \{exp(\frac{\sigma^2}{n}) [1 - \frac{2\sigma^2}{n}]^{-(n-1)/2} - [1 - \frac{\sigma^2}{n}]^{-(n-1)} \} \;\;\;\; (13)

As can be seen from equation (12), the expected value of the mle of θ\theta does not exist when σ2>n\sigma^2 > n. In general, the pp’th moment of the mle of θ\theta does not exist when σ2>n/p\sigma^2 > n/p.

Quasi Maximum Likelihood Estimation (method="qmle")
The quasi maximum likelihood estimators (qmle’s; Cohn et al., 1989; Gilbert, 1987, p.167) of θ\theta and η2\eta^2 are the same as the mle’s, except the mle of σ2\sigma^2 in equations (8) and (10) is replaced with the more commonly used mvue of σ2\sigma^2 shown in equation (4):

θ̂qmle=exp(y‾+s22)(14) \hat{\theta}_{qmle} = exp(\bar{y} + \frac{s^2}{2}) \;\;\;\; (14)

η̂qmle2=θ̂qmle2τ̂qmle2(15) \hat{\eta}^2_{qmle} = \hat{\theta}^2_{qmle} \hat{\tau}^2_{qmle} \;\;\;\; (15)

τ̂qmle2=exp(s2)−1(16) \hat{\tau}^2_{qmle} = exp(s^2) - 1 \;\;\;\; (16)

The expected value and variance of the qmle of θ\theta are (Cohn et al., 1989):

E[θ̂mle]=θexp[−(n−1)σ22n](1−σ2n−1)−(n−1)/2(17) E[\hat{\theta}_{mle}] = \theta exp[\frac{-(n-1)\sigma^2}{2n}] (1 - \frac{\sigma^2}{n-1})^{-(n-1)/2} \;\;\;\; (17)

Var[θ̂mle]=exp(2μ+σ2n){exp(σ2n)[1−2σ2n−1]−(n−1)/2−[1−σ2n−1]−(n−1)}(18) Var[\hat{\theta}_{mle}] = exp(2\mu + \frac{\sigma^2}{n}) \{exp(\frac{\sigma^2}{n}) [1 - \frac{2\sigma^2}{n-1}]^{-(n-1)/2} - [1 - \frac{\sigma^2}{n-1}]^{-(n-1)} \} \;\;\;\; (18)

As can be seen from equation (17), the expected value of the qmle of θ\theta does not exist when σ2>(n−1)\sigma^2 > (n - 1). In general, the pp’th moment of the mle of θ\theta does not exist when σ2>(n−1)/p\sigma^2 > (n - 1)/p.

Note that Gilbert (1987, p. 167) incorrectly presents equation (12) rather than equation (17) as the expected value of the qmle of θ\theta. For large values of nn relative to σ2\sigma^2, however, equations (12) and (17) are virtually identical.

Method of Moments Estimation (method="mme")
The method of moments estimators (mme’s) of θ\theta and η2\eta^2 are found by equating the sample mean and variance with their population values:

θ̂mme=x‾=1n∑i=1nxi(19) \hat{\theta}_{mme} = \bar{x} = \frac{1}{n} \sum_{i=1}^n x_i \;\;\;\; (19)

η̂mme=1n∑i=1n(xi−x‾)2(20) \hat{\eta}_{mme} = \frac{1}{n} \sum_{i=1}^n (x_i - \bar{x})^2 \;\;\;\; (20)

Note that the estimator of variance in equation (20) is biased.

The expected value and variance of the mme of θ\theta are:

E[θ̂mme]=θ(21) E[\hat{\theta}_{mme}] = \theta \;\;\;\; (21)

Var[θ̂mme]=η2n=1nexp(2μ+σ2)[exp(σ2)−1](22) Var[\hat{\theta}_{mme}] = \frac{\eta^2}{n} = \frac{1}{n} exp(2\mu + \sigma^2) [exp(\sigma^2)-1] \;\;\;\; (22)

Method of Moments Estimation Based on the Unbiased Estimate of Variance (method="mmue")
These estimators are exactly the same as the method of moments estimators described above, except that the usual unbiased estimate of variance is used:

θ̂mmue=x‾=1n∑i=1nxi(23) \hat{\theta}_{mmue} = \bar{x} = \frac{1}{n} \sum_{i=1}^n x_i \;\;\;\; (23)

η̂mmue=1n−1∑i=1n(xi−x‾)2(24) \hat{\eta}_{mmue} = \frac{1}{n-1} \sum_{i=1}^n (x_i - \bar{x})^2 \;\;\;\; (24)

Since the mmue of θ\theta is equivalent to the mme of θ\theta, so are its mean and varaince.

Confidence Intervals
This section explains the different methods for constructing confidence intervals for θ\theta, the mean of the lognormal distribution.

Land’s Method (ci.method="land")
Land (1971, 1975) derived a method for computing one-sided (lower or upper) uniformly most accurate unbiased confidence intervals for θ\theta. A two-sided confidence interval can be constructed by combining an optimal lower confidence limit with an optimal upper confidence limit. This procedure for two-sided confidence intervals is only asymptotically optimal, but for most purposes should be acceptable (Land, 1975, p.387).

As shown in equation (3) in the help file for LognormalAlt, the mean θ\theta of a lognormal random variable is related to the mean μ\mu and standard deviation σ\sigma of the log-transformed random variable by the following relationship:

θ=eβ(25) \theta = e^{\beta} \;\;\;\; (25)

where

β=μ+σ22(26) \beta = \mu + \frac{\sigma^2}{2} \;\;\;\; (26)

Land (1971) developed confidence bounds for the quantity β\beta. The mvue of β\beta is given by:

β̂mvue=y‾+s22(27) \hat{\beta}_{mvue} = \bar{y} + \frac{s^2}{2} \;\;\;\; (27)

Note that θ̂qmle=exp(β̂mvue)\hat{\theta}_{qmle} = exp(\hat{\beta}_{mvue}). The (1−α)100%(1-\alpha)100\% two-sided confidence interval for β\beta is given by:

[β̂mvue+sCα/2n−1,β̂mvue+sC1−α/2n−1](28) [ \hat{\beta}_{mvue} + s \frac{C_{\alpha/2}}{\sqrt{n-1}}, \; \hat{\beta}_{mvue} + s \frac{C_{1-\alpha/2}}{\sqrt{n-1}} ] \;\;\;\; (28)

the (1−α)100%(1-\alpha)100\% one-sided upper confidence interval for β\beta is given by:

[−∞,β̂mvue+sC1−αn−1](29) [ -\infty, \; \hat{\beta}_{mvue} + s \frac{C_{1-\alpha}}{\sqrt{n-1}} ] \;\;\;\; (29)

and the (1−α)100%(1-\alpha)100\% one-sided lower confidence interval for β\beta is given by:

[β̂mvue+sCαn−1,∞](30) [ \hat{\beta}_{mvue} + s \frac{C_{\alpha}}{\sqrt{n-1}}, \; \infty ] \;\;\;\; (30)

where ss is the estimate of σ\sigma (see equation (4) above), and the factor CC is given in tables in Land (1975).

Thus, by equations (25)-(30), the two-sided (1−α)100%(1-\alpha)100\% confidence interval for θ\theta is given by:

{θ̂qmleexp[sCα/2n−1],θ̂qmleexp[sC1−α/2n−1]}(31) \{\hat{\theta}_{qmle} exp[s \frac{C_{\alpha/2}}{\sqrt{n-1}}], \; \hat{\theta}_{qmle} exp[s \frac{C_{1-\alpha/2}}{\sqrt{n-1}}] \} \;\;\;\; (31)

the (1−α)100%(1-\alpha)100\% one-sided upper confidence interval for θ\theta is given by:

{0,θ̂qmleexp[sC1−αn−1]}(32) \{ 0, \; \hat{\theta}_{qmle} exp[s \frac{C_{1-\alpha}}{\sqrt{n-1}}] \} \;\;\;\; (32)

and the (1−α)100%(1-\alpha)100\% one-sided lower confidence interval for θ\theta is given by:

{θ̂qmleexp[sCαn−1],∞}(33) \{\hat{\theta}_{qmle} exp[s \frac{C_{\alpha}}{\sqrt{n-1}} ], \; \infty \} \;\;\;\; (33)

Note that Gilbert (1987, pp. 169-171, 264-265) denotes the quantity CC above as HH and reproduces a subset of Land’s (1975) tables. Some guidance documents (e.g., USEPA, 1992d) refer to this quantity as the HH-statistic.

Zou et al.’s Method (ci.method="zou")
Zou et al. (2009) proposed the following approximation for the two-sided (1−α)100%(1-\alpha)100\% confidence intervals for θ\theta. The lower limit LLLL is given by:

LL=θ̂qmleexp{−[z1−α/22s2n+(s22−(n−1)s22χ1−α/2,n−12)2]1/2}(34) LL = \hat{\theta}_{qmle} exp\{ -[\frac{z^2_{1-\alpha/2}s^2}{n} + (\frac{s^2}{2} - \frac{(n-1)s^2}{2\chi^2_{1-\alpha/2, n-1}})^2]^{1/2}\} \;\;\;\; (34)

and the upper limit ULUL is given by:

UL=θ̂qmleexp{[z1−α/22s2n+((n−1)s22χα/2,n−12−s22)2]1/2}(35) UL = \hat{\theta}_{qmle} exp\{ [\frac{z^2_{1-\alpha/2}s^2}{n} + (\frac{(n-1)s^2}{2\chi^2_{\alpha/2, n-1}} - \frac{s^2}{2})^2]^{1/2}\} \;\;\;\; (35)

where zpz_p denotes the pp’th quantile of the standard normal distribuiton, and χp,ν\chi_{p, \nu} denotes the pp’th quantile of the chi-square distribution with ν\nu degrees of freedom. The (1−α)100%(1-\alpha)100\% one-sided lower confidence limit and one-sided upper confidence limit are given by equations (34) and (35), respectively, with α/2\alpha/2 replaced by α\alpha.

Parkin et al.’s Method (ci.method="parkin")
This method was developed by Parkin et al. (1990). It can be shown that the mean of a lognormal distribution corresponds to the pp’th quantile, where

p=Φ(σ2)(36) p = \Phi(\frac{\sigma}{2}) \;\;\;\; (36)

and Φ\Phi denotes the cumulative distribution function of the standard normal distribution. Parkin et al. (1990) suggested estimating pp by replacing σ\sigma in equation (36) with the estimate ss as computed in equation (4). Once an estimate of pp is obtained, a nonparametric confidence interval can be constructed for pp, assuming pp is equal to its estimated value (see eqnpar).

Cox’s Method (ci.method="cox")
This method was suggested by Professor D.R. Cox and is illustrated in Land (1972). El-Shaarawi (1989) adapts this method to the case of censored water quality data. Cox’s idea is to construct an approximate (1−α)100%(1-\alpha)100\% confidence interval for the quantity β\beta defined in equation (26) above assuming the estimate of β\beta is approximately normally distributed, and then exponentiate the confidence limits. That is, a two-sided (1−α)100%(1-\alpha)100\% confidence interval for θ\theta is constructed as:

[exp(β̂−t1−α/2,n−1σ̂β̂),exp(β̂+t1−α/2,n−1σ̂β̂)](37) [exp(\hat{\beta} - t_{1-\alpha/2, n-1}\hat{\sigma}_{\hat{\beta}}), \; exp(\hat{\beta} + t_{1-\alpha/2, n-1}\hat{\sigma}_{\hat{\beta}})] \;\;\;\; (37)

where t(p,ν)t(p, \nu) denotes the pp’th quantile of Student’s t-distribution with ν\nu degrees of freedom. Note that this method, unlike the normal approximation method discussed below, guarantees a positive value for the lower confidence limit. One-sided confidence intervals are computed in a similar fashion.

Define an estimator of β\beta by:

β̂=μ̂+σ̂22(38) \hat{\beta} = \hat{\mu} + \frac{\hat{\sigma}^2}{2} \;\;\;\; (38)

Then the variance of this estimator is given by:

Var(β̂)=Var(μ̂)+Cov(μ̂,σ̂2)+14Var(σ̂2)(39) Var(\hat{\beta}) = Var(\hat{\mu}) + Cov(\hat{\mu}, \hat{\sigma}^2) + \frac{1}{4}Var(\hat{\sigma}^2) \;\;\;\; (39)

The function elnormAlt follows Land (1972) and uses the minimum variance unbiased estimator for β\beta shown in equation (27) above, so the variance and estimated variance of this estimator are:

Var(β̂mvue)=σ2n+σ42(n−1)(40) Var(\hat{\beta}_{mvue}) = \frac{\sigma^2}{n} + \frac{\sigma^4}{2(n-1)} \;\;\;\; (40)

σ̂β̂2=s2n+s42(n+1)(41) \hat{\sigma}^2_{\hat{\beta}} = \frac{s^2}{n} + \frac{s^4}{2(n+1)} \;\;\;\; (41)

Note that El-Shaarawi (1989, equation 5) simply replaces the value of s2s^2 in equation (41) with some estimator of σ2\sigma^2 (the mle or mvue of σ2\sigma^2), rather than using the mvue of the variance of β\beta as shown in equation (41).

Normal Approximation (ci.method="normal.approx") This method constructs approximate (1−α)100%(1-\alpha)100\% confidence intervals for θ\theta based on the assumption that the estimator of θ\theta is approximately normally distributed. That is, a two-sided (1−α)100%(1-\alpha)100\% confidence interval for θ\theta is constructed as:

[θ̂−t1−α/2,n−1σ̂θ̂,θ̂+t1−α/2,n−1σ̂θ̂](42) [\hat{\theta} - t_{1-\alpha/2, n-1}\hat{\sigma}_{\hat{\theta}}, \; \hat{\theta} + t_{1-\alpha/2, n-1}\hat{\sigma}_{\hat{\theta}}] \;\;\;\; (42)

One-sided confidence intervals are computed in a similar fashion.

When method="mvue" is used to estimate θ\theta, an unbiased estimate of the variance of the estimator of θ\theta is used in equation (42) (Bradu and Mundlak, 1970, equation 4.3; Gilbert, 1987, equation 13.5):

σ2̂θ̂=e2y‾{[gn−1(s22)]2−gn−1[s2(n−2)n−1]}(43) \hat{\sigma^2}_{\hat{\theta}} = e^{2\bar{y}} \{[g_{n-1}(\frac{s^2}{2})]^2 - g_{n-1}[\frac{s^2(n-2)}{n-1}] \} \;\;\;\; (43)

When method="mle" is used to estimate θ\theta, the estimate of the variance of the estimator of θ\theta is computed by replacing μ\mu and σ2\sigma^2 in equation (13) with their mle’s:

σ̂θ̂2=exp(2y‾+σ̂mle2n){exp(σ̂mle2n)[1−2σ̂mle2n]−(n−1)/2−[1−σ̂mle2n]−(n−1)}(44) \hat{\sigma}^2_{\hat{\theta}} = exp(2\bar{y} + \frac{\hat{\sigma}^2_{mle}}{n}) \{exp(\frac{\hat{\sigma}^2_{mle}}{n}) [1 - \frac{2\hat{\sigma}^2_{mle}}{n}]^{-(n-1)/2} - [1 - \frac{\hat{\sigma}^2_{mle}}{n}]^{-(n-1)} \} \;\;\;\; (44)

When method="qmle" is used to estimate θ\theta, the estimate of the variance of the estimator of θ\theta is computed by replacing μ\mu and σ2\sigma^2 in equation (18) with their mvue’s:

σ̂θ̂2=exp(2y‾+s2n){exp(s2n)[1−2s2n−1]−(n−1)/2−[1−s2n−1]−(n−1)}(45) \hat{\sigma}^2_{\hat{\theta}} = exp(2\bar{y} + \frac{s^2}{n}) \{exp(\frac{s^2}{n}) [1 - \frac{2 s^2}{n-1}]^{-(n-1)/2} - [1 - \frac{s^2}{n-1}]^{-(n-1)} \} \;\;\;\; (45)

Note that equation (45) is exactly the same as Gilbert’s (1987, p. 167) equation 13.8a, except that Gilbert (1987) erroneously uses nn where he should use n−1n-1 instead. For large values of nn relative to s2s^2, however, this makes little difference.

When method="mme", the estimate of the variance of the estimator of θ\theta is computed by replacing eta2eta^2 in equation (22) with the mme of η2\eta^2 defined in equation (20):

σ̂θ̂2=η̂mme2n=1n2∑i=1n(xi−x‾)2(46) \hat{\sigma}^2_{\hat{\theta}} = \frac{\hat{\eta}_{mme}^2}{n} = \frac{1}{n^2} \sum_{i=1}^n (x_i - \bar{x})^2 \;\;\;\; (46)

When method="mmue", the estimate of the variance of the estimator of θ\theta is computed by replacing eta2eta^2 in equation (22) with the mmue of η2\eta^2 defined in equation (24):

σ̂θ̂2=η̂mmue2n=1n(n−1)∑i=1n(xi−x‾)2(47) \hat{\sigma}^2_{\hat{\theta}} = \frac{\hat{\eta}_{mmue}^2}{n} = \frac{1}{n(n-1)} \sum_{i=1}^n (x_i - \bar{x})^2 \;\;\;\; (47)

elnorm3

Help topic: elnorm3.

If x contains any missing (NA), undefined (NaN) or infinite (Inf, -Inf) values, they will be removed prior to performing the estimation.

Let XX denote a random variable from a three-parameter lognormal distribution with parameters meanlog=μ\mu, sdlog=σ\sigma, and threshold=γ\gamma. Let x_\underline{x} denote a vector of nn observations from this distribution. Furthermore, let x(i)x_{(i)} denote the ii’th order statistic in the sample, so that x(1)x_{(1)} denotes the smallest value and x(n)x_{(n)} denote the largest value in x_\underline{x}. Finally, denote the sample mean and variance by:

x‾=1n∑i=1nxi(1) \bar{x} = \frac{1}{n} \sum_{i=1}^n x_i \;\;\;\; (1)

s2=1n−1∑i=1n(xi−x‾)2(2) s^2 = \frac{1}{n-1} \sum_{i=1}^n (x_i - \bar{x})^2 \;\;\;\; (2)

Note that the sample variance is the unbiased version. Denote the method of moments estimator of variance by:

sm2=1n∑i=1n(xi−x‾)2(3) s^2_m = \frac{1}{n} \sum_{i=1}^n (x_i - \bar{x})^2 \;\;\;\; (3)

Estimation

Local Maximum Likelihood Estimation (method="lmle")
Hill (1963) showed that the likelihood function approaches infinity as γ\gamma approaches x(1)x_{(1)}, so that the global maximum likelihood estimators of (μ,σ,γ)(\mu, \sigma, \gamma) are (−∞,∞,x(1))(-\infty, \infty, x_{(1)}), which are inadmissible, since γ\gamma must be smaller than x(1)x_{(1)}. Cohen (1951) suggested using local maximum likelihood estimators (lmle’s), derived by equating partial derivatives of the log-likelihood function to zero. These estimators were studied by Harter and Moore (1966), Calitz (1973), Cohen and Whitten (1980), and Griffiths (1980), and appear to possess most of the desirable properties ordinarily associated with maximum likelihood estimators.

Cohen (1951) showed that the lmle of γ\gamma is given by the solution to the following equation:

[∑i=1n1wi]{∑i=1nyi−∑i=1nyi2+1n[∑i=1nyi]2}−n∑i=1nyiwi=0(4) [\sum_{i=1}^n \frac{1}{w_i}] \, \{\sum_{i=1}^n y_i - \sum_{i=1}^n y_i^2 + \frac{1}{n}[\sum_{i=1}^n y_i]^2 \} - n \sum_{i=1}^n \frac{y_i}{w_i} = 0 \;\;\;\; (4)

where

wi=xi−γ̂(5) w_i = x_i - \hat{\gamma} \;\;\;\; (5)

yi=log(xi−γ̂)=log(wi)(6) y_i = log(x_i - \hat{\gamma}) = log(w_i) \;\;\;\; (6)

and that the lmle’s of μ\mu and σ\sigma then follow as:

μ̂=1n∑i=1nyi=y‾(7) \hat{\mu} = \frac{1}{n} \sum_{i=1}^n y_i = \bar{y} \;\;\;\; (7)

σ̂2=1n∑i=1n(yi−y‾)2(8) \hat{\sigma}^2 = \frac{1}{n} \sum_{i=1}^n (y_i - \bar{y})^2 \;\;\;\; (8)

Unfortunately, while equation (4) simplifies the task of computing the lmle’s, for certain data sets there still may be convergence problems (Calitz, 1973), and occasionally multiple roots of equation (4) may exist. When multiple roots to equation (4) exisit, Cohen and Whitten (1980) recommend using the one that results in closest agreement between the mle of μ\mu (equation (7)) and the sample mean (equation (1)).

On the other hand, Griffiths (1980) showed that for a given value of the threshold parameter γ\gamma, the maximized value of the log-likelihood (the “profile likelihood” for γ\gamma) is given by:

log[L(γ)]=−n2[1+log(2π)+2μ̂+log(σ̂2)](9) log[L(\gamma)] = \frac{-n}{2} [1 + log(2\pi) + 2\hat{\mu} + log(\hat{\sigma}^2) ] \;\;\;\; (9)

where the estimates of μ\mu and σ\sigma are defined in equations (7) and (8), so the lmle of γ\gamma reduces to an iterative search over the values of γ\gamma. Griffiths (1980) noted that the distribution of the lmle of γ\gamma is far from normal and that log[L(γ)]log[L(\gamma)] is not quadratic near the lmle of γ\gamma. He suggested a better parameterization based on

η=−log(x(1)−γ)(10) \eta = -log(x_{(1)} - \gamma) \;\;\;\; (10)

Thus, once the lmle of η\eta is found using equations (9) and (10), the lmle of γ\gamma is given by:

γ̂=x(1)−exp(−η̂)(11) \hat{\gamma} = x_{(1)} - exp(-\hat{\eta}) \;\;\;\; (11)

When method="lmle", the function elnorm3 uses the function nlminb to search for the minimum of −2log[L(η)]-2log[L(\eta)], using the modified method of moments estimator (method="mmme"; see below) as the starting value for γ\gamma. Equation (11) is then used to solve for the lmle of γ\gamma, and equation (4) is used to “fine tune” the estimated value of γ\gamma. The lmle’s of μ\mu and σ\sigma are then computed using equations (6)-(8).

Method of Moments Estimation (method="mme")
Denote the rr’th sample central moment by:

mr=1n∑i=1n(xi−x‾)r(12) m_r = \frac{1}{n} \sum_{i=1}^n (x_i - \bar{x})^r \;\;\;\; (12)

and note that

sm2=m2(13) s^2_m = m_2 \;\;\;\; (13)

Equating the sample first moment (the sample mean) with its population value (the population mean), and equating the second and third sample central moments with their population values yields (Johnson et al., 1994, p.228):

x‾=γ+βω(14) \bar{x} = \gamma + \beta \sqrt{\omega} \;\;\;\; (14)

m2=sm2=β2ω(ω−1)(15) m_2 = s^2_m = \beta^2 \omega (\omega - 1) \;\;\;\; (15)

m3=β3ω3/2(ω−1)2(ω+2)(16) m_3 = \beta^3 \omega^{3/2} (\omega - 1)^2 (\omega + 2) \;\;\;\; (16)

where

β=exp(μ)(17) \beta = exp(\mu) \;\;\;\; (17)

ω=exp(σ2)(18) \omega = exp(\sigma^2) \;\;\;\; (18)

Combining equations (15) and (16) yields:

b1=m3m23/2=(ω+2)ω−1(19) b_1 = \frac{m_3}{m_2^{3/2}} = (\omega + 2) \sqrt{\omega - 1} \;\;\;\; (19)

The quantity on the left-hand side of equation (19) is the usual estimator of skewness. Solving equation (19) for ω\omega yields:

ω̂=(d+h)1/3+(d−h)1/3−1(20) \hat{\omega} = (d + h)^{1/3} + (d - h)^{1/3} - 1 \;\;\;\; (20)

where

d=1+b12(21) d = 1 + \frac{b_1}{2} \;\;\;\; (21)

h=sqrtd2−1(22) h = sqrt{d^2 - 1} \;\;\;\; (22)

Using equation (18), the method of moments estimator of σ\sigma is then computed as:

σ̂2=log(ω̂)(23) \hat{\sigma}^2 = log(\hat{\omega}) \;\;\;\; (23)

Combining equations (15) and (17), the method of moments estimator of μ\mu is computed as:

μ̂=12log[sm2omegâ(ω̂−1)](24) \hat{\mu} = \frac{1}{2} log[\frac{s^2_m}{\hat{omega}(\hat{\omega} - 1)}] \;\;\;\; (24)

Finally, using equations (14), (17), and (18), the method of moments estimator of γ\gamma is computed as:

x‾−exp(mû+σ̂22)(25) \bar{x} - exp(\hat{mu} + \frac{\hat{\sigma}^2}{2}) \;\;\;\; (25)

There are two major problems with using method of moments estimators for the three-parameter lognormal distribution. First, they are subject to very large sampling error due to the use of second and third sample moments (Cohen, 1988, p.121; Johnson et al., 1994, p.228). Second, Heyde (1963) showed that the lognormal distribution is not uniquely determined by its moments.

Method of Moments Estimators Using an Unbiased Estimate of Variance (method="mmue")
This method of estimation is exactly the same as the method of moments (method="mme"), except that the unbiased estimator of variance (equation (3)) is used in place of the method of moments one (equation (4)). This modification is given in Cohen (1988, pp.119-120).

Modified Method of Moments Estimation (method="mmme")
This method of estimation is described by Cohen (1988, pp.125-132). It was introduced by Cohen and Whitten (1980; their MME-II with r=1) and was further investigated by Cohen et al. (1985). It is motivated by the fact that the first order statistic in the sample, x(1)x_{(1)}, contains more information about the threshold parameter γ\gamma than any other observation and often more information than all of the other observations combined (Cohen, 1988, p.125).

The first two sets of equations are the same as for the modified method of moments estimators (method="mmme"), i.e., equations (14) and (15) with the unbiased estimator of variance (equation (3)) used in place of the method of moments one (equation (4)). The third equation replaces equation (16) by equating a function of the first order statistic with its expected value:

log(x(1)−γ)=μ+σE[Z(1,n)](26) log(x_{(1)} - \gamma) = \mu + \sigma E[Z_{(1,n)}] \;\;\;\; (26)

where E[Z(i,n)]E[Z_{(i,n)}] denotes the expected value of the ii’th order statistic in a random sample of nn observations from a standard normal distribution. (See the help file for evNormOrdStats for information on how E[Z(i,n)]E[Z_{(i,n)}] is computed.) Using equations (17) and (18), equation (26) can be rewritten as:

x(1)=γ+βexp{log(ω)E[Z(i,n)]}(27) x_{(1)} = \gamma + \beta exp\{\sqrt{log(\omega)} \, E[Z_{(i,n)}] \} \;\;\;\; (27)

Combining equations (14), (15), (17), (18), and (27) yields the following equation for the estimate of ω\omega:

s2[x‾−x(1)]2=ω̂(ω̂−1)[ω̂−exp{log(ω)E[Z(i,n)]}]2(28) \frac{s^2}{[\bar{x} - x_{(1)}]^2} = \frac{\hat{\omega}(\hat{\omega} - 1)}{[\sqrt{\hat{\omega}} - exp\{\sqrt{log(\omega)} \, E[Z_{(i,n)}] \} ]^2} \;\;\;\; (28)

After equation (28) is solved for ω̂\hat{\omega}, the estimate of σ\sigma is again computed using equation (23), and the estimate of μ\mu is computed using equation (24), where the unbiased estimate of variaince is used in place of the biased one (just as for method="mmue").

Zero-Skewness Estimation (method="zero.skew")
This method of estimation was introduced by Griffiths (1980), and elaborated upon by Royston (1992b). The idea is that if the threshold parameter γ\gamma were known, then the distribution of:

Y=log(X−γ)(29) Y = log(X - \gamma) \;\;\;\; (29)

is normal, so the skew of YY is 0. Thus, the threshold parameter γ\gamma is estimated as that value that forces the sample skew (defined in equation (19)) of the observations defined in equation (6) to be 0. That is, the zero-skewness estimator of γ\gamma is the value that satisfies the following equation:

0=1n∑i=1n(yi−y‾)3[1n∑i=1n(yi−y‾)2]3/2(30) 0 = \frac{\frac{1}{n} \sum_{i=1}^n (y_i - \bar{y})^3}{[\frac{1}{n} \sum_{i=1}^n (y_i - \bar{y})^2]^{3/2}} \;\;\;\; (30)

where

yi=log(xi−γ̂)(31) y_i = log(x_i - \hat{\gamma}) \;\;\;\; (31)

Note that since the denominator in equation (30) is always positive (assuming there are at least two unique values in x_\underline{x}), only the numerator needs to be used to determine the value of γ̂\hat{\gamma}.

Once the value of γ̂\hat{\gamma} has been determined, μ\mu and σ\sigma are estimated using equations (7) and (8), except the unbiased estimator of variance is used in equation (8).

Royston (1992b) developed a modification of the Shaprio-Wilk goodness-of-fit test for normality based on tranforming the data using equation (6) and the zero-skewness estimator of γ\gamma (see gofTest).

Estimators Based on Royston’s Index of Skewness (method="royston.skew")
This method of estimation is discussed by Royston (1992b), and is similar to the zero-skewness method discussed above, except a different measure of skewness is used. Royston’s (1992b) index of skewness is given by:

q=y(n)−ỹỹ−y(1)(32) q = \frac{y_{(n)} - \tilde{y}}{\tilde{y} - y_{(1)}} \;\;\;\; (32)

where y(i)y_{(i)} denotes the ii’th order statistic of yy and yy is defined in equation (31) above, and ỹ\tilde{y} denotes the median of yy. Royston (1992b) shows that the value of γ\gamma that yields a value of q=0q=0 is given by:

γ̂=y(1)y(n)−ỹ2y(1)+y(n)−2ỹ(33) \hat{\gamma} = \frac{y_{(1)}y_{(n)} - \tilde{y}^2}{y_{(1)} + y_{(n)} - 2\tilde{y}} \;\;\;\; (33)

Again, as for the zero-skewness method, once the value of γ̂\hat{\gamma} has been determined, μ\mu and σ\sigma are estimated using equations (7) and (8), except the unbiased estimator of variance is used in equation (8).

Royston (1992b) developed this estimator as a quick way to estimate γ\gamma.

Confidence Intervals
This section explains three different methods for constructing confidence intervals for the threshold parameter γ\gamma, or the median of the three-parameter lognormal distribution, which is given by:

Med[X]=γ+exp(μ)=γ+β(34) Med[X] = \gamma + exp(\mu) = \gamma + \beta \;\;\;\; (34)

Normal Approximation Based on Asymptotic Variances and Covariances (ci.method="avar")
Formulas for asymptotic variances and covariances for the three-parameter lognormal distribution, based on the information matrix, are given in Cohen (1951), Cohen and Whitten (1980), Cohen et al., (1985), and Cohen (1988). The relevant quantities for γ\gamma and the median are:

Var(γ̂)=σγ̂2=σ2n(β2ω)H(35) Var(\hat{\gamma}) = \sigma^2_{\hat{\gamma}} = \frac{\sigma^2}{n} \, (\frac{\beta^2}{\omega}) H \;\;\;\; (35)

Var(β̂)=σβ̂2=σ2nβ2(1+H)(36) Var(\hat{\beta}) = \sigma^2_{\hat{\beta}} = \frac{\sigma^2}{n} \, \beta^2 (1 + H) \;\;\;\; (36)

Cov(γ̂,β̂)=σγ̂,β̂=−σ3n(β2ω)H(37) Cov(\hat{\gamma}, \hat{\beta}) = \sigma_{\hat{\gamma}, \hat{\beta}} = \frac{-\sigma^3}{n} \, (\frac{\beta^2}{\sqrt{\omega}}) H \;\;\;\; (37)

where

H=[ω(1+σ2)−2σ2−1]−1(38) H = [\omega (1 + \sigma^2) - 2\sigma^2 - 1]^{-1} \;\;\;\; (38)

A two-sided (1−α)100%(1-\alpha)100\% confidence interval for γ\gamma is computed as:

γ̂−tn−2,1−α/2σ̂γ̂,γ̂+tn−2,1−α/2σ̂γ̂(39) \hat{\gamma} - t_{n-2, 1-\alpha/2} \hat{\sigma}_{\hat{\gamma}}, \, \hat{\gamma} + t_{n-2, 1-\alpha/2} \hat{\sigma}_{\hat{\gamma}} \;\;\;\; (39)

where tν,pt_{\nu, p} denotes the pp’th quantile of Student’s t-distribution with nn degrees of freedom, and the quantity σ̂γ̂\hat{\sigma}_{\hat{\gamma}} is computed using equations (35) and (38) and substituting estimated values of β\beta, ω\omega, and σ\sigma. One-sided confidence intervals are computed in a similar manner.

A two-sided (1−α)100%(1-\alpha)100\% confidence interval for the median (see equation (34) above) is computed as:

γ̂+β̂−tn−2,1−α/2σ̂γ̂+β̂,γ̂+β̂+tn−2,1−α/2σ̂γ̂+β̂(40) \hat{\gamma} + \hat{\beta} - t_{n-2, 1-\alpha/2} \hat{\sigma}_{\hat{\gamma} + \hat{\beta}}, \, \hat{\gamma} + \hat{\beta} + t_{n-2, 1-\alpha/2} \hat{\sigma}_{\hat{\gamma} + \hat{\beta}} \;\;\;\; (40)

where

σ̂γ̂+β̂2=σ̂γ̂2+σ̂β̂2+σ̂γ̂,β̂(41) \hat{\sigma}^2_{\hat{\gamma} + \hat{\beta}} = \hat{\sigma}^2_{\hat{\gamma}} + \hat{\sigma}^2_{\hat{\beta}} + \hat{\sigma}_{\hat{\gamma}, \hat{\beta}} \;\;\;\; (41)

is computed using equations (35)-(38) and substituting estimated values of β\beta, ω\omega, and σ\sigma. One-sided confidence intervals are computed in a similar manner.

This method of constructing confidence intervals is analogous to using the Wald test (e.g., Silvey, 1975, pp.115-118) to test hypotheses on the parameters.

Because of the regularity problems associated with the global maximum likelihood estimators, it is questionble whether the asymptotic variances and covariances shown above apply to local maximum likelihood estimators. Simulation studies, however, have shown that these estimates of variance and covariance perform reasonably well (Harter and Moore, 1966; Cohen and Whitten, 1980).

Note that this method of constructing confidence intervals can be used with estimators other than the lmle’s. Cohen and Whitten (1980) and Cohen et al. (1985) found that the asymptotic variances and covariances are reasonably close to corresponding simulated variances and covariances for the modified method of moments estimators (method="mmme").

Likelihood Profile (ci.method="likelihood.profile")
Griffiths (1980) suggested constructing confidence intervals for the threshold parameter γ\gamma based on the profile likelihood function given in equations (9) and (10). Royston (1992b) further elaborated upon this procedure. A two-sided (1−α)100%(1-\alpha)100\% confidence interval for η\eta is constructed as:

[ηLCL,ηUCL](42) [\eta_{LCL}, \eta_{UCL}] \;\;\;\; (42)

by finding the two values of η\eta (one larger than the lmle of η\eta and one smaller than the lmle of η\eta) that satisfy:

log[L(η)]=log[L(η̂lmle)]−12χ1,α/22(43) log[L(\eta)] = log[L(\hat{\eta}_{lmle})] - \frac{1}{2} \chi^2_{1, \alpha/2} \;\;\;\; (43)

where χν,p2\chi^2_{\nu, p} denotes the pp’th quantile of the chi-square distribution with ν\nu degrees of freedom. Once these values are found, the two-sided confidence for γ\gamma is computed as:

[γLCL,γUCL](44) [\gamma_{LCL}, \gamma_{UCL}] \;\;\;\; (44)

where

γLCL=x(1)−exp(−ηLCL)(45) \gamma_{LCL} = x_{(1)} - exp(-\eta_{LCL}) \;\;\;\; (45)

γUCL=x(1)−exp(−ηUCL)(46) \gamma_{UCL} = x_{(1)} - exp(-\eta_{UCL}) \;\;\;\; (46)

One-sided intervals are construced in a similar manner.

This method of constructing confidence intervals is analogous to using the likelihood-ratio test (e.g., Silvey, 1975, pp.108-115) to test hypotheses on the parameters.

To construct a two-sided (1−α)100%(1-\alpha)100\% confidence interval for the median (see equation (34)), Royston (1992b) suggested the following procedure:

  1. Construct a confidence interval for γ\gamma using the likelihood profile procedure.

  2. Construct a confidence interval for β\beta as:

    [βLCL,βUCL]=[exp(μ̂−tn−2,1−α/2σ̂n),exp(μ̂+tn−2,1−α/2σ̂n)](47) [\beta_{LCL}, \beta_{UCL}] = [exp(\hat{\mu} - t_{n-2, 1-\alpha/2} \frac{\hat{\sigma}}{n}), \, exp(\hat{\mu} + t_{n-2, 1-\alpha/2} \frac{\hat{\sigma}}{n})] \;\;\;\; (47)

  3. Construct the confidence interval for the median as:

    [γLCL+βLCL,γUCL+βUCL](48) [\gamma_{LCL} + \beta_{LCL}, \gamma_{UCL} + \beta_{UCL}] \;\;\;\; (48)

Royston (1992b) actually suggested using the quantile from the standard normal distribution instead of Student’s t-distribution in step 2 above. The function elnorm3, however, uses the Student’s t quantile.

Note that this method of constructing confidence intervals can be used with estimators other than the lmle’s.

Royston’s Confidence Interval Based on Significant Skewness (ci.method="skewness")
Royston (1992b) suggested constructing confidence intervals for the threshold parameter γ\gamma based on the idea behind the zero-skewness estimator (method="zero.skew"). A two-sided (1−α)100%(1-\alpha)100\% confidence interval for γ\gamma is constructed by finding the two values of γ\gamma that yield a p-value of α/2\alpha/2 for the test of zero-skewness on the observations y_\underline{y} defined in equation (6) (see gofTest). One-sided confidence intervals are constructed in a similar manner.

To construct (1−α)100%(1-\alpha)100\% confidence intervals for the median (see equation (34)), the exact same procedure is used as for ci.method="likelihood.profile", except that the confidence interval for γ\gamma is based on the zero-skewness method just described instead of the likelihood profile method.

HoskingEtAl1985

Help topic: HoskingEtAl1985.

Abstract
Hosking et al. (1985) use the method of probability-weighted moments, introduced by Greenwood et al. (1979), to estimate the parameters of the generalized extreme value distribution (GEVD) with parameters location=η\eta, scale=θ\theta, and shape=κ\kappa. Hosking et al. (1985) derive the asymptotic distributions of the probability-weighted moment estimators (PWME), and compare the asymptotic and small-sample statistical properties (via computer simulation) of the PWME with maximum likelihood estimators (MLE) and Jenkinson’s (1969) method of sextiles estimators (JSE). They also compare the statistical properties of quantile estimators (which are based on the distribution parameter estimators). Finally, they derive a test of the null hypothesis that the shape parameter is zero, and assess its performance via computer simulation.

Hosking et al. (1985) note that when κ≤−1\kappa \le -1, the moments and probability-weighted moments of the GEVD do not exist. They also note that in practice the shape parameter usually lies between -1/2 and 1/2.

Hosking et al. (1985) found that the asymptotic efficiency of the PWME (the limit as the sample size approaches infinity of the ratio of the variance of the MLE divided by the variance of the PWME) tends to 0 as the shape parameter approaches 1/2 or -1/2. For values of κ\kappa within the range [−0.2,0.2][-0.2, 0.2], however, the efficiency of the estimator of location is close to 100%, and the efficiency of the estimators of scale and shape are greater than 70%. With respect to estimating large quantiles, Hosking et al. (1985) found that the asymptotic efficiency of the PWME is poor for κ\kappa outside the range [−0.2,0.2][-0.2, 0.2].

For the small sample results, Hosking et al. (1985) considered several possible forms of the PWME (see equations (8)-(10) below). The best overall results were given by the plotting-position PWME defined by equations (9) and (10) with a=0.35a=0.35 and b=0b=0.

Small sample results for estimating the parameters show that for n≥50n \ge 50 all three methods give almost identical results. For n<50n < 50 the results for the different estimators are a bit different, but not dramatically so. The MLE tends to be slightly less biased than the other two methods. For estimating the shape parameter, the MLE has a slightly larger standard deviation, and the PWME has consistently the smallest standard deviation.

Small sample results for estimating large quantiles show that for n≥100n \ge 100 all three methods are comparable. For n<100n < 100 the PWME and JSE are comparable and in general have much smaller standard deviations than the MLE. All three methods are very inaccurate for estimating large quantiles in small samples, especially when κ<0\kappa < 0.

Hosking et al. (1985) derive a test of the null hypothesis H0:κ=0H_0: \kappa=0 based on the PWME of κ\kappa. The test is performed by computing the statistic:

z=κpwmê0.5663/n(1) z = \frac{\hat{\kappa_{pwme}}}{\sqrt{0.5663/n}} \;\;\;\; (1)

and comparing zz to a standard normal distribution (see zTestGevdShape). Based on computer simulations using the plotting-position PWME, they found that a sample size of n≥25n \ge 25 ensures an adequate normal approximation. They also found this test has power comparable to the modified likelihood-ratio test, which was found by Hosking (1984) to be the best overall test of H0:κ=0H_0: \kappa=0 of the thirteen tests he considered.

More Details

Probability-Weighted Moments and Parameters of the GEVD
The definition of a probability-weighted moment, introduced by Greenwood et al. (1979), is as follows. Let XX denote a random variable with cdf FF, and let x(p)x(p) denote the pp’th quantile of the distribution. Then the ijkijk’th probability-weighted moment is given by:

M(i,j,k)=E[XiFj(1−F)k]=∫01[x(F)]iFj(1−F)kdF(2) M(i, j, k) = E[X^i F^j (1 - F)^k] = \int^1_0 [x(F)]^i F^j (1 - F)^k \, dF \;\;\;\; (2)

where ii, jj, and kk are real numbers.

Hosking et al. (1985) set

βj=M(i,j,0)(3) \beta_j = M(i, j, 0) \;\;\;\; (3)

and Greenwood et al. (1979) show that

βj=1j+1E[Xj+1:j+1](4) \beta_j = \frac{1}{j+1} E[X_{j+1:j+1}] \;\;\;\; (4)

where

E[Xj+1:j+1] E[X_{j+1:j+1}]

denotes the expected value of the j+1j+1’th order statistic (i.e., the maximum) in a sample of size j+1j+1. Hosking et al. (1985) show that if XX has a GEVD with parameters location=η\eta, scale=θ\theta, and shape=κ\kappa, where κ≠0\kappa \ne 0, then

βj=1j+1{η+θ[1−(j+1)−κΓ(1+κ)]κ}(5) \beta_j = \frac{1}{j+1} \{\eta + \frac{\theta [1 - (j+1)^{-\kappa} \Gamma(1+\kappa)]}{\kappa} \} \;\;\;\; (5)

for κ>−1\kappa > -1, where Γ()\Gamma() denotes the gamma function. Thus,

β0=η+θ[1−Γ(1+κ)]κ(6) \beta_0 = \eta + \frac{\theta [1 - \Gamma(1+\kappa)]}{\kappa} \;\;\;\; (6)

2β1−β0=θ[Γ(1+κ)](1−2−κ)κ(7) 2\beta_1 - \beta_0 = \frac{\theta [\Gamma(1+\kappa)] (1 - 2^{-\kappa})}{\kappa} \;\;\;\; (7)

3β2−β02β1−β0=1−3−κ1−2−kappa(8) \frac{3\beta_2 - \beta_0}{2\beta_1 - \beta_0} = \frac{1 - 3^{-\kappa}}{1 - 2^{-kappa}} \;\;\;\; (8)

Estimating Distribution Parameters
Using the results of Landwehr et al. (1979), Hosking et al. (1985) show that given a random sample of nn values from some arbitrary distribution, an unbiased, distribution-free, and parameter-free estimator of the probability-weighted moment βj=M(i,j,0)\beta_j = M(i, j, 0) defined above is given by:

bj=1n∑i=j+1nxi,n(i−1j)(n−1j)(9) b_j = \frac{1}{n} \sum^n_{i=j+1} x_{i,n} \frac{{i-1 \choose j}}{{n-1 \choose j}} \;\;\;\; (9)

where the quantity xi,nx_{i,n} denotes the ii’th order statistic in the random sample of size nn. Hosking et al. (1985) note that this estimator is closely related to U-statistics (Hoeffding, 1948; Lehmann, 1975, pp. 362-371).

An alternative “plotting position” estimator is given by:

β̂j[pi,n]=1n∑i=1npi,njxi,n(10) \hat{\beta}_j[p_{i,n}] = \frac{1}{n} \sum^n_{i=1} p^j_{i,n} x_{i,n} \;\;\;\; (10)

where

pi,n=F̂(xi,n)(11) p_{i,n} = \hat{F}(x_{i,n}) \;\;\;\; (11)

denotes the plotting position of the ii’th order statistic in the random sample of size nn, that is, a distribution-free estimate of the cdf of XX evaluated at the ii’th order statistic. Typically, plotting positions have the form:

pi,n=i−an+b(12) p_{i,n} = \frac{i-a}{n+b} \;\;\;\; (12)

where b>−a>−1b > -a > -1. For this form of plotting position, the plotting-position estimators in (10) are asymptotically equivalent to the U-statistic estimators in (9).

Although the unbiased and plotting position estimators are asymptotically equivalent (Hosking, 1990), Hosking and Wallis (1995) recommend using the unbiased estimator for almost all applications because of its superior performance in small and moderate samples.

Using equations (6)-(8) above, i.e., the three equations involving β0\beta_0, β1\beta_1, and β2\beta_2, Hosking et al. (1985) define the probability-weighted moment estimators of η\eta, θ\theta, and κ\kappa as the solutions to these three simultaneous equations, with the values of the probability-weighted moments replaced by their estimated values (using either the unbiased or plotting posistion estiamtors in (9) and (10) above). Hosking et al. (1985) note that the third equation (equation (8)) must be solved iteratively for the PWME of κ\kappa. Using the unbiased estimators of the PWMEs to solve for κ\kappa, the PWMEs of η\eta and θ\theta are given by:

η̂pwme=b0+θ̂pwme[Γ(1+κ̂pwme)−1]κ̂pwme(13) \hat{\eta}_{pwme} = b_0 + \frac{\hat{\theta}_{pwme} [\Gamma(1 + \hat{\kappa}_{pwme}) - 1]}{\hat{\kappa}_{pwme}} \;\;\;\; (13)

θ̂pwme=(2b1−b0)κ̂pwmeΓ(1+κ̂pwme)(1−2−κ̂pwme)(14) \hat{\theta}_{pwme} = \frac{(2b_1 - b_0)\hat{\kappa}_{pwme}}{\Gamma(1 + \hat{\kappa}_{pwme}) (1 - 2^{-\hat{\kappa}_{pwme}})} \;\;\;\; (14)

Hosking et al. (1985) show that when the unbiased estimates of the PWMEs are used to estimate the probability-weighted moments, the estimates of θ\theta and κ\kappa satisfy the feasibility criteria

θ̂pwme>0;κ̂pwme>−1 \hat{\theta}_{pwme} > 0; \, \hat{\kappa}_{pwme} > -1

almost surely.

Hosking et al. (1985) show that the asymptotic distribution of the PWME is multivariate normal with mean equal to (η,θ,κ)(\eta, \theta, \kappa), and they derive the formula for the asymptotic variance-covariance matrix as:

Vη̂,θ̂,κ̂=1nGVβ̂0,β̂1,β̂2GT(15) V_{\hat{\eta}, \hat{\theta}, \hat{\kappa}} = \frac{1}{n} G V_{\hat{\beta}_0, \hat{\beta}_1, \hat{\beta}_2} G^T \;\;\;\; (15)

where

Vβ̂0,β̂1,β̂2 V_{\hat{\beta}_0, \hat{\beta}_1, \hat{\beta}_2}

denotes the variance-covariance matrix of the estimators of the probability-weighted moments defined in either equation (9) or (10) above (recall that these two estimators are asymptotically equivalent), and the matrix GG is defined by:

Gi1=∂η∂βi−1,Gi2=∂θ∂βi−1,Gi3=∂κ∂βi−1(16) G_{i1} = \frac{\partial \eta}{\partial \beta_{i-1}}, \, G_{i2} = \frac{\partial \theta}{\partial \beta_{i-1}}, \, G_{i3} = \frac{\partial \kappa}{\partial \beta_{i-1}} \;\;\;\; (16)

for i=1,2,3i = 1, 2, 3. Hosking et al. (1985) provide formulas for the matrix

Vβ̂0,β̂1,β̂2 V_{\hat{\beta}_0, \hat{\beta}_1, \hat{\beta}_2}

in Appendix C of their manuscript. Note that there is a typographical error in equation (C.11) (Jon Hosking, personal communication, 1996). In the second line of this equation, the quantity −(r+s)−k-(r+s)^{-k} should be replaced with −(r+s)−2k-(r+s)^{-2k}.

The matrix GG in equation (16) is not easily computed. Its inverse, however, is easy to compute and then can be inverted numerically (Jon Hosking, 1996, personal communication). The inverse of GG is given by:

Gi1−1=∂βi−1∂η,Gi2−1=∂βi−1∂θ,Gi3−1=∂βi−1∂κ(17) G^{-1}_{i1} = \frac{\partial \beta_{i-1}{\partial \eta}}, \, G^{-1}_{i2} = \frac{\partial \beta_{i-1}{\partial \theta}}, \, G^{-1}_{i3} = \frac{\partial \beta_{i-1}{\partial \kappa}} \;\;\;\; (17)

and by equation (5) above it can be shown that:

∂βj∂η=1j+1(18) \frac{\partial \beta_j}{\partial \eta} = \frac{1}{j+1} \;\;\;\; (18)

∂βj∂θ=1−(j+1)−κΓ(1+κ)(j+1)κ(19) \frac{\partial \beta_j}{\partial \theta} =\frac{1 - (j+1)^{-\kappa}\Gamma(1+\kappa)}{(j+1)\kappa} \;\;\;\; (19)

∂βj∂κ=θj+1{(j+1)−κ[log(j+1)Γ(1+κ)−Γ′(1+κ)]κ−1−(j+1)−κΓ(1+κ)κ2}(20) \frac{\partial \beta_j}{\partial \kappa} = \frac{\theta}{j+1} \{ \frac{(j+1)^{-\kappa}[log(j+1)\Gamma(1+\kappa)-\Gamma^{'}(1+\kappa)]}{\kappa} - \frac{1 - (j+1)^{-\kappa}\Gamma(1+\kappa)}{\kappa^2} \} \;\;\;\; (20)

for i=1,2,3i = 1, 2, 3.

Estimating Distribution Quantiles
If XX has a GEVD with parameters location=η\eta, scale=θ\theta, and shape=κ\kappa, where κ≠0\kappa \ne 0, then the pp’th quantile of the distribution is given by:

x(p)=η+θ{1−[−log(p)]κ}κ(21) x(p) = \eta + \frac{\theta \{1 - [-log(p)]^{\kappa} \}}{\kappa} \;\;\;\; (21)

(0≤p≤1)(0 \le p \le 1). Given estimated values of the location, scale, and shape parameters, the pp’th quantile of the distribution is estimated as:

x̂(p)=η̂+θ̂{1−[−log(p)]κ̂}κ̂(22) \hat{x}(p) = \hat{\eta} + \frac{\hat{\theta} \{1 - [-log(p)]^{\hat{\kappa}} \}}{\hat{\kappa}} \;\;\;\; (22)