Large-sample confidence intervals for risk measures of location–scale families

For a loss distribution belonging to a location–scale family, _Fμ,σ$F_{\mu ,\sigma }$, the risk measures, Value-at-Risk and Expected Shortfall are linear functions of the parameters: μ+τσ$\mu +\tau \sigma$ where τ$\tau$ is the corresponding risk measure of the mean-zero and unit-variance member of the family. For each risk measure, we consider a natural estimator by replacing the unknown parameters μ$\mu$ and σ$\sigma$ by the sample mean and (bias corrected) sample standard deviation, respectively. The large-sample parametric confidence intervals for the risk measures are derived, relying on the asymptotic joint distribution of the sample mean and sample standard deviation. Simulation studies with the Normal, Laplace and Gumbel families illustrate that the derived asymptotic confidence intervals for Value-at-Risk and Expected Shortfall outperform those of Bahadur (1966) and Brazauskas et al. (2008), respectively. The method can also be effectively applied to Log-location-scale families whose supports are positive reals; an illustrative example is given in the area of financial credit risk.     

Truncated linear estimation of a bounded multivariate normal mean

We consider the problem of estimating the mean θ$\theta$ of an _Np(θ,_Ip)${\mathrm{N}}_{\mathrm{p}}(\theta ,I_p)$ distribution with squared error loss ∥δ−θ∥²$\parallel \delta -\theta {\parallel }^2$ and under the constraint ∥θ∥≤m$\parallel \theta \parallel \le m$, for some constant m>0$m>0$. Using Stein's identity to obtain unbiased estimates of risk, Karlin's sign change arguments, and conditional risk analysis, we compare the risk performance of truncated linear estimators with that of the maximum likelihood estimator _δmle${\delta }_{\mathrm{mle}}$. We obtain for fixed (m,p)$(m,p)$ sufficient conditions for dominance. An asymptotic framework is developed, where we demonstrate that the truncated linear minimax estimator dominates _δmle${\delta }_{\mathrm{mle}}$, and where we obtain simple and accurate measures of relative improvement in risk. Numerical evaluations illustrate the effectiveness of the asymptotic framework for approximating the risks for moderate or large values of p.     

The use of an identity in Anderson for multivariate multiple testing

Consider the model where there are I$I$ independent multivariate normal treatment populations with p×1$p\times 1$ mean vectors _μi${\mathit{\mu }}_i$, i=1,…,I$i=1,\dots ,I$, and covariance matrix Σ$\Sigma$. Independently the (I+1)$(I+1)$st population corresponds to a control and it too is multivariate normal with mean vector _μI+1${\mathit{\mu }}_{I+1}$ and covariance matrix Σ$\Sigma$. Now consider the following two multiple testing problems.     

Optimality of the quasi-score estimator in a mean–variance model with applications to measurement error models

We consider a regression of y$y$ on x$x$ given by a pair of mean and variance functions with a parameter vector θ$\theta$ to be estimated that also appears in the distribution of the regressor variable x$x$. The estimation of θ$\theta$ is based on an extended quasi-score (QS) function. We show that the QS estimator is optimal within a wide class of estimators based on linear-in-y$y$ unbiased estimating functions. Of special interest is the case where the distribution of x$x$ depends only on a subvector α$\alpha$ of θ$\theta$, which may be considered a nuisance parameter. In general, α$\alpha$ must be estimated simultaneously together with the rest of θ$\theta$, but there are cases where α$\alpha$ can be pre-estimated. A major application of this model is the classical measurement error model, where the corrected score (CS) estimator is an alternative to the QS estimator. We derive conditions under which the QS estimator is strictly more efficient than the CS estimator.     

Reduced-rank estimation of the difference between two covariance matrices

