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.     

Construction of blocked two-level regular designs with general minimum lower order confounding

Zhang et al. (2008) proposed a general minimum lower order confounding (GMC for short) criterion, which aims to select optimal factorial designs in a more elaborate and explicit manner. By extending the GMC criterion to the case of blocked designs, Wei et al. (submitted for publication) proposed a B¹-GMC criterion. The present paper gives a construction theory and obtains the B¹-GMC 2^n−m:2^r$2^{n-m}:2^r$ designs with n≥5N/16+1$n\ge 5N/16+1$, where 2^n−m:2^r$2^{n-m}:2^r$ denotes a two-level regular blocked design with N=2^n−m$N=2^{n-m}$ runs, n   treatment factors, and 2^r$2^r$ blocks. The construction result is simple. Up to isomorphism, the B¹-GMC 2^n−m:2^r$2^{n-m}:2^r$ designs can be constructed as follows: the n   treatment factors and the 2^r−1$2^r-1$ block effects are, respectively, assigned to the last n   columns and specific 2^r−1$2^r-1$ columns of the saturated 2^{(N−1)−(N−1−n+m)}$2^{(N-1)-(N-1-n+m)}$ design with Yates order. With such a simple structure, the B¹-GMC designs can be conveniently used in practice. Examples are included to illustrate the theory.     

Nonparametric estimation of conditional expectation

Denote the integer lattice points in the N  -dimensional Euclidean space by Z^N${\mathbb{Z}}^N$ and assume that (_Xi,_Yi)$(X_{\mathbf{i}},Y_{\mathbf{i}})$, i∈Z^N$\mathbf{i}\in {\mathbb{Z}}^N$ is a mixing random field. Estimators of the conditional expectation r(x)=E[_Yi|_Xi=x]$r(\mathbf{x})=\mathrm{E}[Y_{\mathbf{i}}|X_{\mathbf{i}}=\mathbf{x}]$ by nearest neighbor methods are established and investigated. The main analytical result of this study is that, under general mixing assumptions, the estimators considered are asymptotically normal. Many difficulties arise since points in higher dimensional space N?2$N?2$ cannot be linearly ordered. Our result applies to many situations where parametric methods cannot be adopted with confidence.     

Lattice path counting and the theory of queues

In this paper we will show how recent advances in the combinatorics of lattice paths can be applied to solve interesting and nontrivial problems in the theory of queues. The problems we discuss range from classical ones like M^a/M^b/1$M^a/M^b/1$ systems to open tandem systems with and without global blocking and to queueing models that are related to random walks in a quarter plane like the Flatto–Hahn model or systems with preemptive priorities.     

Constrained Bayes and empirical Bayes estimation under random effects normal ANOVA model with balanced loss function

The paper develops constrained Bayes and empirical Bayes estimators in the random effects ANOVA model under balanced loss functions. In the balanced normal–normal model, estimators of the Bayes risks of the constrained Bayes and constrained empirical Bayes estimators are provided which are correct asymptotically up to O(m^-1)$\mathrm{O}(m^{-1})$, that is the remainder term is o(m^-1)$\mathrm{o}(m^{-1})$, m$m$ denoting the number of strata.     

General minimum lower order confounding designs: An overview and a construction theory

For fractional factorial (FF) designs, Zhang et al. (2008) introduced a new pattern for assessing regular designs, called aliased effect-number pattern (AENP), and based on the AENP, proposed a general minimum lower order confounding (denoted by GMC for short) criterion for selecting design. In this paper, we first have an overview of the existing optimality criteria of FF designs, and then propose a construction theory for 2^n−m$2^{n-m}$ GMC designs with 33N/128≤n≤5N/16$33N/128\le n\le 5N/16$, where N=2^n−m$N=2^{n-m}$ is the run size and n is the number of factors, for all N's and n  's, via the doubling theory and SOS resolution IV designs. The doubling theory is extended with a new approach. By introducing a notion of rechanged (RC) Yates order for the regular saturated design, the construction result turns out to be quite transparent: every GMC 2^n−m$2^{n-m}$ design simply consists of the last n columns of the saturated design with a specific RC Yates order. This can be very conveniently applied in practice.     

