The tube method for the moment index in projection pursuit

The projection pursuit index defined by a sum of squares of the third and the fourth sample cumulants is known as the moment index proposed by Jones and Sibson [1987. What is projection pursuit? J. Roy. Statist. Soc. Ser. A 150, 1–36]. The limiting distribution of the maximum of the moment index under the null hypothesis that the population is multivariate normal is shown to be the maximum of a Gaussian random field with a finite Karhunen–Loève expansion. An approximate formula for tail probability of the maximum, which corresponds to the p-value, is given by virtue of the tube method through determining Weyl's invariants of all degrees and the critical radius of the index manifold of the Gaussian random field.     

Asymptotics for tests on mean profiles,additional information and dimensionality under non-normality

We consider the comparison of mean vectors for k groups when k is large and sample size per group is fixed. The asymptotic null and non-null distributions of the normal theory likelihood ratio, Lawley–Hotelling and Bartlett–Nanda–Pillai statistics are derived under general conditions. We extend the results to tests on the profiles of the mean vectors, tests for additional information (provided by a sub-vector of the responses over and beyond the remaining sub-vector of responses in separating the groups) and tests on the dimension of the hyperplane formed by the mean vectors. Our techniques are based on perturbation expansions and limit theorems applied to independent but non-identically distributed sequences of quadratic forms in random matrices. In all these four MANOVA problems, the asymptotic null and non-null distributions are normal. Both the null and non-null distributions are asymptotically invariant to non-normality when the group sample sizes are equal. In the unbalanced case, a slight modification of the test statistics will lead to asymptotically robust tests. Based on the robustness results, some approaches for finite approximation are introduced. The numerical results provide strong support for the asymptotic results and finiteness approximations.     

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.     

Lower bounds on expectations of positive L-statistics from without-replacement models

We consider samples drawn without replacement from finite populations. We establish optimal lower non-negative and upper non-positive bounds on the expectations of linear combinations of order statistics centered about the population mean in units generated by the population central absolute moments of various orders. We also specify the general results for important examples of sample extremes, Gini mean differences and sample range. The paper completes the results of Papadatos and Rychlik [2004. Bounds on expectations of L-statistics from without replacement samples. J. Statist. Plann. Inference 124, 317–336], where sharp negative lower and positive upper bounds on the expectations of the combinations were presented for the without-replacement samples.     

Star-shaped distributions and their generalizations

Elliptically contoured distributions can be considered to be the distributions for which the contours of the density functions are proportional ellipsoids. We generalize elliptically contoured densities to “star-shaped distributions” with concentric star-shaped contours and show that many results in the former case continue to hold in the more general case. We develop a general theory in the framework of abstract group invariance so that the results can be applied to other cases as well, especially those involving random matrices.     

A generalization of an identity of hoeffding and some applications

Summary We generalize a well-known identity due to Hoeffding and use this generalization to prove a result of Cambanis, Simons and Stout under somewhat different hypotheses and to extend some results of Lehmann concerning bivariate distributions with quadrant dependence.     

An alternative form of the Watson efficiency

Watson [1951. Serial correlation in regression analysis. Ph.D. Thesis, Department of Experimental Statistics, North Carolina State College, Raleigh] introduced a relative efficiency, which is often called the Watson efficiency in literatures, to measure the inefficiency of the least squares in linear regression models. The Watson efficiency is defined by determinant, but we shall show by two examples that such a criterion does not always work well in some cases. In this paper, an alternative form based on Euclidean norm of the Watson efficiency is proposed and some examples are given to illustrate superiority of the new relative efficiency.     

A new stochastic order based upon Laplace transform with applications

This paper deals with nonnegative random variables having Laplace transforms as their reliability functions. We study a new stochastic order based upon Laplace transform. Some applications in actuarial science, frailty models and reliability are presented as well.     

Classification rules for triply multivariate data with an AR(1) correlation structure on the repeated measures over time

