Balanced arrays of strength 4 and balanced fractional 3m factorial designs

A connection between a balanced fractional 2^m factorial design of resolution 2l + 1 and a balanced array of strength 2l with index set {μ₀, μ₁,…, μ_2l} was established by Yamamoto, Shirakura and Kuwada (1975). The main purpose of this paper is to give a connection between a balanced fractional 3^m factorial design of resolution V and a balanced array of strength 4, size N, m constraints, 3 levels and index set {λ_l0l1l2}.     

Computationally efficient classes of higher-order kernel functions

Classes of higher-order kernels for estimation of a probability density are constructed by iterating the twicing procedure. Given a kernel K of order l, we build a family of kernels K_m of orders l(m + 1) with the attractive property that their Fourier transforms are simply 1 — {1 —$(.)}^m+1, where ? is the Fourier transform of K. These families of higher-order kernels are well suited when the fast Fourier transform is used to speed up the calculation of the kernel estimate or the least-squares cross-validation procedure for selection of the window width. We also compare the theoretical performance of the optimal polynomial-based kernels with that of the iterative twicing kernels constructed from some popular second-order kernels.     

Generalized Laplacian approximations in Bayesian inference

This paper presents a new Laplacian approximation to the posterior density of η = g(θ). It has a simpler analytical form than that described by Leonard et al. (1989). The approximation derived by Leonard et al. requires a conditional information matrix R_η to be positive definite for every fixed η. However, in many cases, not all R_η are positive definite. In such cases, the computations of their approximations fail, since the approximation cannot be normalized. However, the new approximation may be modified so that the corresponding conditional information matrix can be made positive definite for every fixed η. In addition, a Bayesian procedure for contingency-table model checking is provided. An example of cross-classification between the educational level of a wife and fertility-planning status of couples is used for explanation. Various Laplacian approximations are computed and compared in this example and in an example of public school expenditures in the context of Bayesian analysis of the multiparameter Fisher-Behrens problem.     

A stochastic Newton-Raphson method

A stochastic approximation procedure of the Robbins-Monro type is considered. The original idea behind the Newton-Raphson method is used as follows. Given n approximations X₁,…, X_n with observations Y₁,…, Y_n, a least squares line is fitted to the points (X_m, Y_m),…, (X_n, Y_n) where m<n may depend on n. The (n+1)st approximation is taken to be the intersection of the least squares line with y=0. A variation of the resulting process is studied. It is shown that this process yields a strongly consistent sequence of estimates which is asymptotically normal with minimal asymptotic variance.     

On the norm of alias matrices in balanced fractional 2m factorial designs of resolution 2l + 1

The norm $\text{6A6 = {tr(A′A)}}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ of the alias matrix A of a design can be used as a measure for selecting a design. In this paper, an explicit expression for 6A6 will be given for a balanced fractional 2^m factorial design of resolution 2l + 1 which obtained from a simple array with parameters (m; λ₀, λ₁,…, λ_m). This array is identical with a balanced array of strength m, m constraints and index set {λ₀, λ₁,…, λ_m}. In the class of the designs of resolution V (l = 2) obtained from S-arrays, ones which minimize 6A6 will be presented for any fixed N assemblies satisfying (i) m = 4, 11 ? N ? 16, (ii) m = 5, 16 ? N ? 32, and (iii) m = 6, 22 ? N ? 40.     

Monotonic minimax estimators of a 2×2 covariance matrix

Let S : 2 × 2 have a nonsingular Wishart distribution with unknown matrix σ and n degrees of freedom. For estimating σ two families of mimmax estimators, with respect to the entropy loss, are presented. These estimators are of the form σ(S) = Rø(L)R^t where R is orthogonal, L and Φ are diagonal, and RLR^T = S. Conditions under which the components of Φ and L follow the same order relation [i.e., writing Φ = diag(Φ₁,Φ₂) and L = diag(l₁,/₂) with l₁ ≥ l₂, we have Φ₁ ≥ Φ₂] are established. Comparisons with Stein's estimators and other orthogonally invariant estimators are discussed.     

Combined Bayesian estimates for the equicorrelation coefficient

Combined Bayesian estimates for equicorrelation covariance matrices are considered. The case of a common equicorrelation p and possibly different standard deviations σ_l,σ_k among k experimental groups is examined first, and the Bayesian estimation of (σ, σ₁,σ_k) is discussed. Secondly, under the assumption of a common standard deviation and possibly different equicorrelations, the Bayesian estimation of (ρ₁,ρ_k,σ) is considered.     

