Perspectivities in irreducible collineation groups of projective planes,II

Collineation groups of finite projective planes are studied which do not leave invariant any point, line or triangle and contain a non-trivial perspectivity. In many instances the collineation group G can be determined, and it can be proved that the underlying projective plane contains a desarguesian subplane, whose order is related to the order of G. This can be done, because one has rather strong results about the structure of G, in particular about the first terms of a chief series of G. Projective planes are taken here as a suitable testing ground for methods, which can be used for many classes of designs to quickly find new examples and obtain some classification.     

A study of generalized skew-normal distribution

Following the paper by Genton and Loperfido [Generalized skew-elliptical distributions and their quadratic forms, Ann. Inst. Statist. Math. 57 (2005), pp. 389–401], we say that Z has a generalized skew-normal distribution, if its probability density function (p.d.f.) is given by f(z)=2φ _p (z; ξ, Ω)π (z?ξ), z∈? ^p , where φ _p (·; ξ, Ω) is the p-dimensional normal p.d.f. with location vector ξ and scale matrix Ω, ξ∈? ^p , Ω>0, and π is a skewing function from ? ^p to ?, that is 0≤π (z)≤1 and π (?z)=1?π (z), ? z∈? ^p . First the distribution of linear transformations of Z are studied, and some moments of Z and its quadratic forms are derived. Next we obtain the joint moment-generating functions (m.g.f.’s) of linear and quadratic forms of Z and then investigate conditions for their independence. Finally explicit forms for the above distributions, m.g.f.’s and moments are derived when π (z)=κ (α′z), where α∈? ^p and κ is the normal, Laplace, logistic or uniform distribution function.     

Some aspects of the theory of estimating equations

An estimating equation for a parameter θ, based on an observation ?, is an equation g(x,θ)=0 which can be solved for θ in terms of x. An estimating equation is unbiased if the funaction g has 0 mean for every θ. For the case when the form of the frequency function p(x,θ) is completely specified up to the unknown real parameter θ, the optimality of the m.1 equation $\text{?}\text{log}\text{p}\text{?θ}\text{=0}$ in the class of all unbiased estimating equations was established by Godambe (1960). In this paper we allow the form of the frequency function p to vary assuming that $\text{x=(x}{}_1\text{,…,x}{}_{\mathrm{n}}\text{)?}\text{R}{}^{\mathrm{n}}$ and that under p, E(x_i)=θ. x₁,…, x_n are independent observations on a variate x, it is shown that among all the unbiased estimating equations for θ, $\text{x}\text{?}\text{?θ=0}$ is uniquely optimum up to a constant multiple.     

Projective (2n,n,λ,1)-designs

A projective (2n,n,λ,1)-design is a set $\text{D}$ of n element subsets (called blocks) of a 2n-element set V having the properties that each element of V is a member of λ blocks and every two blocks have a non-empty intersection. This paper establishes existence and non-existence results for various projective (2n,n,λ,1)-designs and their subdesigns.     

Non-parametric recursive estimates of a probability density function and its derivatives

Recursive estimates of a probability density function (pdf) are known. This paper presents recursive estimates of a derivative of any desired order of a pdf. Let f be a pdf on the real line and p?0 be any desired integer. Based on a random sample of size n from f, estimators f^(p)_n of f^(p), the pth order derivatives of f, are exhibited. These estimators are of the form $\text{n}{}^{\mathrm{?1}}\text{∑n}\text{j=1}\text{δ}{}_{\mathrm{jp}}$, where δ_jp depends only on p and the jth observation in the sample, and hence can be computed recursively as the sample size increases. These estimators are shown to be asymptotically unbiased, mean square consistent and strongly consistent, both at a point and uniformly on the real line. For pointwise properties, the conditions on f^(p) have been weakened with a little stronger assumption on the kernel function.     

Results for two-level fractional factorial designs of resolution IV or more