On empirical likelihood for linear models with missing responses

Suppose that we have a linear regression model Y=X^′β+_ν0(X)ε$Y=X^{\prime }\beta +{\nu }_0(X)\epsilon$ with random error ε$\epsilon$, where X is a random design variable and is observed completely, and Y is the response variable and some Y-values are missing at random (MAR). In this paper, based on the ‘complete’ data set for Y after inverse probability weighted imputation, we construct empirical likelihood statistics on EY   and β$\beta$ which have the χ²${\chi }^2$-type limiting distributions under some new conditions compared with Xue (2009). Our results broaden the applicable scope of the approach combined with Xue (2009).     

Rates of convergence for the k-nearest neighbor estimators with smoother regression functions

Let (X, Y  ) be a R^d×R-valued${\mathbb{R}}^d\times \mathbb{R}\mathrm{-}\mathrm{valued}$ random vector. In regression analysis one wants to estimate the regression function m(x)?E(Y|X=x)$m(x)?\mathbf{E}(Y|X=x)$ from a data set. In this paper we consider the rate of convergence for the k-nearest neighbor estimators in case that X   is uniformly distributed on [0,1]^d$[\mathrm{0,1}{]}^d$, Var(Y|X=x)$\mathbf{Var}(Y|X=x)$ is bounded, and m is (p, C)-smooth. It is an open problem whether the optimal rate can be achieved by a k  -nearest neighbor estimator for 1<p≤1.5$1<p\le 1.5$. We solve the problem affirmatively. This is the main result of this paper. Throughout this paper, we assume that the data is independent and identically distributed and as an error criterion we use the expected L₂ error.     

Linear sufficiency and completeness in the context of estimating the parametric function in the general Gauss–Markov model

In this paper we consider linear sufficiency and linear completeness in the context of estimating the estimable parametric function K^′β${\mathbf{K}}^{\prime }\mathit{\beta }$ under the general Gauss–Markov model {y,Xβ,σ²V}$\{\mathbf{y},\mathbf{X}\mathit{\beta },{\sigma }^2\mathbf{V}\}$. We give new characterizations for linear sufficiency, and define and characterize linear completeness in a case of estimation of K^′β${\mathbf{K}}^{\prime }\mathit{\beta }$. Also, we consider a predictive approach for obtaining the best linear unbiased estimator of K^′β${\mathbf{K}}^{\prime }\mathit{\beta }$, and subsequently, we give the linear analogues of the Rao–Blackwell and Lehmann–Scheffé Theorems in the context of estimating K^′β${\mathbf{K}}^{\prime }\mathit{\beta }$.     

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.     

Quasi-minimax estimation in the general linear regression model

This paper is mainly concerned with minimax estimation in the general linear regression model y=Xβ+ε$y=X\beta +\epsilon$ under ellipsoidal restrictions on the parameter space and quadratic loss function. We confine ourselves to estimators that are linear in the response vector y  . The minimax estimators of the regression coefficient β$\beta$ are derived under homogeneous condition and heterogeneous condition, respectively. Furthermore, these obtained estimators are the ridge-type estimators and mean dispersion error (MDE) superior to the best linear unbiased estimator b=(X^′W^-1X)^-1X^′W^-1y$b=(X^{\prime }{W}^{-1}X{)}^{-1}{X}^{\prime }{W}^{-1}y$ under some conditions.     

Addition of runs to an s-level supersaturated design