Search designs for 2m factorials derived from balanced arrays of strength 2(l+1) and ad-optimal search designs

We consider a search design for the 2^m type such that at most knonnegative effects can be searched among (l+1)-factor interactions and estimated along with the effects up to l- factor interactions, provided (l+1)-factor and higher order interactions are negligible except for the k effects. We investigate some properties of a search design which is yielded by a balanced 2^m design of resolution 2l+1 derived from a balanced array of strength 2(l+1). A necessary and sufficient condition for the balanced design of resolution 2l+1 to be a search design for k=1 is given. Optimal search designs for k=1 in the class of the balanced 2^m designs of resolution V (l=2), with respect to the AD-optimality criterion given by Srivastava (1977), with N assemblies are also presented, where the range of (m,N) is (m=6; 28≤N≤41), (m=7; 35≤N≤63) and (m=8; 44≤N≤74).     

Methods for calculating stationary distribution in linear models of time series

The article deals with methods for computing the stationary marginal distribution in linear models of time series. Two approaches are described. First, an algorithm based on approximation of solution of the corresponding integral equation is briefly reviewed. Then, we study the limit behaviour of the partial sums c ₁ η₁+c ₂ η₂+···+c _n η _n where η _i are i.i.d. random variables and c _i real constants. We generalize procedure of Haiman (1998) [Haiman, G., 1998, Upper and lower bounds for the tail of the invariant distribution of some AR(1) processes. Asymptotic Methods in Probability and Statistics, 45, 723–730.] to an arbitrary causal linear process and relax the assumptions of his result significantly. This is achieved by investigating the properties of convolution of densities.     

Nonparametric comparison of curves with dependent errors

Suppose that data {(x _l,i,n , y _l,i,n ): l?=?1, …, k; i?=?1, …, n} are observed from the regression models: Y _l,i,n ?=?m _l (x _l,i,n )?+?? _l,i,n , l?=?1, …, k, where the regression functions {m _l } _l=1 ^k are unknown and the random errors {? _l,i,n } are dependent, following an MA(∞) structure. A new test is proposed for testing the hypothesis H ₀: m ₁?=?·?·?·?=?m _k , without assuming that {m _l } _l=1 ^k are in a parametric family. The criterion of the test derives from a Crámer-von-Mises-type functional based on different distances between {[mcirc]} _l and {[mcirc]} _s , l?≠?s, l, s?=?1, …, k, where {[mcirc] _l } _l=1 ^k are nonparametric Gasser–Müller estimators of {m _l } _l=1 ^k . A generalization of the test to the case of unequal design points, with different sample sizes {n _l } _l=1 ^k and different design densities {f _l } _l=1 ^k , is also considered. The asymptotic normality of the test statistic is obtained under general conditions. Finally, a simulation study and an analysis with real data show a good behavior of the proposed test.     

Optimal Designs for Approximating a Stochastic Process with Respect to a Minimax Criterion

