On square ordinal contingency tables: a comparison of social class and income mobility for the same individuals

Summary.  Square contingency tables with matching ordinal rows and columns arise in particular as empirical transition matrices and the paper considers these in the context of social class and income mobility tables. Such tables relate the socio-economic position of parents to the socio-economic position of their child in adulthood. The level of association between parental and child socio-economic position is taken as a measure of mobility. Several approaches to analysis are described and illustrated by UK data in which interest focuses on comparisons of social class and income mobility tables that are derived from the same individuals. Account is taken of the use of the same individuals in the two tables. Additionally comparisons over time are considered.     

A counterexample to Beder's conjectures about Hadamard matrices

In this note we provide a counterexample which resolves conjectures about Hadamard matrices made in this journal. Beder [1998. Conjectures about Hadamard matrices. Journal of Statistical Planning and Inference 72, 7–14] conjectured that if H$\mathit{H}$ is a maximal m×n$m\times n$ row-Hadamard matrix then m is a multiple of 4; and that if n   is a power of 2 then every row-Hadamard matrix can be extended to a Hadamard matrix. Using binary integer programming we obtain a maximal 13×32$13\times 32$ row-Hadamard matrix, which disproves both conjectures. Additionally for n being a multiple of 4 up to 64, we tabulate values of m   for which we have found a maximal row-Hadamard matrix. Based on the tabulated results we conjecture that a m×n$m\times n$ row-Hadamard matrix with m?n-7$m?n-7$ can be extended to a Hadamard matrix.     

Vector random fields with compactly supported covariance matrix functions

The objective of this paper is to construct covariance matrix functions whose entries are compactly supported, and to use them as building blocks to formulate other covariance matrix functions for second-order vector stochastic processes or random fields. In terms of the scale mixture of compactly supported covariance matrix functions, we derive a class of second-order vector stochastic processes on the real line whose direct and cross covariance functions are of Pólya type. Then some second-order vector random fields in R^d${\mathbb{R}}^d$ whose direct and cross covariance functions are compactly supported are constructed by using a convolution approach and a mixture approach.     

Two-level minimum aberration designs in N =2 (mod 4) runs

For two-level factorials, we consider designs in N=2 (mod 4) runs as obtained by adding two runs, with a certain coincidence pattern, to an orthogonal array of strength two. These designs are known to be optimal main effect plans in a very broad sense in the absence of interactions. Among them, we explore the ones having minimum aberration, with a view to ensuring maximum model robustness even when interactions are possibly present. This is done by sequentially minimizing a measure of the bias caused by interactions of successively higher orders.     

Central Limit Theorem approximations for the number of runs in Markov-dependent binary sequences

We consider Markov-dependent binary sequences and study various types of success runs (overlapping, non-overlapping, exact, etc.) by examining additive functionals based on state visits and transitions in an appropriate Markov chain. We establish a multivariate Central Limit Theorem for the number of these types of runs and obtain its covariance matrix by means of the recurrent potential matrix of the Markov chain. Explicit expressions for the covariance matrix are given in the Bernoulli and a simple Markov-dependent case by expressing the recurrent potential matrix in terms of the stationary distribution and the mean transition times in the chain. We also obtain a multivariate Central Limit Theorem for the joint number of non-overlapping runs of various sizes and give its covariance matrix in explicit form for Markov dependent trials.     

Variance bounds for estimators in autoregressive models with constraints

We consider nonlinear and heteroscedastic autoregressive models whose residuals are martingale increments with conditional distributions that fulfil certain constraints. We treat two classes of constraints: residuals depending on the past through some function of the past observations only, and residuals that are invariant under some finite group of transformations. We determine the efficient influence function for estimators of the autoregressive parameter in such models, calculate variance bounds, discuss information gains, and suggest how to construct efficient estimators. Without constraints, efficient estimators can be given by weighted least squares estimators. With the constraints considered here, efficient estimators are obtained differently, as one-step improvements of some initial estimator, similarly as in autoregressive models with independent increments.     

Analysis of hybrid censored competing risks data

In this paper, we consider the analysis of hybrid censored competing risks data, based on Cox's latent failure time model assumptions. It is assumed that lifetime distributions of latent causes of failure follow Weibull distribution with the same shape parameter, but different scale parameters. Maximum likelihood estimators (MLEs) of the unknown parameters can be obtained by solving a one-dimensional optimization problem, and we propose a fixed-point type algorithm to solve this optimization problem. Approximate MLEs have been proposed based on Taylor series expansion, and they have explicit expressions. Bayesian inference of the unknown parameters are obtained based on the assumption that the shape parameter has a log-concave prior density function, and for the given shape parameter, the scale parameters have Beta–Gamma priors. We propose to use Markov Chain Monte Carlo samples to compute Bayes estimates and also to construct highest posterior density credible intervals. Monte Carlo simulations are performed to investigate the performances of the different estimators, and two data sets have been analysed for illustrative purposes.     

Skew-normal alpha-power model

In this paper, authors study properties and inference for the newly introduced skew-normal alpha-power model, generalizing both, the power-normal and skew-normal models. Inference is approached via maximum likelihood. Fisher information matrix is derived and shown to be nonsingular at the whole parametric space. Special emphasis is placed on the special case of the power–skew-normal model. Studies with real data illustrate the fact that the model can be very useful in applications, being able to overfit less general models entertained in the literature.     

On the construction of optimal experimental designs: a penalty approach

Tn optimal experimental design theory there are well-known situations, in which additional constraints are implied to the design set. These constraints destroy in general the simplex structure of the set of feasible points of the design set. Thus the available iteration procedures for the unrestricted case are no longer applicable.

In this paper a penalty approach is suggested which transforms the restricted problem to the unrestricted case and allows the application of well-known algorithms such as the Fedorov-Wynn-type or the projected gradient procedure.     

Bayes designs for multiple linear regression on the unit sphere

We deal with experimental designs minimizing the mean square error of the linear BAYES estimator for the parameter vector of a multiple linear regression model where the experimental region is the k-dimensional unit sphere. After computing the uniquely determined optimum information matrix, we construct, separately for the homogeneous and the inhomogeneous model, both approximate and exact designs having such an information matrix.