The main theorem of this paper shows that foldover designs are the only (regular or nonregular) two-level factorial designs of resolution IV (strength 3) or more for n   runs and n/3?m?n/2$n/3?m?n/2$ factors. This theorem is a generalization of a coding theory result of Davydov and Tombak [1990. Quasiperfect linear binary codes with distance 4 and complete caps in projective geometry. Problems Inform. Transmission 25, 265–275] which, under translation, effectively states that foldover (or even) designs are the only regular two-level factorial designs of resolution IV or more for n   runs and 5n/16?m?n/2$5n/16?m?n/2$ factors. This paper also contains other theorems including an alternative proof of Davydov and Tombak's result.     

Estimating the Proportion of True Null Hypotheses in Nonparametric Exponential Mixture Model with Appication to the Leukemia Gene Expression Data

We revisit the problem of estimating the proportion π of true null hypotheses where a large scale of parallel hypothesis tests are performed independently. While the proportion is a quantity of interest in its own right in applications, the problem has arisen in assessing or controlling an overall false discovery rate. On the basis of a Bayes interpretation of the problem, the marginal distribution of the p-value is modeled in a mixture of the uniform distribution (null) and a non-uniform distribution (alternative), so that the parameter π of interest is characterized as the mixing proportion of the uniform component on the mixture. In this article, a nonparametric exponential mixture model is proposed to fit the p-values. As an alternative approach to the convex decreasing mixture model, the exponential mixture model has the advantages of identifiability, flexibility, and regularity. A computation algorithm is developed. The new approach is applied to a leukemia gene expression data set where multiple significance tests over 3,051 genes are performed. The new estimate for π with the leukemia gene expression data appears to be about 10% lower than the other three estimates that are known to be conservative. Simulation results also show that the new estimate is usually lower and has smaller bias than the other three estimates.     

Second order asymptotic relations of M-estimators and R-estimators in two-sample location model

