Let {(Jn, Xn), n ≧ 0} be the standard J–X process of Markov renewal theory. Suppose {Jn, n ≧ 0} is irreducible, aperiodic and positive recurrent. It is shown using the strong mixing condition, that if converges in distribution, where an, bn > 0 (bn → ∞) are real constants, then the limit law F must be stable. Suppose Q(x) = {PijHi(x)} is the semi-Markov matrix of {(JnXn), n ≧ 0}. Then the n-fold convolution, Q∗n(bnx + anbn), converges in distribution to F(x)Π if and only if converges in distribution to F. Π is the matrix of stationary transition probabilities of {Jn, n ≧ 0}. Sufficient conditions on the Hi's are given for the convergence of the sequence of semi-Markov matrices to F(x)Π, where F is stable.

This paper deals with optimal stopping rules for a sampling process with uncertain recall, i.e. the probability that a past observation is currently available declines exponentially with the time elapsed since it was last observed. The main result of this paper is that for such sampling processes, and for any utility function, if a solicitation of a past observation incurs the same cost as a new draw, then it is never optimal to continue the sampling when the observation solicited is found to be available. This result applies to both bounded and unbounded sequential decision procedures.

Consider a finite urn scheme with balls uniformly distributed amongst the urns. Using a technique of Karlin, the asymptotic behavior of the number of throws necessary to obtain at least m (m ≧ 1) balls in a given fraction of the urns is studied.

Let {XN(t), t ≧ 0}, N = 1, 2, … be a sequence of continuous-parameter Markov processes, and let TN(t)f(x) = Ex[f(XN(t))]. Suppose that limN→∞TN(t)f(x)= T(t)f(x), and that convergence is uniform over x and over t ∈ [0, K] for all K < ∞. When is convergence uniform over t ∈ [0, ∞)? Questions of this type are considered under the auxiliary condition that T(t)f(x) converges uniformly over x as t → ∞. A criterion for such ergodicity is given for semigroups T(t) associated with one-dimensional diffusions. The theory is illustrated by applications to genetic models.

In this paper we consider the general birth-and-death queueing model of Natvig (1975). Define the input and output processes by the steady-state behaviour of respectively successive input and output intervals. Ignoring balking customers, two cases are considered. In the first case we treat a lost customer neither as an input nor as an output, then secondly as both. For both cases we show the input and output processes to be reverse processes. One mistake and two erroneous comments in Natvig (1975) are also corrected.

For the sample functions of the stationary virtual waiting-time process vt of the GI/G/1 queueing system some properties of the number of up- and downcrossings of level v by the vt-process during a busy cycle are investigated. It turns out that the simple fact that this number of upcrossings is equal to that of downcrossings leads in a rather easy way to basic relations for the waiting-time distributions. This approach to the study of the vt-process of the GI/G/1 system seems to be applicable to many other types of stochastic processes. As another example of this approach the infinite dam with non-constant release rate is briefly discussed.

It has been shown that the probabilistic structure of a regular regenerative set can be described in terms of the exponent of an appropriate subordinator. We give a relation which expresses the distribution of two Markov processes associated with a regenerative set in terms of this exponent.

Suppose a physical process is modelled by a Markov chain with transition probability on S1 ∪ S2, S1 denoting the transient states and S2 a set of absorbing states.

If v denotes the output distribution on S2, the question arises as to what input distributions (of raw materials) on S1 produce v. In this note we give an alternative to the formulation of Ray and Margo [2] and reduce the problem to one system of linear inequalities. An application to random walk is given and the equiprobability case examined in detail.

Moments of the delay distribution and other measures of performance for a multi-channel queue are shown to be bounded above by corresponding quantities for one or a collection of single-channel queues.

The least squares estimators βi(N), j = 1, …, p, from N data points, of the autoregressive constants for a stationary autoregressive model are considered when the disturbances have a distribution attracted to a stable law of index α < 2. It is shown that N1/δ(βi(N) – β) converges almost surely to zero for any δ > α. Some comments are made on alternative definitions of the βi(N).

In some applications of diffusion theory it is of interest to study the expected time of the first exit from an interval given that a specified boundary will be the first exitpoint. This problem is considered here for a regular Feller process, and applications are given.

If Fn∗ is the n-fold Stieltjes convolution of the increasing function F, then a version of Chernoff's theorem, on the limiting behaviour of (Fn∗(na))1/n, is established for Fn∗. If Z(n)(t) is the number of the nth-generation people to the left of t in a supercritical branching random walk then an analogous result is proved for Z(n).

This paper develops simple expressions for the exact probability distribution of the duration of the game, and the probability distribution of the duration of the game conditional upon its termination with the gambler's ruin, in the classical ruin problem.

This note indicates two alternative proofs for a result of Galambos and Seneta [1] on the distribution of ratios of successive record times in a sequence of independent and identically distributed random variables. Some consequences of one method of proof are discussed, and its analogues in a continuous time setting are described.

The input of water into a finite dam is a Wiener process with positive drift. Water may be released at either of two possible rates 0 or M. At any time the output rate can be increased from 0 to M with cost KM, (K ≧ 0), or decreased from M to 0 with zero cost. There is a reward of A monetary units for each unit of output, (A > 0). We will consider the problem of specifying an optimal control output policy under the following optimal criteria:

1. (a) Minimum total long-run average cost per unit time.

2. (b) Minimum expected total discounted cost.

Using Bernstein's theorem concerning absolutely monotonic functions, Rao and Rubin (1964) have established a characterization of the Poisson distribution. The present note arrives at an extended version of this result using a technique existing in the renewal theory. A variant of a related result due to Srivastava and Srivastava (1970) and an extension of the result of Talwalker (1970) are also presented.