We consider m×m$m\times m$ covariance matrices, _Σ1${\Sigma }_1$ and _Σ2${\Sigma }_2$, which satisfy _Σ2-_Σ1=Δ${\Sigma }_2-{\Sigma }_1=\Delta$, where Δ$\Delta$ has a specified rank. Maximum likelihood estimators of _Σ1${\Sigma }_1$ and _Σ2${\Sigma }_2$ are obtained when sample covariance matrices having Wishart distributions are available and rank(Δ)$\text{rank}(\Delta )$ is known. The likelihood ratio statistic for a test about the value of rank(Δ)$\text{rank}(\Delta )$ is also given and some properties of its null distribution are obtained. The methods developed in this paper are illustrated through an example.     

An identity for the Fisher information and Mahalanobis distance

Consider a mixture problem consisting of k classes. Suppose we observe an s-dimensional random vector X   whose distribution is specified by the relations P(X∈A|Y=i)=_Pi(A)$P(X\in A|Y=i)=P_i(A)$, where Y   is an unobserved class identifier defined on {1,…,k}$\{1,\dots ,k\}$, having distribution P(Y=i)=_pi$P(Y=i)=p_i$. Assuming the distributions _Pi$P_i$ having a common covariance matrix, elegant identities are presented that connect the matrix of Fisher information in Y   on the parameters _p1,…,_pk$p_1,\dots ,p_k$, the matrix of linear information in X, and the Mahalanobis distances between the pairs of P  's. Since the parameters are not free, the information matrices are singular and the technique of generalized inverses is used. A matrix extension of the Mahalanobis distance and its invariant forms are introduced that are of interest in their own right. In terms of parameter estimation, the results provide an independent of the parameter upper bound for the loss of accuracy by esimating _p1,…,_pk$p_1,\dots ,p_k$ from a sample of X^′$X^{\prime }$s, as compared with the ideal estimator based on a random sample of Y^′$Y^{\prime }$s.     

On the maximum of periodic integer-valued sequences with exponential type tails via max-semistable laws

In this work we study the limiting distribution of the maximum term of periodic integer-valued sequences with marginal distribution belonging to a particular class where the tail decays exponentially. This class does not belong to the domain of attraction of any max-stable distribution. Nevertheless, we prove that the limiting distribution is max-semistable when we consider the maximum of the first k_n observations, for a suitable sequence {_kn}$\{k_n\}$ increasing to infinity. We obtain an expression for calculating the extremal index of sequences satisfying certain local conditions similar to conditions D^(m)(_un)$D^{(m)}(u_n)$, m∈N$m\in \mathbb{N}$, defined by Chernick et al. (1991). We apply the results to a class of max-autoregressive sequences and a class of moving average models. The results generalize the ones obtained for the stationary case.     

Higher-order approximations for interval estimation in binomial settings

In this paper we revisit the classical problem of interval estimation for one-binomial parameter and for the log odds ratio of two binomial parameters. We examine the confidence intervals provided by two versions of the modified log likelihood root: the usual Barndorff-Nielsen's r^*$r^{*}$ and a Bayesian version of the r^*$r^{*}$ test statistic.     

On E(s)-optimal supersaturated designs

A popular measure to assess 2-level supersaturated designs is the E(s²)$E(s^2)$ criterion. In this paper, improved lower bounds on E(s²)$E(s^2)$ are obtained. The same improvement has recently been established by Ryan and Bulutoglu [2007. E(s²)$E(s^2)$-optimal supersaturated designs with good minimax properties. J. Statist. Plann. Inference 137, 2250–2262]. However, our analysis provides more details on precisely when an improvement is possible, which is lacking in Ryan and Bulutoglu [2007. E(s²)$E(s^2)$-optimal supersaturated designs with good minimax properties. J. Statist. Plann. Inference 137, 2250–2262]. The equivalence of the bounds obtained by Butler et al. [2001. A general method of constructing E(s²)$E(s^2)$-optimal supersaturated designs. J. Roy. Statist. Soc. B 63, 621–632] (in the cases where their result applies) and those obtained by Bulutoglu and Cheng [2004. Construction of E(s²)$E(s^2)$-optimal supersaturated designs. Ann. Statist. 32, 1662–1678] is established. We also give two simple methods of constructing E(s²)$E(s^2)$-optimal designs.     