We study the problem of approximating a stochastic process Y = {Y(t: t ∈ T} with known and continuous covariance function R on the basis of finitely many observations Y(t ₁,), …, Y(t _n ). Dependent on the knowledge about the mean function, we use different approximations ? and measure their performance by the corresponding maximum mean squared error sub _t∈T E(Y(t) ? ?(t))². For a compact T ? ? ^p we prove sufficient conditions for the existence of optimal designs. For the class of covariance functions on T ² = [0, 1]² which satisfy generalized Sacks/Ylvisaker regularity conditions of order zero or are of product type, we construct sequences of designs for which the proposed approximations perform asymptotically optimal.     

Allocating observations between two normal populations to maximize the half slope of the F-test

Consider two independent normal populations. Let R denote the ratio of the variances. The usual procedure for testing H₀: R = 1 vs. H₁: R = r, where r≠1, is the F-test. Let θ denote the proportion of observations to be allocated to the first population. Here we find the value of θ that maximizes the rate at which the observed significance level of the F-test converges to zero under H₁, as measured by the half slope.     

Characterizations of geometric distribution and discrete IFR (DFR) distributions using order statistics

Let X be a discrete random variable the set of possible values (finite or infinite) of which can be arranged as an increasing sequence of real numbers a₁<a₂<a₃<…. In particular, a_i could be equal to i for all i. Let X_1n≦X_2n≦?≦X_nn denote the order statistics in a random sample of size n drawn from the distribution of X, where n is a fixed integer ≧2. Then, we show that for some arbitrary fixed k(2≦k≦n), independence of the event {X_kn=X_1n} and X_1n is equivalent to X being either degenerate or geometric. We also show that the montonicity in i of P{X_kn = X_1n | X_1n = a_i} is equivalent to X having the IFR (DFR) property. Let a_i = i and $\text{G(i) = P(X≧i), i = 1, 2, …}$. We prove that the independence of {X_2n ? X_1n ∈B} and X_1n for all i is equivalent to X being geometric, where B = {m} (B = {m,m+1,…}), provided G(i) = q^i?1, 1≦i≦m+2 (1≦i≦m+1), where 0<q<1.     

A NEW APPROXIMATION FOR FISHER'S Z

As the sample size increases, the coefficient of skewness of the Fisher's transformation z= tanh^-1r, of the correlation coefficient decreases much more rapidly than the excess of its kurtosis. Hence, the distribution of standardized z can be approximated more accurately in terms of the t distribution with matching kurtosis than by the unit normal distribution. This t distribution can, in turn be subjected to Wallace's approximation resulting in a new normal approximation for the Fisher's z transform. This approximation, which can be used to estimate the probabilities, as well as the percentiles, compares favorably in both accuracy and simplicity, with the two best earlier approximations, namely, those due to Ruben (1966) and Kraemer (1974). Fisher (1921) suggested approximating distribution of the variance stabilizing transform z=(1/2) log ((1 +r)/(1r)) of the correlation coefficient r by the normal distribution with mean = (1/2) log ((1 + p)/(lp)) and variance =l/(n3). This approximation is generally recognized as being remarkably accurate when ||Gr| is moderate but not so accurate when ||Gr| is large, even when n is not small (David (1938)). Among various alternatives to Fisher's approximation, the normalizing transformation due to Ruben (1966) and a t approximation due to Kraemer (1973), are interesting on the grounds of novelty, accuracy and/or aesthetics. If r?= r/√ (1r²) and r?|Gr = |Gr/√(1|Gr²), then Ruben (1966) showed that (1) g_n (r,|Gr) ={(2n5)/2}^1/2r?r{(2n3)/2}^1/2r?|GR, {1 + (1/2)(r?r²+r?|Gr²)}^1/2 is approximately unit normal. Kraemer (1973) suggests approximating (2) t_n (r, |Gr) = (r|GR¹) √ (n2), √(11r²) √(1|Gr²) by a Student's t variable with (n2) degrees of freedom, where after considering various valid choices for |Gr¹ she recommends taking |Gr¹= |Gr*, the median of r given n and |Gr.     

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).     

The null distribution of multivariate kurtosis

The paper introduces a x²-approximation to multivariate kurtosis b_2,punder normality. It requires calculating the third moment of b_2,pwhich is obtained. We compare the approximation with simulated percentage points and the normal approximation, and find it to be adequate for p=l and 2. For p=3, the simple average of this estimate and the normal approximation is found to be generally superior to either approximation on its own. For p=4, the normal approximation is best for non-extreme values of ∝     

A class of tests for testing ‘new is better than used’

A class of tests is proposed for testing H₀ F?(x) = e^?λx, λ > 0, x≥0 vs. H₁ F?(x + y) ≤ F?(x)F?(y), x, y≥0, with strict inequality for some x, y ≥ 0 (F = new is better than used). Efficiency comparisons of some tests within the class are made and a new test is proposed on the basis of these comparisons. Consistency and the asymptotic normality of the class of tests is proved under fairly broad conditions on the underlying entities.     

Implications of survey design for generalized regression estimation of linear functions

The paper presents a general randomization theory approach to point and interval estimation of Q linear functions T_q = Σ^N₁c_kqY_k(q = 1,…,Q), where Y₁,…,Y_N are values of a variable of interest Y in a finite population. Such linear functions include population and domain means and totals, population regression coefficients, etc. We assume that some auxiliary information can be exploited. This suggests the generalized regression technique based on the fit of a linear model, whereby is created approximately design unbiased estimators T?_q. The paper focuses on estimation of the variance-covariance matrix of the T?_q for single stage and two stage designs. Two techniques based on Taylor expansions are compared. Results of Monte-Carlo experiments (not reported here) show that the coverage properties are good of normal-theory confidence intervals flowing from one or the other variance estimate.     

Information in experiments and sufficiency

We define measures of information contained in an experiment which are by-products of the parametric measures of Fisher, Vajda, Mathai and Boekee and the non-parametric measures of Bhattacharyya, Rényi, Matusita, Kagan and Csiszár. We use these measures to compare sufficient experiments according to Blackwell's definition. In particular, we prove that if δ_X and δ_Y are two experiments and δ_X≥δ_Y then l_X≥l_y for all of the above measures.