In this article we study the problem of classification of three-level multivariate data, where multiple q$q$-variate observations are measured on u$u$-sites and over p$p$-time points, under the assumption of multivariate normality. The new classification rules with certain structured and unstructured mean vectors and covariance structures are very efficient in small sample scenario, when the number of observations is not adequate to estimate the unknown variance–covariance matrix. These classification rules successfully model the correlation structure on successive repeated measurements over time. Computation algorithms for maximum likelihood estimates of the unknown population parameters are presented. Simulation results show that the introduction of sites in the classification rules improves their performance over the existing classification rules without the sites.     

SVM-like decision theoretical classification of high-dimensional vectors

In this paper, we consider the classification of high-dimensional vectors based on a small number of training samples from each class. The proposed method follows the Bayesian paradigm, and it is based on a small vector which can be viewed as the regression of the new observation on the space spanned by the training samples. The classification method provides posterior probabilities that the new vector belongs to each of the classes, hence it adapts naturally to any number of classes. Furthermore, we show a direct similarity between the proposed method and the multicategory linear support vector machine introduced in Lee et al. [2004. Multicategory support vector machines: theory and applications to the classification of microarray data and satellite radiance data. Journal of the American Statistical Association 99 (465), 67–81]. We compare the performance of the technique proposed in this paper with the SVM classifier using real-life military and microarray datasets. The study shows that the misclassification errors of both methods are very similar, and that the posterior probabilities assigned to each class are fairly accurate.     

Some properties of extreme stable laws and related infinitely divisible random variables

In the course of studying the moment sequence {nⁿ:n=0,1,…}$\{n^n:n=0,1,\dots \}$, Eaton et al. [1971. On extreme stable laws and some applications. J. Appl. Probab. 8, 794–801] have shown that this sequence, which is, indeed, the moment sequence of a log-extreme stable law with characteristic exponent γ=1$\gamma =1$, corresponds to a scale mixture of exponential distributions and hence to a distribution with decreasing failure rate. Following essentially the approach of Shanbhag et al. [1977. Some further results in infinite divisibility. Math. Proc. Cambridge Philos. Soc. 82, 289–295] we show that, under certain conditions, log-extreme stable laws with characteristic exponent γ∈[1,2)$\gamma \in [1,2)$ are scale mixtures of exponential distributions and hence are infinitely divisible and have decreasing failure rates. In addition, we study the moment problem associated with the log-extreme stable laws with characteristic exponent γ∈(0,2]$\gamma \in (0,2]$ and throw further light on the existing literature on the subject. As a by-product, we show that generalized Poisson and generalized negative binomial distributions are mixed Poisson distributions. Finally, we address some relevant questions on structural aspects of infinitely divisible distributions, and make new observations, including in particular that certain results appearing in Steutel and van Harn [2004. Infinite Divisibility of Probability Distributions on the Real Line. Marcel Dekker, New York] have links with the Wiener–Hopf factorization met in the theory of random walk.     

Laws of iterated logarithm for quasi-maximum likelihood estimator in generalized linear model

For the case that the expectation of the response variable Y   is correctly specified in the generalized linear model (GLM), under some regular assumptions, we obtain and prove the law of the iterated logarithm and Chung type law of the iterated logarithm for the quasi-maximum likelihood estimator (QMLE) _βn${\beta }_n$ in this model.     

Asymptotic normality of frequency polygons for random fields

The purpose of this paper is to investigate asymptotic normality of the frequency polygon estimator of a stationary mixing random field indexed by multidimensional lattice points space Z^N$Z^N$. Appropriate choices of the bandwidths are found.     

Trimmed and Winsorized means based on a scaled deviation

Trimmed (and Winsorized) means based on a scaled deviation are introduced and studied. The influence functions of the estimators are derived and their limiting distributions are established via asymptotic representations. As a main focus of the paper, the performance of the estimators with respect to various robustness and efficiency criteria is evaluated and compared with leading competitors including the ordinary Tukey trimmed (and Winsorized) means. Unlike the Tukey trimming which always trims a fixed fraction of sample points at each end of data, the trimming scheme here only trims points at one or both ends that have a scaled deviation beyond some threshold. The resulting trimmed (and Winsorized) means are much more robust than their predecessors. Indeed they can share the best breakdown point robustness of the sample median for any common trimming thresholds. Furthermore, for appropriate trimming thresholds they are highly efficient at light-tailed symmetric models and more efficient than their predecessors at heavy-tailed or contaminated symmetric models. Detailed comparisons with leading competitors on various robustness and efficiency aspects reveal that the scaled deviation trimmed (Winsorized) means behave very well overall and consequently represent very favorable alternatives to the ordinary trimmed (Winsorized) means.     

