Expressions are obtained for the determinant and inverse of the covariance matrix of a set of n consecutive observations on a mixed autoregressive moving average process. Explicit formulae for the inverse of this matrix are given for the general autoregressive process of order p (n ≧ p), and for the first order mixed autoregressive moving average process.

In this article, we consider maximum likelihood estimators of the initial probabilities and the mean of a supercritical Galton-Watson process; we find for these estimators, as well as for the Lotka-Nagaev estimator of the mean, the asymptotic distributions and deduce confidence intervals. As these results hold even if the independence between individuals of the same generation is not satisfied, application to living populations may be considered.

This paper discusses general bounds for coverage probabilities and moments of stopping rules for sequential coverage problems in geometrical probability. An approach to the study of the asymptotic behaviour of these moments is also presented.

We consider s ≦ n randomly chosen permutations of the numbers 1, 2, …, n, and write them under each other, thus forming an s × n matrix, called “random-batch”. A rule, prescribing how many elements of a column may occur exactly one time, how many may occur exactly two times, etc., is called a fixpoint-structure. Assuming each possible permutation to be chosen with equal probability, the number of columns having a certain fixpoint-structure F is a random variable X(F). The limiting distribution of X(F) for n→ ∞ is considered for different cases of s = s(n). The main result (Theorem 4) says, that the common distribution of a finite number t of given fixpoint-structures tends to the product of t Poisson-laws, n→ ∞.

It is shown that all stationary self-exciting point processes with finite intensity may be represented as Poisson cluster processes which are age-dependent immigration-birth processes, and their existence is established. This result is used to derive some counting and interval properties of these processes using the probability generating functional.

A branching process with immigration of the following type is considered. For every i, a random number Ni of particles join the system at time . These particles evolve according to a one-dimensional age-dependent branching process with offspring p.g.f. and life time distribution G(t). Assume . Then it is shown that Z(t) e–αt converges in distribution to an extended real-valued random variable Y where a is the Malthusian parameter. We do not require the sequences {τi} or {Ni} to be independent or identically distributed or even mutually independent.

Theorem: A necessary and sufficient condition for the superposition of two ordinary renewal processes to again be a renewal process is that they be Poisson processes.

A complete proof of this theorem is given; also it is shown how the theorem follows from the corresponding one for the superposition of two stationary renewal processes.

Independent exponential capture times are assumed for each of N prey. The payoff is the number of prey caught less a linear time cost. The optimal stopping time and value are obtained. When N is known an adaptive statistical procedure is proposed for which the expected payoff differs from the value by at most one-half plus a term which tends to zero (of order N–α, a < 1) as N → ∞.

By analogy with statistical mechanics we consider a random collision process with discrete time wand continuous states x ∈ [0, ∞). We assume three conditions (i), (ii) and (iii), which can be applied to Kac's model of a Maxwellian gas, and show that the sequence of probability distributions converges to a probability distribution using their moments.

The classical secretary problem is generalized to admit stochastically successful procurement of previous interviewees, but each has a certain probability of refusing the offer. A general formula for solving this problem is obtained. Two special cases: constant probability of refusing and geometric probability of refusing are discussed in detail. The optimal stopping rules in these two cases turn out to be simple.

In this paper, the optimal control problem of system described by stochastic McShane differential equations is considered. It is shown that this problem can be reduced to an equivalent optimal control problem of distributed parameter systems of parabolic type with controls appearing in the coefficients of the differential operator. Further, to this reduced problem, necessary conditions for optimality and an existence theorem for optimal controls are given.

Let {xk}k ≧ − r be a simple Bernoulli random walk with x–r = 0. An integer valued threshold ϕ = {ϕk}k≧1 is called a search plan if |ϕk+1−ϕk|≦1 for all k ≧ 1. If ϕ is a search plan let τϕ be the smallest integer k such that x and ϕ cross or touch at k. We show the existence of a search plan ϕ such that ϕ1 = 0, the definition of ϕ does not depend on r, and the first crossing time τϕ has finite mean (and in fact finite moments of all orders). The analogous problem for the Wiener process is also solved.

Controls of the perturbation type are evolved for the purpose of monitoring the random movement of a response curve using noise-corrupted observations of the response. Dynamic programming methods are used to obtain approximations to the optimum control system when the response is quadratic. Further results are briefly described.

The relation is investigated between the distributions of the total time until failure and the time of exposure to risk until failure, for individuals who are at risk only intermittently during their lifetimes. A specific example is considered in the case of computer failures.

The product moment equations previously derived are first discussed for the infinite one- and two-dimensional Ising (or autologistic) model in the case of non-zero mean, as a prelude to an examination of the probability structure in the higher-dimensional (and nominally zero mean) case below the ‘critical temperature’. Of two simple possible models, A and B, both consistent with the division of the product moment p into ergodic, and long-range non-ergodic, components, such that ρ = r (1 – m2) + m2, where r is the intrinsic correlation coefficient, it is shown that the second model B appears appropriate to the three-dimensional ‘spherical model’, but the first model A to the Ising model. Model A is defined by xi = yi + M, where M = +m or –m, and E{yi} = 0; and Model B by

This paper is concerned with a class of dynamic network flow problems in which the amount of flow leaving node i in one time period for node j is the fraction pij of the total amount of flow which arrived at node i during the previous time period. The fraction pij whose sum over j equals unity may be interpreted as the transition probability of a finite Markov chain in that the unit flow in state i will move to state j with probability pij during the next period of time. The conservation equations for this class of flows are derived, and the limiting behavior of the flows in the network as related to the properties of the fractions Pij are discussed.

The quasi-stationary behaviour of a Markov chain which is φ-irreducible when restricted to a subspace of a general state space is investigated. It is shown that previous work on the case where the subspace is finite or countably infinite can be extended to general chains, and the existence of certain quasi-stationary limits as honest distributions is equivalent to the restricted chain being R-positive with the unique R-invariant measure satisfying a certain finiteness condition.

Using Rényi's model of free Poisson traffic the distribution of the number of meetings of vehicles on a highway section during a given time interval is investigated. An integro-differential equation for the generating function of that variable is deduced and the first moments are calculated. The generating function is given explicitly in simple cases and approximately in cases of practical interest.

Replacement theory for equipment has been investigated by several authors. This paper introduces the ‘delay’ time preparing for replacement, derives the expected cost per unit time, and discusses the optimum replacement policies under several conditions. Three special cases are discussed and numerical examples are presented.

A limit theorem is proved for semi-Markov processes, which depend on a small parameter, tending to 0, in the case when the processes have an absorbing state and some asymptotically non-essential states and one asymptotically essential state. The application of the theorem is illustrated by an example from reliability theory.