Population genetics is that branch of genetics, whose object is the study of the genetical make-up of natural populations. By investigating the laws which govern the genetic structure of natural populations, we intend to clarify the mechanism of evolution.

Moran (1958a) (1958b) introduced two population genetic models of a general kind to investigate the combined effects on evolution of four factors,

Our concern is with passage times and rate of approach to ergodicity for two types of temporally homogeneous processes, doubly bounded diffusion processes in one dimension, and birth-death processes on the finite lattice. The passage time problems associated with these processes are of considerable practical interest, but for many important cases, e.g., the Uhlenbeck-Ornstein process, only formal solutions such as Laplace transforms (cf. Darling and Siegert, 1953) have been given, with limited numerical potential.

The theory of multiplicative (or branching) population processes where the states of each individual in the population range over a fixed finite set has been studied by a number of authors: see for example, Everett and Ulam, Kolmogorov and Sevastyanov, Harris; the continuous parameter case is treated in Arley; further references will be found in the books by Bartlett and Bharucha-Reid. The purpose of the present paper is to study the theory of such processes in the case where the individual state space is arbitrary (i.e., an abstract space).

1. In 1923 Eggenberger and Pólya introduced the following ‘urn scheme’ as a model for the development of a contagious phenomenon. A box contains b black and r red balls, and a ball is drawn from it at random with ‘double replacement’ (i.e. whatever ball is drawn, it is returned to the box together with a fresh ball of the same colour); the procedure is then continued indefinitely. A slightly more complicated version with m-fold replacement is sometimes discussed, but it will be sufficient for our purposes to keep m = 2 and it will be convenient further to simplify the scheme by taking b = r = 1 as the initial condition. We shall however generalise the scheme in another direction by allowing an arbitrary number k(≧2) of colours. Thus initially the box will contain k differently coloured balls and successive random drawings will be followed by double replacement as before. We write sn (a k-vector with jth component ) for the numerical composition of the box immediately after the nth replacement, so that and we observe that is a Markov process for which the state-space consists of all ordered k-ads of positive integers, the (constant) transition-probability matrix having elements determined by where Sn is the sum of the components of sn and (e(i))j = δij. We shall calculate the Martin boundary for this Markov process, and point out some applications to stochastic models for population growth.

A model for road traffic delays at intersections is considered where vehicles arriving, possibly in bunches, in a Poisson process in a one way minor road yield right of way to traffic, which forms alternate bunches and gaps, in a major road. The gap acceptance times are random variables, and depend on whether or not a minor road vehicle is immediately following another minor road vehicle into the intersection or not.

The transforms of the stationary waiting time and queue size distributions, and the mean stationary delay, for minor road vehicles are obtained by substitution of determined service time distributions into results for a generalisation of the M/G/1 queueing system. Some numerical results are given to illustrate the increase in the mean delay for variable gap acceptance times for a Borel-Tanner distribution of major road traffic, and a partial solution is given for a two way major road.

In the present paper we deal with two models of the traffic on a divided highway. In both models traffic is flowing in one direction only, in two lanes, of which one (the left hand lane) is used only for overtaking. We suppose that vehicles enter the highway at the same entrance so that the instants at which a vehicle enters the highway form a homogeneous Poisson process, with density λ. Thus λ is the rate at which vehicles enter the highway per unit time. We suppose that there are no junctions, or exits (i.e. the highway extends in one direction to infinity).

The classical two-player gambler's ruin problem is well known and has attracted a great deal of attention in the literature in various forms. Extensions of these two-player problems to three or more players do not appear to have been discussed however, and this paper is concerned with one particular extension of the problem to the case of three players.

The problem of determining infinitely dilute resonance integrals is formulated in renewal theoretical terms. The mean value of the integral for a single resonance is determined in simple closed form. On the assumption that Wigner's hypothesis holds, the resonance density is determined, and a usable approximation to it is derived. An expression for the infinitely dilute resonance integral in the statistical region is then given and its value calculated in special cases and compared with the results of a previous computation.

In a previous paper a branching Poisson process model was derived to explain deviations from a Poisson process in computer failure patterns. Physically the deviations arise because an attempt to repair a computer is not always successful and the failure recurs a relatively short time later. In this paper we discuss the implications of this model for the use and maintenance of computers.

In this paper, a single-server queue with non-homogeneous Poisson input and general service time is considered. Particular attention is given to the case where the parameter of the Poisson input λ(t) is a periodic function of the time. The approach is an extension of the work of Takács and Reich . The main result of the investigation is that under certain conditions on the distribution of the service time, the form of the function λ(t) and the distribution of the waiting time at t = 0, the probability of a server being idle P0 and the Laplace transform Ω of the waiting time are both asymptotically periodic in t. Putting where b(t) is a periodic function of time, it is shown that both Po and Ω can be expanded in a power series in z, and a method for calculating explicitly the asymptotic values of the leading terms is obtained.

In many practical queueing problems, it is expected that the probability of arrivals will vary periodically. For example, in restaurants or at servicestations arrivals are more probable at rush hours than at slack periods, and rush hours are repeated day after day

In the .author and van Eeden considered, as prior distributions for the cumulative, F, of the bio-assay problem, processes whose sample functions are, with probability one, distribution functions. The example we considered there had the undesirable property that its mean, E(F), was singular with respect to Lebesgue measure. In fact, Dubins and Freedman have shown that a class of such processes, which includes the example we considered, has sample functions F which are, with probability one, singular.

The following generalization of the classical ballot theorem has many possible applications in order statistics.

Suppose that in a ballot candidate A scores a votes and candidate B scores b votes and that all the possible voting records are equally probable. Denote by α r and β r, the number of votes registered for A and B respectively among the first r votes recorded. Let µ, be a nonnegative integer. Denote by Pj(a, b) the probability that the inequality holds for exactly j subscripts r=1,2,..,a + b.