Let U denote the set of all integers, and suppose that Y = {Yu; u ∈ U} is a process of standardized, independent and identically distributed random variables with finite third moment and with a common absolutely continuous distribution function (d.f.) G (·). Let a = {au; u ∈ U} be a sequence of real numbers with Σuau2 = 1. Then Xu = ΣwawYu–w defines a stationary linear process X = {Xu; u ɛ U} with E(Xu) = 0, E(Xu2) = 1 for u ∊ U. Let F(·) be the d.f. of X0. We prove that if maxu |au| is small, then (i) for each w, Xw is close to Gaussian in the sense that ∫∞−∞(F(y) − Φ(y))2dy ≦ g maxu |au | where Φ(·) is the standard Gaussian d.f., and g depends only on G(·); (ii) for each finite set (w1, … wn), (Xw1, … Xwn) is close to Gaussian in a similar sense; (iii) the process X is close to Gaussian in a somewhat restricted sense. Several properties of the measures of distance from Gaussianity employed are investigated, and the relation of maxu|au| to the bandwidth of the filter a is studied.

Consider the following service system.

In a previous paper (Moran (1956)) the theory of a dam with a continuous release was developed for a situation in which the input was defined by an additive homogeneous random process of gamma distribution type, and the release was defined to occur continuously at a fixed rate when the content of the dam was non-zero. In the present paper we modify these conditions by assuming first that the input is defined by a general additive homogeneous process with non-negative increments with finite second moment, and secondly that the rate of release is proportional to the content of the dam. This modification to the release rule ensures that the content of the dam is never zero and the theory is then so simplified that the distributional properties of the contents of a sequence of dams in series can be easily found.

The deleting or delay effect which a recurrent point process exerts upon another recurrent point process (or process with stationary independent increments) is treated. The concept arises in the statistical analysis of neuronal firing patterns, but may also be useful in applications to storage systems in operations research.

We present two theorems that provide simple iterative solutions of special systems of differential-difference equations. We show as examples of the theorems the simple stochastic epidemic (cf. Bailey, 1957, p. 39, and Bailey, 1963) and the general stochastic epidemic (cf. Bailey, 1957; Gani, 1965; and Siskind, 1965), in each of which we let the initial distribution of the number of uninfected susceptibles and the number of infectives be arbitrary but assume the total population size bounded. In all of the references cited above the methods of solution involve solving a corresponding partial differential equation, whereas we deal directly with the original system of ordinary differential-difference equations. Furthermore in the cited references the authors begin at time t = 0 with a population having a fixed number of uninfected susceptibles and a fixed number of infectives. For the simple stochastic epidemic with arbitrary initial distribution we provide solutions not obtainable by the results given by Bailey (1957 or 1963). For the general stochastic epidemic, if we use the results of Gani or Siskind, then the solution of the problem having an arbitrary initial distribution would involve additional steps that would sum proportionally-weighted conditional results.

In the present paper the solutions of two integral equations are derived. One of the integral equations dominates the mathematical description of the stochastic process {vn, n = 1,2, …}, recursively defined by K is a positive constant, τ1, τ2, …; Σ1, Σ2, …; are independent, non-negative variables, with τ1, τ2,…, identically distributed, similarly, the variables Σ1, Σ2, …, are identically distributed.

In a recent paper Weiss (1965) has suggested a simple model for a carrier-borne epidemic such as typhoid. He considers a population (of size m) of susceptibles into which a number (k) of carriers is introduced. These carriers exhibit no overt symptoms and are only detectable by the discovery of infected persons. He supposed that after the initial introduction of the carriers, the population remains entirely closed and no new carriers arise. The epidemic then progresses until either all the carriers have been traced and isolated or until the entire population has succumbed to the disease.

This paper applies the constant population approximation to the study of epidemics which involve more than a single type of infective. An example of this would be a situation in which both clinically infected individuals and subclinically infected individuals or carriers are present.

We derive equations for the expected numbers of clinically infected individuals and carriers at any time t for the model with zero latent period and infectious periods having negative exponential distributions. From these equations we derive conditions under which a unimodal incidence curve can result, and expressions for the expected total epidemic size.

A queueing system with a single server is considered. There are a finite number of types of customers, and the types of successive arrivals form a Markov chain. Further, the nth interarrival time has a distribution function which may depend on the types of the nth and the n–1th arrivals. The queue size, waiting time, and busy period processes are investigated. Both transient and limiting results are given.

Let x be a non-negative, non-decreasing, right-continuous function of t defined on the interval [O, T) and let A = x(T–). Define the function y on [O, A] by Then y is non-decreasing and left-continuous and If t is a time variable it is natural to call y the passage time function.

The optimal strategies of any finite matrix game can be characterized by means of the Snow-Shapley Theorem [1]. However, in order to use this theorem to compute the optimal strategies, it may be necessary to invert a large number of matrices, most of which are not related to the solutions of the game. The present paper will show that when the columns of the pay-off matrix satisfy some special relations, it is possible to enumerate a much smaller class of matrices from which the optimal strategies may be obtained. Furthermore, the maximizing strategies that are determined by these matrices can be written down by inspection as soon as the matrices are specified.

In this paper a stochastic calculus, based on limits in quadratic mean and in probability, is introduced and applied to some fundamental theorems of natural selection. The paper is divided into five principal sections. In Section 2 some elements of stochastic calculus are given, and in Section 3 the stochastic calculus is applied to the haploid case. Section 4 is devoted to the development of an analysis of variance structure applicable to a haploid population, and in Section 5 the results of Sections 3 and 4 are generalized to cover the diploid case. Finally, Section 6 is devoted to two specific examples in which the results of previous sections apply.

When a complex system such as the Apollo vehicle arrives on the Moon, certain parts may no longer function. To restore the system to a working state, these parts must be replaced by new ones; but the vehicle can carry only a limited number of spare parts and must also be able to leave at a specified time after arrival. This paper investigates an abstract (and simplified) version of the problem of the optimal maintenance procedure for such a system. As a bonus of the abstract formulation, the results obtained are applicable to a variety of specific systems.

The random walk between an absorbing and a reflecting or semi-reflecting barrier has been discussed in the literature. Indeed, a biological example of such a random walk, arising from a system of countercurrent dialysis, was described by this author. In this earlier paper a technique was suggested for obtaining the probability of being in a specific state after a given number of transitions, if the probability is unity of being in the reflecting state at time zero. The present paper extends this technique to yield the full matrix of higher transition probabilities.

An expression is found (Theorem 1) for the probability that a sample function of a Poisson process never exceeds some given function and some examples are given.

Distributions appropriate to the description of long-term behaviour within an irreducible class of discrete-time denumerably infinite Markov chains are considered. The first four sections are concerned with general reslts, extending recent work on this subject. In Section 5 these are applied to the branching process, and give refinements of several well-known results. The last section deals with the semi-infinite random walk with an absorbing barrier at the origin.