On the enumeration of some D-optimal designs

Two matrices with elements taken from the set {-1,1}$\{-1,1\}$ are Hadamard equivalent if one can be converted into the other by a sequence of permutations of rows and columns, and negations of rows and columns. In this paper we summarize what is known about the number of equivalence classes of matrices having maximal determinant. We establish that there are 7 equivalence classes for matrices of order 21 and that there are at least 9884 equivalence classes for matrices of order 26. The latter result is obtained primarily using a switching technique for producing new designs from old.     

On convergence of properly weighted samples to the target distribution

We consider importance sampling as well as other properly weighted samples with respect to a target distribution π$\pi$ from a different point of view. By considering the associated weights as sojourn times until the next jump, we define appropriate jump processes. When the original sample sequence forms an ergodic Markov chain, the associated jump process is an ergodic semi-Markov process with stationary distribution π$\pi$. In this respect, properly weighted samples behave very similarly to standard Markov chain Monte Carlo (MCMC) schemes in that they exhibit convergence to the target distribution as well. Indeed, some standard MCMC procedures like the Metropolis–Hastings algorithm are included in this context. Moreover, when the samples are independent and the mean weight is bounded above, we describe a slight modification in order to achieve exact (weighted) samples from the target distribution.     

Equivalence theorem for Schur optimality of experimental designs

An experimental design is said to be Schur optimal, if it is optimal with respect to the class of all Schur isotonic criteria, which includes Kiefer's criteria of _Φp${\Phi }_p$-optimality, distance optimality criteria and many others. In the paper we formulate an easily verifiable necessary and sufficient condition for Schur optimality in the set of all approximate designs of a linear regression experiment with uncorrelated errors. We also show that several common models admit a Schur optimal design, for example the trigonometric model, the first-degree model on the Euclidean ball, and the Berman's model.     

A comparison of conditional Poisson sampling versus unequal probability sampling with replacement

The variance of the Horvitz–Thompson estimator for a fixed size Conditional Poisson sampling scheme without replacement and with unequal inclusion probabilities is compared to the variance of the Hansen–Hurwitz estimator for a sampling scheme with replacement. We show, using a theorem by Gabler, that the sampling design without replacement is more efficient than the sampling design with replacement.     

On characterizations of the logistic distribution

We modify and extend George and Mudholkar's [1981. A characterization of the logistic distribution by a sample median. Ann. Inst. Statist. Math. 33, 125–129] characterization result about the logistic distribution, which is in terms of the sample median and Laplace distribution. Moreover, we give some new characterization results in terms of the smallest order statistics and the exponential distribution.     

Nonparametric estimation of the conditional distribution function in a semiparametric censorship model

In this paper we propose a new nonparametric estimator of the conditional distribution function under a semiparametric censorship model. We establish an asymptotic representation of the estimator as a sum of iid random variables, balanced by some kernel weights. This representation is used for obtaining large sample results such as the rate of uniform convergence of the estimator, or its limit distributional law. We prove that the new estimator outperforms the conditional Kaplan–Meier estimator for censored data, in the sense that it exhibits lower asymptotic variance. Illustration through real data analysis is provided.     

Estimating ordered parameters by linear programming

There are many models that require the estimation of a set of ordered parameters. For example, multivariate analysis of variance often is formulated as testing for the equality of the parameters versus an ordered alternative. This problem, referred to as isotonic inference, constrained inference, or isotonic regression, has led to the development of general solutions, not often easy to apply in special models. In this expository paper, we study the special case of a separable convex quadratic programming problem for which the optimality conditions lead to a readily solved linear complementarity problem in the Lagrange multipliers, and subsequently to an equivalent linear programming problem, whose solution can be used to recover the solution of the original isotonic problem. The method can be applied to estimating ordered correlations, ordered binomial probabilities, ordered Poisson parameters, ordered exponential scale parameters, or ordered risk differences.     

D-optimal minimax regression designs on discrete design space

One classical design criterion is to minimize the determinant of the covariance matrix of the regression estimates, and the designs are called D-optimal designs. To reflect the nature that the proposed models are only approximately true, we propose a robust design criterion to study response surface designs. Both the variance and bias are considered in the criterion. In particular, D-optimal minimax designs are investigated and constructed. Examples are given to compare D-optimal minimax designs with classical D-optimal designs.     

Asymptotic results in canonical discriminant analysis when the dimension is large compared to the sample size

This paper deals with the distributions of test statistics for the number of useful discriminant functions and the characteristic roots in canonical discriminant analysis. These asymptotic distributions have been extensively studied when the number p   of variables is fixed, the number q+1$q+1$ of groups is fixed, and the sample size N tends to infinity. However, these approximations become increasingly inaccurate as the value of p increases for a fixed value of N. On the other hand, we encounter to analyze high-dimensional data such that p is large compared to n. The purpose of the present paper is to derive asymptotic distributions of these statistics in a high-dimensional framework such that q   is fixed, p→∞$p\to \infty$, m=n-p+q→∞$m=n-p+q\to \infty$, and p/n→c∈(0,1)$p/n\to c\in (0,1)$, where n=N-q-1$n=N-q-1$. Numerical simulation revealed that our new asymptotic approximations are more accurate than the classical asymptotic approximations in a considerably wide range of (n,p,q)$(n,p,q)$.     

Ordered ranked set samples and applications to inference

Ranked set sampling (RSS) was first proposed by McIntyre [1952. A method for unbiased selective sampling, using ranked sets. Australian J. Agricultural Res. 3, 385–390] as an effective way to estimate the unknown population mean. Chuiv and Sinha [1998. On some aspects of ranked set sampling in parametric estimation. In: Balakrishnan, N., Rao, C.R. (Eds.), Handbook of Statistics, vol. 17. Elsevier, Amsterdam, pp. 337–377] and Chen et al. [2004. Ranked Set Sampling—Theory and Application. Lecture Notes in Statistics, vol. 176. Springer, New York] have provided excellent surveys of RSS and various inferential results based on RSS. In this paper, we use the idea of order statistics from independent and non-identically distributed (INID) random variables to propose ordered ranked set sampling (ORSS) and then develop optimal linear inference based on ORSS. We determine the best linear unbiased estimators based on ORSS (BLUE-ORSS) and show that they are more efficient than BLUE-RSS for the two-parameter exponential, normal and logistic distributions. Although this is not the case for the one-parameter exponential distribution, the relative efficiency of the BLUE-ORSS (to BLUE-RSS) is very close to 1. Furthermore, we compare both BLUE-ORSS and BLUE-RSS with the BLUE based on order statistics from a simple random sample (BLUE-OS). We show that BLUE-ORSS is uniformly better than BLUE-OS, while BLUE-RSS is not as efficient as BLUE-OS for small sample sizes (n<5$n<5$).