The Stein phenomenon for monotone incomplete multivariate normal data

We establish the Stein phenomenon in the context of two-step, monotone incomplete data drawn from , a (p+q)-dimensional multivariate normal population with mean and covariance matrix . On the basis of data consisting of n observations on all p+q characteristics and an additional N−n observations on the last q characteristics, where all observations are mutually independent, denote by the maximum likelihood estimator of . We establish criteria which imply that shrinkage estimators of James-Stein type have lower risk than under Euclidean quadratic loss. Further, we show that the corresponding positive-part estimators have lower risk than their unrestricted counterparts, thereby rendering the latter estimators inadmissible. We derive results for the case in which is block-diagonal, the loss function is quadratic and non-spherical, and the shrinkage estimator is constructed by means of a nondecreasing, differentiable function of a quadratic form in . For the problem of shrinking to a vector whose components have a common value constructed from the data, we derive improved shrinkage estimators and again determine conditions under which the positive-part analogs have lower risk than their unrestricted counterparts.     

Uniformly minimum variance nonnegative quadratic unbiased estimation in a generalized growth curve model

Consider the generalized growth curve model subject to R(X_m)⊆?⊆R(X₁), where B_i are the matrices of unknown regression coefficients, and E=(ε₁,…,ε_s)^′ and are independent and identically distributed with the same first four moments as a random vector normally distributed with mean zero and covariance matrix Σ. We derive the necessary and sufficient conditions under which the uniformly minimum variance nonnegative quadratic unbiased estimator (UMVNNQUE) of the parametric function with C≥0 exists. The necessary and sufficient conditions for a nonnegative quadratic unbiased estimator with of to be the UMVNNQUE are obtained as well.     

On the layered nearest neighbour estimate, the bagged nearest neighbour estimate and the random forest method in regression and classification

Let be identically distributed random vectors in R^d, independently drawn according to some probability density. An observation is said to be a layered nearest neighbour (LNN) of a point if the hyperrectangle defined by and contains no other data points. We first establish consistency results on , the number of LNN of . Then, given a sample of independent identically distributed random vectors from R^d×R, one may estimate the regression function by the LNN estimate , defined as an average over the Y_i’s corresponding to those which are LNN of . Under mild conditions on r, we establish the consistency of towards 0 as n→∞, for almost all and all p≥1, and discuss the links between r_n and the random forest estimates of Breiman (2001) [8]. We finally show the universal consistency of the bagged (bootstrap-aggregated) nearest neighbour method for regression and classification.     

On an additive decomposition of the BLUE in a multiple-partitioned linear model

Necessary and sufficient conditions are derived for the BLUE in a general multiple-partitioned linear model to be the sum of the BLUEs under the k small models , …, . Some consequences and further research topics are also given.     

Progressive Type II censored order statistics for multivariate observations

For a sequence of independent and identically distributed random vectors , i=1,2,…,n, we consider the conditional ordering of these random vectors with respect to the magnitudes of , where N is a p-variate continuous function defined on the support set of X₁ and satisfying certain regularity conditions. We also consider the Progressive Type II right censoring for multivariate observations using conditional ordering. The need for the conditional ordering of random vectors exists for example, in reliability analysis when a system has n independent components each consisting of p arbitrarily dependent and parallel connected elements. Let the vector of life lengths for the ith component of the system be , where denotes the life length of the jth element of the ith component. Then the first failure in the system occurs at time , and for this case . In this paper we introduce the conditionally ordered and Progressive Type II right-censored conditionally ordered statistics for multivariate observations and to study their distributional properties.     

Density estimation by the penalized combinatorial method

Let f be an unknown multivariate density belonging to a prespecified parametric class of densities, , where k is unknown, but for all k and each has finite Vapnik-Chervonenkis dimension. Given an i.i.d. sample of size n drawn from f, we show that it is possible to select automatically, and without extra restrictions on f, an estimate with the property that . Our method is inspired by the combinatorial tools developed in Devroye and Lugosi (Combinatorial Methods in Density Estimation, Springer, New York, 2001) and it includes a wide range of density models, such as mixture models or exponential families.     