Optimal designs for threshold-determining limiting dilution assays

In common with other non-linear models, the optimal design for a limiting dilution assay (LDA) depends on the value of the unknown parameter, θ$\theta$, in the model. Consequently optimal designs cannot be specified unless some assumptions are made about the possible values of θ$\theta$. If a prior distribution can be specified then a Bayesian approach can be adopted. A proper specification of the Bayesian approach requires the aim of the experiment to be described and quantified through an appropriate utility function. This paper addresses the problem of finding optimal designs for LDAs when the aim is to determine whether θ$\theta$ is above or below a specified threshold, _θ0${\theta }_0$.     

Lattice and Schröder paths with periodic boundaries

We consider paths in the plane with (1,0$1,0$), (0,1$0,1$), and (a,b$a,b$)-steps that start at the origin, end at height n$n$, and stay strictly to the left of a given non-decreasing right boundary. We show that if the boundary is periodic and has slope at most b/a$b/a$, then the ordinary generating function for the number of such paths ending at height n   is algebraic. Our argument is in two parts. We use a simple combinatorial decomposition to obtain an Appell relation or “umbral” generating function, in which the power zⁿ$z^n$ is replaced by a power series of the form zⁿ_φn(z),$z^n{\phi }_n(z),$ where _φn(0)=1.${\phi }_n(0)=1.$ Then we convert (in an explicit way) the umbral generating function to an ordinary generating function by solving a system of linear equations and a polynomial equation. This conversion implies that the ordinary generating function is algebraic. We give several concrete examples, including an alternative way to solve the tennis ball problem.     

Nonparametric estimation of the number of components of a superposition of renewal processes

Suppose all events occurring in an unknown number (ν)$(\nu )$ of iid renewal processes, with a common renewal distribution F  , are observed for a fixed time τ$\tau$, where both ν$\nu$ and F   are unknown. The individual processes are not known a priori, but for each event, the process that generated it is identified. For example, in software reliability application, the errors (or bugs) in a piece of software are not known a priori, but whenever the software fails, the error causing the failure is identified. We present a nonparametric method for estimating ν$\nu$ and investigate its properties. Our results show that the proposed estimator performs well in terms of bias and asymptotic normality, while the MLE of ν$\nu$ derived assuming that the common renewal distribution is exponential may be seriously biased if that assumption does not hold.     

Generalizing Clatworthy group divisible designs

In this paper a neat construction is provided for three new families of group divisible designs that generalize some designs from Clatworthy's table of the only 11 designs with two associate classes that have block size four, three groups, and replication numbers at most 10. In each case (namely, _λ1=4${\lambda }_1=4$ and _λ2=5${\lambda }_2=5$, _λ1=4${\lambda }_1=4$ and _λ2=2${\lambda }_2=2$, and _λ1=8${\lambda }_1=8$ and _λ2=4${\lambda }_2=4$), we have proved that the necessary conditions found are also sufficient for the existence of such GDD's with block size four and three groups, with one possible exception.     

Improving density estimators of discretely observed processes by interpolation

We consider density estimation for a smooth stationary process _Xt$X_t$, t∈R$t\in \mathbf{R}$, based on a discrete sample _Yi=_XΔi$Y_i=X_{\mathrm{\Delta }i}$, i=0,…,n=T/Δ$i=0,\dots ,n=T/\Delta$. By a suitable interpolation scheme of order p  , we augment data to form an approximation _Xp,t$X_{p,t}$, t∈[0,T]$t\in [0,T]$, of the continuous-time process and base our density estimate on the augmented sample path. Our results show that this can improve the rate of convergence (measured in terms of n) of the density estimate. Among other things, this implies that recording n   observations using a small Δ$\Delta$ can be more efficient than recording n independent observations.