Sharp upper bounds for the expected values of non-extreme order statistics from discrete distributions

We consider the problem of determining sharp upper bounds on the expected values of non-extreme order statistics based on i.i.d. random variables taking on N values at most. We show that the bound problem is equivalent to the problem of establishing the best approximation of the projection of the density function of the respective order statistic based on the standard uniform i.i.d. sample onto the family of non-decreasing functions by arbitrary N  -valued functions in the norm of L²(0,1)$L^2(0,1)$ space. We also present an algorithm converging to the local minima of the approximation problems.     

Partially linear models and polynomial spline approximations for the analysis of unbalanced panel data

In this paper, we study the estimation of the unbalanced panel data partially linear models with a one-way error components structure. A weighted semiparametric least squares estimator (WSLSE) is developed using polynomial spline approximation and least squares. We show that the WSLSE is asymptotically more efficient than the corresponding unweighted estimator for both parametric and nonparametric components of the model. This is a significant improvement over previous results in the literature which showed that the simply weighting technique can only improve the estimation of the parametric component. The asymptotic normalities of the proposed WSLSE are also established.     

Some nonparametric precedence-type tests based on progressively censored samples and evaluation of power

In this paper, we consider the problem of testing the equality of two distributions when both samples are progressively Type-II censored. We discuss the following two statistics: one based on the Wilcoxon-type rank-sum precedence test, and the second based on the Kaplan–Meier estimator of the cumulative distribution function. The exact null distributions of these test statistics are derived and are then used to generate critical values and the corresponding exact levels of significance for different combinations of sample sizes and progressive censoring schemes. We also discuss their non-null distributions under Lehmann alternatives. A power study of the proposed tests is carried out under Lehmann alternatives as well as under location-shift alternatives through Monte Carlo simulations. Through this power study, it is shown that the Wilcoxon-type rank-sum precedence test performs the best.     

Optimal mixed-level k-circulant supersaturated designs

Supersaturated designs (SSDs) offer a potentially useful way to investigate many factors with only few experiments in the preliminary stages of experimentation. This paper explores how to construct E(_fNOD)$E(f_{\mathrm{NOD}})$-optimal mixed-level SSDs using k-cyclic generators. The necessary and sufficient conditions for the existence of mixed-level k-circulant SSDs with the equal occurrence property are provided. Properties of the mixed-level k  -circulant SSDs are investigated, in particular, the sufficient condition under which the generator vector produces an E(_fNOD)$E(f_{\mathrm{NOD}})$-optimal SSD is obtained. Moreover, many new E(_fNOD)$E(f_{\mathrm{NOD}})$-optimal mixed-level SSDs are constructed and listed. The method here generalizes the one proposed by Liu and Dean [2004. k$k$-circulant supersaturated designs. Technometrics 46, 32–43] for two-level SSDs and the one due to Georgiou and Koukouvinos [2006. Multi-level k-circulant supersaturated designs. Metrika 64, 209–220] for the multi-level case.     

Finite mixtures of multivariate Poisson distributions with application

In the present paper we examine finite mixtures of multivariate Poisson distributions as an alternative class of models for multivariate count data. The proposed models allow for both overdispersion in the marginal distributions and negative correlation, while they are computationally tractable using standard ideas from finite mixture modelling. An EM type algorithm for maximum likelihood (ML) estimation of the parameters is developed. The identifiability of this class of mixtures is proved. Properties of ML estimators are derived. A real data application concerning model based clustering for multivariate count data related to different types of crime is presented to illustrate the practical potential of the proposed class of models.