Properties of cyclic subspace regression

Various properties of the regression vector produced by cyclic subspace regression with regard to the meancentered linear regression equation are put forth. In particular, the subspace associated with the creation of is shown to contain a basis that maximizes certain covariances with respect to , the orthogonal projection of onto a specific subspace of the range of X. This basis is constructed. Moreover, this paper shows how the maximum covariance values effect the . Several alternative representations of are also developed. These representations show that is a modified version of the l-factor principal components regression vector , with the modification occurring by a nonorthogonal projection. Additionally, these representations enable prediction properties associated with to be explicitly identified. Finally, methods for choosing factors are spelled out.     

The third homology of the special linear group of a field

We prove that for any infinite field F, the map is an isomorphism for all n≥3. When n=2 the cokernel of this map is naturally isomorphic to , where is the nth Milnor K-group of F. We deduce that the natural homomorphism from to the indecomposable K₃ of F, , is surjective for any infinite field F.     

Some new results on multivariate dispersive ordering of generalized order statistics

Let be generalized order statistics based on a continuous distribution function F with parameters k and (m₁,…,m_n−1). Chen and Hu (2007) [8] investigated the sufficient conditions on F and on the parameters k and m_i’s such that , where , and is the Shaked-Shanthikumar multivariate dispersive order. Since the order does not possess the closure property under marginalization, one may naturally wonder whether the corresponding multivariate margins of the above random vectors are also ordered in the order . This is answered affirmatively in this paper. Some comparison results for generalized order statistics from two samples are presented. Potential applications are also mentioned.     

Asymptotic distributions of maxima of complete and incomplete samples from multivariate stationary Gaussian sequences

Let be a sequence of d-dimensional stationary Gaussian vectors, and let denote the partial maxima of . Suppose that there are missing data in each component of and let denote the partial maxima of the observed variables. In this note, we study two kinds of asymptotic distributions of the random vector where the correlation and cross-correlation satisfy some dependence conditions.     

Strong convergence of the empirical distribution of eigenvalues of sample covariance matrices with a perturbation matrix

Let , where is a random symmetric matrix, a random symmetric matrix, and with being independent real random variables. Suppose that , and are independent. It is proved that the empirical spectral distribution of the eigenvalues of random symmetric matrices converges almost surely to a non-random distribution.     

Asymptotic expansions of test statistics for dimensionality and additional information in canonical correlation analysis when the dimension is large

This paper examines asymptotic expansions of test statistics for dimensionality and additional information in canonical correlation analysis based on a sample of size N=n+1 on two sets of variables, i.e.,  and . These problems are related to dimension reduction. The asymptotic approximations of the statistics have been studied extensively when dimensions p₁ and p₂ are fixed and the sample size N tends to infinity. However, the approximations worsen as p₁ and p₂ increase. This paper derives asymptotic expansions of the test statistics when both the sample size and dimension are large, assuming that and have a joint (p₁+p₂)-variate normal distribution. Numerical simulations revealed that this approximation is more accurate than the classical approximation as the dimension increases.     

Testing the stability of the functional autoregressive process

The functional autoregressive process has become a useful tool in the analysis of functional time series data. It is defined by the equation , in which the observations X_n and errors ε_n are curves, and is an operator. To ensure meaningful inference and prediction based on this model, it is important to verify that the operator does not change with time. We propose a method for testing the constancy of against a change-point alternative which uses the functional principal component analysis. The test statistic is constructed to have a well-known asymptotic distribution, but the asymptotic justification of the procedure is very delicate. We develop a new truncation approach which together with Mensov’s inequality can be used in other problems of functional time series analysis. The estimation of the principal components introduces asymptotically non-negligible terms, which however cancel because of the special form of our test statistic (CUSUM type). The test is implemented using the R package fda, and its finite sample performance is examined by application to credit card transaction data.     

On the number of graphs with a given endomorphism monoid

For a given finite monoid , let be the number of graphs on n vertices with endomorphism monoid isomorphic to . For any nontrivial monoid we prove that where and are constants depending only on with .For every k there exists a monoid of size k with , on the other hand if a group of unity of has a size k>2 then .