Let T_M be an M-estimator (maximum likelihood type estimator) and T_R be an R-estimator (Hodges-Lehmann's estimator) of the shift parameter Δ in the two-sample location model. The asymptotic representation of √N(T_M-T_R) up to a term of the order O_p(N^{-$\text{1}\text{4}$}) is derived which is valid if the functions Ψ and ? generating T_M and T_R, respectively, decompose into an absolutely continuous and a step-function components; the order O_p(N^{-$\text{1}\text{4}$}) cannot be improved unless the discontinuous components vanish. As a consequence, the conditions under which √N(T_M-T_R)=O_p(N^{-$\text{1}\text{4}$}) are obtained. The main tool for obtaining the results is the second order asymptotic linearity of the pertaining linear rank statistics which is proved here under the assumption that the score-generating function ? has some jump-discontinuities.     

Circular balanced repeated measurement designs in periods of three different sizes

Abstract

Repeated measurement designs are widely used in medicine, pharmacology, animal sciences and psychology. If there is a restriction on the total number of treatments, some experimental units can receive on the total length of time while some experimental units can remain in the trial, then repeated measurements designs with unequal period sizes should be used. In this article, some infinite series are developed to generate the minimal balanced repeated measurement designs in periods of three different sizes p₁, p₂ and p₃, where 2?≤?p₃?<?p₂ ≤ 10 and p₂?<?p₁.     

Bayesian feature selection for classification with possibly large number of classes

In what follows, we introduce two Bayesian models for feature selection in high-dimensional data, specifically designed for the purpose of classification. We use two approaches to the problem: one which discards the components which have “almost constant” values (Model 1) and another which retains the components for which variations in-between the groups are larger than those within the groups (Model 2). We assume that p?n, i.e. the number of components p is much larger than the number of samples n, and that only few of those p components are useful for subsequent classification. We show that particular cases of the above two models recover familiar variance or ANOVA-based component selection. When one has only two classes and features are a priori independent, Model 2 reduces to the Feature Annealed Independence Rule (FAIR) introduced by Fan and Fan (2008) and can be viewed as a natural generalization of FAIR to the case of L>2 classes. The performance of the methodology is studies via simulations and using a biological dataset of animal communication signals comprising 43 groups of electric signals recorded from tropical South American electric knife fishes.     

EMPIRICAL LIKELIHOOD‐BASED INFERENCES FOR PARTIALLY LINEAR MODELS WITH MISSING COVARIATES

This paper considers statistical inference for partially linear models Y = X ^? β +ν(Z) +? when the linear covariate X is missing with missing probability π depending upon (Y, Z). We propose empirical likelihood‐based statistics to construct confidence regions for β and ν(z). The resulting empirical likelihood ratio statistics are shown to be asymptotically chi‐squared‐distributed. The finite‐sample performance of the proposed statistics is assessed by simulation experiments. The proposed methods are applied to a dataset from an AIDS clinical trial.     

Sequential estimation of the sum of sinusoidal model parameters

Estimating the parameters of the sum of a sinusoidal model in presence of additive noise is a classical problem. It is well known to be a difficult problem when the two adjacent frequencies are not well separated or when the number of components is very large. In this paper we propose a simple sequential procedure to estimate the unknown frequencies and amplitudes of the sinusoidal signals. It is observed that if there are p components in the signal then at the k  th (k?p)$(k?p)$ stage our procedure produces strongly consistent estimators of the k   dominant sinusoids. For k>p$k>p$, the amplitude estimators converge to zero almost surely. Asymptotic distribution of the proposed estimators is also established and it is observed that it coincides with the asymptotic distribution of the least squares estimators. Numerical simulations are performed to observe the performance of the proposed estimators for different sample sizes and for different models. One ECG data and one synthesized data are analyzed for illustrative purpose.     

A construction for generalized hadamard matrices

We prove that if p^r and p^r ? 1 are both prime powers then there is a generalized Hadamard matrix of order p^r(p^r ? 1) with elements from the elementary abelian group Z_p x?x Z_p. This result was motivated by results of Rajkundia on BIBD's. This result is then used to produce p^r ? 1 mutually orthogonal F-squares F(p^r(p^r ? 1); p^r ? 1).     

A modified Cp statistic in a system-of-equations model

A new statistic, SΓ(p), is developed for variable selection in a system-of-equations model. The standardized total mean square error in the SΓ(p)statistic is weighted by the covariance matrix of dependent variables instead of the error covariance matrix of the true model as in the original definition. The new statistic can be also used for model selection in the non-nested models. The estimate of SΓ(p), SC(p), is derived and shown to become SC_ε(p) in the similar form of C_p in a single-equation model when the covariance matrix of sampled dependent variables is replaced by the error covariance matrix under the full model.     

A note on the construction of optimal linear codes

Let us denote by (n,k,d)-code, a binary linear code with code length nk information symbols and the minimum distance d. It is well known that the problem of obtaining a binary linear code whose code length n is minimum among (n,k,d)-codes for given integers k and d, is equivalent to solve a linear programming whose solutions correspond to a minimum redundancy error-correcting code. In this paper it will be shown that for some given integers d, there exists no solution of the linear programming except a solution which is obtained using a flat in a finite projective geometry.     

On cone representations of translation planes

Let F be a field of order q. It is known that an orthogonal array of the same order q has rank n over F if and only if it is represented as a cone cut by hyperplanes in n-dimensional space over F. Here we show that translation planes have a cone representation in (n + 1)-dimensional space over F, where n is the dimension of the plane over its kernel. If the plane is a semifield plane then the representation takes a particularly nice form. Rank 3 representations of Moulton planes are also briefly discussed.     

Fitting a multiple regression function

Consider the p-dimensional unit cube [0,1]^p, p≥1. Partition [0, 1]^p into n regions, R_1,n,…,R_n,n such that the volume Δ(R_j,n) is of order n^?1,j=1,…,n. Select and fix a point in each of these regions so that we have x⁽ⁿ⁾₁,…,x⁽ⁿ⁾_n. Suppose that associated with the j-th predictor vector x⁽ⁿ⁾_j there is an observable variable Y⁽ⁿ⁾_j, j=1,…,n, satisfying the multiple regression model $\text{Y}{}^{\mathrm{(n)}}{}_{\mathrm{j}}\text{=g(}\text{x}{}^{\mathrm{(n)}}{}_{\mathrm{j}}\text{)+e}{}^{\mathrm{(n)}}{}_{\mathrm{j}}$, where g is an unknown function defined on [0, 1]^pand {e⁽ⁿ⁾_j} are independent identically distributed random variables with Ee⁽ⁿ⁾₁=0 and Var e⁽ⁿ⁾₁=σ²<∞. This paper proposes as an estimator of g(x), where k(u) is a known p-dimensional bounded density and {a_n} is a sequence of reals converging to 0 asn→∞. Weak and strong consistency of g_n(x) and rates of convergence are obtained. Asymptoticnormality of the estimator is established. Also proposed is $\text{σ}{}^2{}_{\mathrm{n}}\text{=n}{}^{\mathrm{?1}}\text{Σ}{}^{\mathrm{n}}{}_{\mathrm{j=1}}\text{(Y}{}^{\mathrm{(n)}}{}_{\mathrm{j}}\text{?g}{}_{\mathrm{n}}\text{(}\text{x}{}^{\mathrm{(n)}}{}_{\mathrm{j}}\text{))}{}^2$ as a consistent estimate of σ².     

Three Recommendations for Improving the Use of p-Values

ABSTRACT

Researchers commonly use p-values to answer the question: How strongly does the evidence favor the alternative hypothesis relative to the null hypothesis? p-Values themselves do not directly answer this question and are often misinterpreted in ways that lead to overstating the evidence against the null hypothesis. Even in the “post p?<?0.05 era,” however, it is quite possible that p-values will continue to be widely reported and used to assess the strength of evidence (if for no other reason than the widespread availability and use of statistical software that routinely produces p-values and thereby implicitly advocates for their use). If so, the potential for misinterpretation will persist. In this article, we recommend three practices that would help researchers more accurately interpret p-values. Each of the three recommended practices involves interpreting p-values in light of their corresponding “Bayes factor bound,” which is the largest odds in favor of the alternative hypothesis relative to the null hypothesis that is consistent with the observed data. The Bayes factor bound generally indicates that a given p-value provides weaker evidence against the null hypothesis than typically assumed. We therefore believe that our recommendations can guard against some of the most harmful p-value misinterpretations. In research communities that are deeply attached to reliance on “p?<?0.05,” our recommendations will serve as initial steps away from this attachment. We emphasize that our recommendations are intended merely as initial, temporary steps and that many further steps will need to be taken to reach the ultimate destination: a holistic interpretation of statistical evidence that fully conforms to the principles laid out in the ASA statement on statistical significance and p-values.     

Rates of convergence of Lp-estimators for a density with an infinity cusp

We study the asymptotics of L_p-estimators, p>0, as estimates of a parameter of location for data coming for a symmetric density with an infinity cusp at the center of symmetry of the distribution. In this situation, the data are more concentrated around the parameter of location than in usual cases. The maximum-likelihood estimator is not defined. The rates of convergence of the L_p-estimators in this situation depend on p and on the shape of the density. For some densities and small values of p, the L_p-estimator converges with a fast rate of convergence.     

An improved Cp criterion for spline smoothing

Spline smoothing is a popular technique for curve fitting, in which selection of the smoothing parameter is crucial. Many methods such as Mallows’ C_p, generalized maximum likelihood (GML), and the extended exponential (EE) criterion have been proposed to select this parameter. Although C_p is shown to be asymptotically optimal, it is usually outperformed by other selection criteria for small to moderate sample sizes due to its high variability. On the other hand, GML and EE are more stable than C_p, but they do not possess the same asymptotic optimality as C_p. Instead of selecting this smoothing parameter directly using C_p, we propose to select among a small class of selection criteria based on Stein's unbiased risk estimate (SURE). Due to the selection effect, the spline estimate obtained from a criterion in this class is nonlinear. Thus, the effective degrees of freedom in SURE contains an adjustment term in addition to the trace of the smoothing matrix, which cannot be ignored in small to moderate sample sizes. The resulting criterion, which we call adaptive C_p, is shown to have an analytic expression, and hence can be efficiently computed. Moreover, adaptive C_p is not only demonstrated to be superior and more stable than commonly used selection criteria in a simulation study, but also shown to possess the same asymptotic optimality as C_p.