On skew-Hadamard matrices

Skew-Hadamard matrices are of special interest due to their use, among others, in constructing orthogonal designs. In this paper, we give a survey on the existence and equivalence of skew-Hadamard matrices. In addition, we present some new skew-Hadamard matrices of order 52 and improve the known lower bound on the number of the skew-Hadamard matrices of this order.     

Circulant partial Hadamard matrices

A question arising in stream cypher cryptanalysis is reframed and generalized in the setting of Hadamard matrices as follows: For given n, what is the maximum value of k   for which there exists a k×n$k\times n$(±1)$(\pm 1)$-matrix A   such that AA^T=n_Ik$A{A}^{\mathsf{T}}=n{I}_k$, with each row after the first obtained by a cyclic shift of its predecessor by one position? For obvious reasons we call such matrices circulant partial Hadamard matrices. Further, what is the maximum value of k subject to the condition that the row sums are equal to r?     

A contribution to multivariate L-moments: L-comoment matrices

Multivariate statistical analysis relies heavily on moment assumptions of second order and higher. With increasing interest in heavy-tailed distributions, however, it is desirable to describe dispersion, skewness, and kurtosis under merely first order moment assumptions. Here, the univariate L-moments of Hosking [L-moments: analysis and estimation of distributions using linear combinations of order statistics, J. Roy. Statist. Soc. Ser. B 52 (1990) 105-124] are extended to “L-comoments” analogous to covariance. For certain models, the second order case yields correlational analysis coherent with classical correlation but also meaningful under just first moment assumptions. We develop properties and estimators for L-comoments, illustrate for several multivariate models, examine behavior of sample multivariate L-moments with heavy-tailed data, and discuss applications to financial risk analysis and regional frequency analysis.     

Orthogonal arrays obtained by generalized difference matrices with g levels

