THE LIMITING FORM OF THE NON-CENTRAL WISHART DISTRIBUTION1,2

Let S (p×p) have a Wishart distribution -with v degrees of freedom and non-centrality matrix θ= [θ_jK] (p×p). Define θ₀= min {| θ_jk |}, let θ₀→∞, and suppose that | θ_jK | = 0(θ_o). Then the limiting form of the standardized non-central distribution, as θ while n? remains fixed, is a multivariate Gaussian distribution. This result in turn is used to obtain known asymptotic properties of multivariate chi-square and Rayleigh distributions under somewhat weaker conditions.     

A NOTE ON THE DISTRIBUTION OF THE DOUBLY NON-CENTRAL F DISTRIBUTION1

A three-moment central-F approximation is examined for its usefulness in giving accurate values of the probability integral of the doubly non-central F distribution.     

THE THEORY OF COMPETING RISKS1

The theory of competing risks is motivated, certain aspects are reviewed critically, and some extensions are indicated. A unified formulation of the theory is given covering dependent as well as independent risks. The relations between various functions useful in the theory are made explicit. In a historical note a valuable early result is put into modern notation. The currently controversial subject of identifiability when risks are dependent is discussed and it is indicated under what conditions some of the difficulties raised can be overcome. Consequences of assuming proportional hazard rates are set out. New conditions are provided under which this assumption holds and it is shown how the assumption may be tested. Some concluding remarks deal with limitations of the theory and point out areas needing further work.     

SOME EXPECTED VALUES FOR THE ERROR RATES OF THE SAMPLE QUADRATIC DISCRIMINANT FUNCTION1

The expected error rates of the sample quadratic discriminant function are studied in the context of two populations with different means and proportional covariance matrices. For the general case of all population parameters unknown the expected error rates are expressed in the form of asymptotic expansions which are evaluated numerically and tabulated for several combinations of the population parameters.     

ON THE DISTRIBUTIONS OF ORDER STATISTICS1

Approximations to the distributions of order statistics based on x²t are obtained. These are easy to compute and provide reasonably accurate values for the percentage points and probability integrals of the distributions.     

INTERACTION MODELS FOR THE LATIN SQUARE1

This paper presents a general method for testing if a particular type of interaction is present in latin square models with one observation per cell. Computing instructions are given along with a detailed numerical example. A data analysis approach is explained where an experimenter can use various models to determine whether interaction is present. If there is interaction, then a procedure is given for examining a number of models to decide what factors (row, column, treatment) are interacting. In addition, a number of sets of latin square data from the literature are reanalysed to determine if they contain interaction.     

ON THE BEHRENS–FISHER PROBLEM1

In this article the Behrens-Fisher problem is reformulated in terms of a structural model of inference. For this version of the problem a solution is obtained which is valid for arbitrary absolutely continuous error distributions. These results are further discussed for the standard normal distribution and for some other special cases with not normally distributed populations.     

DECOMPOSITIONS OF THE QUEUE LENGTH DISTRIBUTIONS IN THE MAP/G/1 QUEUE UNDER MULTIPLE AND SINGLE VACATIONS WITH N-POLICY

In this paper, we establish an explicit form of matrix decompositions for the queue length distributions of the MAP/G/1 queues under multiple and single vacations with N-policy. We show that the vector generating function Y (z) of the queue length at an arbitrary time and X (z) at departures are decomposed into Y (z) = p _idle (z)ζ _Y (z) and X (z) = p _idle (z)ζ _X (z) where p _idle (z) is the vector generating function of the queue length at an arbitrary epoch at which the server is not in service, and ζ _Y (z) and ζ _X (z) are unidentified matrix generating functions.     

ESTIMATION OF THE CONCENTRATION PARAMETERS OF THE FISHER MATRIX DISTRIBUTION ON 50(3) AND THE BINGHAM DISTRIBUTION ON Sq, q≥ 2

Two procedures are considered for estimating the concentration parameters of the Fisher matrix distribution for rotations or orientations in three dimensions. The first is maximum likelihood. The use of a convenient 1-dimensional integral representation of the normalising constant, which greatly simplifies the computation, is suggested. The second approach exploits the equivalence of the Fisher distribution for rotations in three dimensions, and the Bingham distribution for axes in four dimensions. We describe a pseudo likelihood procedure which works for the Bingham distribution in any dimension. This alternative approach does not require numerical integration. Results on the asymptotic efficiency of the pseudo likelihood estimator relative to the maximum likelihood estimator are given, and the two estimators are compared in the analysis of a well-known vectorcardiography dataset.     

AN INFINITE-PHASE QUASI-BIRTH-AND-DEATH MODEL FOR THE NON-PREEMPTIVE PRIORITY M/PH/1 QUEUE

This paper considers a single server queue that handles arrivals from N classes of customers on a non-preemptive priority basis. Each of the N classes of customers features arrivals from a Poisson process at rate λ _i and class-dependent phase type service. To analyze the queue length and waiting time processes of this queue, we derive a matrix geometric solution for the stationary distribution of the underlying Markov chain. A defining characteristic of the paper is the fact that the number of distinct states represented within the sub-level is countably infinite, rather than finite as is usually assumed. Among the results we obtain in the two-priority case are tractable algorithms for the computation of both the joint distribution for the number of customers present and the marginal distribution of low-priority customers, and an explicit solution for the marginal distribution of the number of high-priority customers. This explicit solution can be expressed completely in terms of the arrival rates and parameters of the two service time distributions. These results are followed by algorithms for the stationary waiting time distributions for high- and low-priority customers. We then address the case of an arbitrary number of priority classes, which we solve by relating it to an equivalent three-priority queue. Numerical examples are also presented.