Assuming a nonparametric family of item response theory models, a theory-based procedure for testing the hypothesis of unidimensionality of the latent space is proposed. The asymptotic distribution of the test statistic is derived assuming unidimensionality, thereby establishing an asymptotically valid statistical test of the unidimensionality of the latent trait. Based upon a new notion of dimensionality, the test is shown to have asymptotic power 1. A 6300 trial Monte Carlo study using published item parameter estimates of widely used standardized tests indicates conservative adherence to the nominal level of significance and statistical power averaging 81 out of 100 rejections for examinee sample sizes and psychological test lengths often incurred in practice.

A general procedure is provided for comparing correlation coefficients between optimal linear composites. The procedure allows computationally efficient significance tests on independent or dependent multiple correlations, partial correlations, and canonical correlations, with or without the assumption of multivariate normality. Evidence from some Monte Carlo studies on the effectiveness of the methods is also provided.

The multivariate asymptotic distribution of sequential Chi-square test statistics is investigated. It is shown that: (a) when sequential Chi-square statistics are calculated for nested models on the same data, the statistics have an asymptotic intercorrelation which may be expressed in closed form, and which is, in many cases, quite high; and (b) sequential Chi-square difference tests are asymptotically independent. Some Monte Carlo evidence on the applicability of the theory is provided.

An urn contains balls of different colours, which are randomly drawn one at a time. After each draw the number of balls in the urn with the same colour as the ball last drawn is changed. Special cases are sampling with and without replacement, and Pólya sampling. The drawing stops when a given number of colours has been drawn a given number of times. The number of times the different colours have been drawn is studied in this paper by imbedding the urn scheme in birth processes. Both exact and asymptotic results are obtained. In particular, waiting times for sampling with and without replacement and for Pólya sampling are considered.

Strong mixing is a condition which is often assumed to prove limit theorems for strictly stationary processes. Leadbetter's condition D(un) is used to prove limit theorems for maxima of stationary processes.

A sufficient condition for strong mixing to hold is given for the case where the process satisfies a pth-order Markov property. This condition can be easy to check for when p is small. This point is illustrated by two examples of first-order autoregressive processes.

The condition D(un) is shown to hold for any stationary Markov process.