Nowadays orthogonal arrays play important roles in statistics, computer science, coding theory and cryptography. The usual difference matrices are essential for the construction for many mixed orthogonal arrays. But there are also orthogonal arrays which cannot be obtained by the usual difference matrices, such as mixed orthogonal arrays of run size 60. In order to construct these mixed orthogonal arrays, a class of special so-called generalized difference matrices were discovered by Zhang (1989,1990,1993,2...     

Some bounds for partially balanced block designs

Bounds on eigenvalues of theC-matrix for a partially balanced block (PBB) design are given together with some bounds on the number of blocks. Furthermore, a certain equiblock-sized PBB design is characterized. These results contain, as special cases, the known results for variance-balanced block designs and so on.     

Testing the equality of several covariance matrices with fewer observations than the dimension

For normally distributed data from the k populations with m×m covariance matrices Σ₁,…,Σ_k, we test the hypothesis H:Σ₁=?=Σ_k vs the alternative A≠H when the number of observations N_i, i=1,…,k from each population are less than or equal to the dimension m, N_i≤m, i=1,…,k. Two tests are proposed and compared with two other tests proposed in the literature. These tests, however, do not require that N_i≤m, and thus can be used in all situations, including when the likelihood ratio test is available. The asymptotic distributions of the test statistics are given, and the power compared by simulations with other test statistics proposed in the literature. The proposed tests perform well and better in several cases than the other two tests available in the literature.     

Empirical likelihood for semiparametric regression model with missing response data

A bias-corrected technique for constructing the empirical likelihood ratio is used to study a semiparametric regression model with missing response data. We are interested in inference for the regression coefficients, the baseline function and the response mean. A class of empirical likelihood ratio functions for the parameters of interest is defined so that undersmoothing for estimating the baseline function is avoided. The existing data-driven algorithm is also valid for selecting an optimal bandwidth. Our approach is to directly calibrate the empirical log-likelihood ratio so that the resulting ratio is asymptotically chi-squared. Also, a class of estimators for the parameters of interest is constructed, their asymptotic distributions are obtained, and consistent estimators of asymptotic bias and variance are provided. Our results can be used to construct confidence intervals and bands for the parameters of interest. A simulation study is undertaken to compare the empirical likelihood with the normal approximation-based method in terms of coverage accuracies and average lengths of confidence intervals. An example for an AIDS clinical trial data set is used for illustrating our methods.     

Stochastic comparisons in multivariate mixed model of proportional reversed hazard rate with applications

This paper studies the multivariate mixed proportional reversed hazard rate model having dependent mixing variables. Stochastic comparison as well as aging properties in this model are investigated, and stochastic monotone properties of the population vector with respect to the mixing vector are also discussed. Moreover, MTP₂ dependence among the mixing vectors is proved to imply the increasingness of the reversed hazard rate with respect to the baseline one. Finally, some interesting applications are presented as well.     

Optimum two level fractional factorial plans for model identification and discrimination

Model identification and discrimination are two major statistical challenges. In this paper we consider a set of models M_k for factorial experiments with the parameters representing the general mean, main effects, and only k out of all two-factor interactions. We consider the class D of all fractional factorial plans with the same number of runs having the ability to identify all the models in M_k, i.e., the full estimation capacity.The fractional factorial plans in D with the full estimation capacity for k?2 are able to discriminate between models in M_u for u?k^*, where k^*=(k/2) when k is even, k^*=((k-1)/2) when k is odd. We obtain fractional factorial plans in D satisfying the six optimality criterion functions AD, AT, AMCR, GD, GT, and GMCR for 2^m factorial experiments when m=4 and 5. Both single stage and multi-stage (hierarchical) designs are given. Some results on estimation capacity of a fractional factorial plan for identifying models in M_k are also given. Our designs D4.1 and D10 stand out in their performances relative to the designs given in Li and Nachtsheim [Model-robust factorial designs, Technometrics 42(4) (2000) 345-352.] for m=4 and 5 with respect to the criterion functions AD, AT, AMCR, GD, GT, and GMCR. Our design D4.2 stands out in its performance relative the Li-Nachtsheim design for m=4 with respect to the four criterion functions AT, AMCR, GT, and GMCR. However, the Li-Nachtsheim design for m=4 stands out in its performance relative to our design D4.2 with respect to the criterion functions AD and GD. Our design D14 does have the full estimation capacity for k=5 but the twelve run Li-Nachtsheim design does not have the full estimation capacity for k=5.     

Inequalities associated with intra-inter-class correlation matrices

This paper complements the results of Tong (Ann. Statist. 17 (1989) 429), Shaked and Tong (Ann. Statist. 20 (1992) 614) and Eaton (in: Stochastic Inequalities, IMS Lecture Notes Monograph Series, Vol. 22, 1993, 76) by deriving some monotonicity results associated with intra-inter-class correlation matrices. In Section 2, we consider the problem of comparing these matrices in terms of the orderings induced by several subgroups of the orthogonal group. Section 3 is devoted to deriving some probability inequalities for normal random variables whose correlation matrix is of the intra-inter-class correlation structure.     

Successive direction extraction for estimating the central subspace in a multiple-index regression

In this paper we propose a dimension reduction method for estimating the directions in a multiple-index regression based on information extraction. This extends the recent work of Yin and Cook [X. Yin, R.D. Cook, Direction estimation in single-index regression, Biometrika 92 (2005) 371-384] who introduced the method and used it to estimate the direction in a single-index regression. While a formal extension seems conceptually straightforward, there is a fundamentally new aspect of our extension: We are able to show that, under the assumption of elliptical predictors, the estimation of multiple-index regressions can be decomposed into successive single-index estimation problems. This significantly reduces the computational complexity, because the nonparametric procedure involves only a one-dimensional search at each stage. In addition, we developed a permutation test to assist in estimating the dimension of a multiple-index regression.     

Empirical likelihood inference in partially linear single-index models for longitudinal data

The empirical likelihood method is especially useful for constructing confidence intervals or regions of parameters of interest. Yet, the technique cannot be directly applied to partially linear single-index models for longitudinal data due to the within-subject correlation. In this paper, a bias-corrected block empirical likelihood (BCBEL) method is suggested to study the models by accounting for the within-subject correlation. BCBEL shares some desired features: unlike any normal approximation based method for confidence region, the estimation of parameters with the iterative algorithm is avoided and a consistent estimator of the asymptotic covariance matrix is not needed. Because of bias correction, the BCBEL ratio is asymptotically chi-squared, and hence it can be directly used to construct confidence regions of the parameters without any extra Monte Carlo approximation that is needed when bias correction is not applied. The proposed method can naturally be applied to deal with pure single-index models and partially linear models for longitudinal data. Some simulation studies are carried out and an example in epidemiology is given for illustration.     

Asymptotic aspects of the Gerber-Shiu function in the renewal risk model using Wiener-Hopf factorization and convolution equivalence

We study the asymptotic behavior of the Gerber-Shiu expected discounted penalty function in the renewal risk model. Under the assumption that the claim-size distribution has a convolution-equivalent density function, which allows both heavy-tailed and light-tailed cases, we establish some asymptotic formulas for the Gerber-Shiu function with a fairly general penalty function. These formulas become completely transparent in the compound Poisson risk model or for certain choices of the penalty function in the renewal risk model. A by-product of this work is an extension of the Wiener-Hopf factorization to include the times of ascending and descending ladders in the continuous-time renewal risk model.     

On the spectrum of resolvable orthogonal arrays invariant under the Klein group K4

It is shown that there exists a resolvablen ² by 4 orthogonal array which is invariant under the Klein 4-groupK ₄ for all positive integersn congruent to 0 modulo 4 except possibly forn {12, 24, 156, 348}.     

Locally stationary long memory estimation

There exists a wide literature on parametrically or semi-parametrically modelling strongly dependent time series using a long-memory parameter d, including more recent work on wavelet estimation. As a generalization of these latter approaches, in this work we allow the long-memory parameter d to be varying over time. We adopt a semi-parametric approach in order to avoid fitting a time-varying parametric model, such as tvARFIMA, to the observed data. We study the asymptotic behavior of a local log-regression wavelet estimator of the time-dependent d. Both simulations and a real data example complete our work on providing a fairly general approach.     

Universality in complex Wishart ensembles for general covariance matrices with 2 distinct eigenvalues

We considered N×N Wishart ensembles in the class W_C(Σ_N,M) (complex Wishart matrices with M degrees of freedom and covariance matrix Σ_N) such that N₀ eigenvalues of Σ_N are 1 and N₁=N−N₀ of them are a. We studied the limit as M, N, N₀ and N₁ all go to infinity such that , and 0<c,β<1. In this case, the limiting eigenvalue density can either be supported on 1 or 2 disjoint intervals in R₊, and a phase transition occurs when the support changes from 1 interval to 2 intervals. By using the Riemann-Hilbert analysis, we have shown that when the phase transition occurs, the eigenvalue distribution is described by the Pearcey kernel near the critical point where the support splits.     

The matrix-t distribution and its applications in predictive inference

The predictive distributions of the future responses and regression matrix under the multivariate elliptically contoured distributions are derived using structural approach. The predictive distributions are obtained as matrix-t which are identical to those obtained under matrix normal and matrix-t distributions. This gives inference robustness with respect to departures from the reference case of independent sampling from the matrix normal or dependent but uncorrelated sampling from matrix-t distributions. Some successful applications of matrix-t distribution in the field of spatial prediction have been addressed.