The purpose of the present work is to extend the work of Gupta et al. (2010) to s  -level column balanced supersaturated designs. Addition of runs to an existing E(χ²)-optimal$E({\chi }^2)\mathrm{-}\mathrm{optimal}$ supersaturated design and to study the optimality of the resulting design is an important issue. This paper considers the study of the optimality of the resulting design. A lower bound to E(χ²)$E({\chi }^2)$ has been obtained for the extended supersaturated designs. Some examples and a small catalogue of E(χ²)-optimal$E({\chi }^2)\mathrm{-}\mathrm{optimal}$ supersaturated designs are also presented.     

On the distributions of multivariate sample skewness

In this paper, we consider the multivariate normality test based on measure of multivariate sample skewness defined by Srivastava (1984). Srivastava derived asymptotic expectation up to the order N⁻¹ for the multivariate sample skewness and approximate χ²${\chi }^2$ test statistic, where N   is sample size. Under normality, we derive another expectation and variance for Srivastava's multivariate sample skewness in order to obtain a better test statistic. From this result, improved approximate χ²${\chi }^2$ test statistic using the multivariate sample skewness is also given for assessing multivariate normality. Finally, the numerical result by Monte Carlo simulation is shown in order to evaluate accuracy of the obtained expectation, variance and improved approximate χ²${\chi }^2$ test statistic. Furthermore, upper and lower percentiles of χ²${\chi }^2$ test statistic derived in this paper are compared with those of χ²${\chi }^2$ test statistic derived by Mardia (1974) which is used multivariate sample skewness defined by Mardia (1970).     

Distribution theory of quadratic forms for matrix multivariate elliptical distribution

This paper proposes the density and characteristic functions of a general matrix quadratic form X^(?)AX${\mathbf{X}}^{(?)}\mathbf{AX}$, when A=A^(?)$\mathbf{A}={\mathbf{A}}^{(?)}$ is a positive semidefinite matrix, X$\mathbf{X}$ has a matrix multivariate elliptical distribution and X^(?)${\mathbf{X}}^{(?)}$ denotes the usual conjugate transpose of X$\mathbf{X}$. These results are obtained for real normed division algebras. With particular cases we obtained the density and characteristic functions of matrix quadratic forms for matrix multivariate normal, Pearson type VII, t and Cauchy distributions.     

Double-smoothing for bias reduction in local linear regression

Local linear regression involves fitting a straight line segment over a small region whose midpoint is the target point x, and the local linear estimate at x   is the estimated intercept of that straight line segment, with an asymptotic bias of order h²$h^2$ and variance of order (nh)^-1$(\mathit{nh}{)}^{-1}$ (h is the bandwidth). In this paper, we propose a new estimator, the double-smoothing local linear estimator, which is constructed by integrally combining all fitted values at x   of local lines in its neighborhood with another round of smoothing. The proposed estimator attempts to make use of all information obtained from fitting local lines. Without changing the order of variance, the new estimator can reduce the bias to an order of h⁴$h^4$. The proposed estimator has better performance than local linear regression in situations with considerable bias effects; it also has less variability and more easily overcomes the sparse data problem than local cubic regression. At boundary points, the proposed estimator is comparable to local linear regression. Simulation studies are conducted and an ethanol example is used to compare the new approach with other competitive methods.     

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.     

Empirical Bayes regression analysis with many regressors but fewer observations

In this paper, we consider the prediction problem in multiple linear regression model in which the number of predictor variables, p, is extremely large compared to the number of available observations, n  . The least-squares predictor based on a generalized inverse is not efficient. We propose six empirical Bayes estimators of the regression parameters. Three of them are shown to have uniformly lower prediction error than the least-squares predictors when the vector of regressor variables are assumed to be random with mean vector zero and the covariance matrix (1/n)X^tX$(1/n){\mathit{X}}^{\mathrm{t}}\mathit{X}$ where X^t=(_x1,…,_xn)${\mathit{X}}^{\mathrm{t}}=({\mathit{x}}_1,\dots ,{\mathit{x}}_n)$ is the p×n$p\times n$ matrix of observations on the regressor vector centered from their sample means. For other estimators, we use simulation to show its superiority over the least-squares predictor.