It is known that the stable GI/PH/1 queue has an embedded Markov chain whose invariant probability vector is matrix-geometric with a rate matrix R. In terms of the matrix R, the stationary waiting-time distributions at arrivals, at an arbitrary time point and until the customer's departure may be evaluated by solving finite, highly structured systems of linear differential equations with constant coefficients. Asymptotic results, useful in truncating the computations, are also obtained. The queue discipline is first-come, first-served.

For regular Markov processes on a countable space, we provide criteria for the forms of ergodicity in the title in terms of the existence of solutions to inequalities involving the Q-matrix of the process. An application to birth-death processes is given.

Consider n cells into which balls are thrown at random until k cells contain at least l + 1 balls each. Let Yl, · ··, Yn be the number of balls in the cells when stopping. In this paper two representations are given for the characteristic functions of random variables of the form The usefulness of these representations are illustrated by two examples. In the first the number of cells with exactly one ball when each cell contains at least one ball is considered. In the second the waiting time until the ball-throwing process stops is discussed.

Queueing systems with a special service mechanism are considered. Arrivals consist of two types of customers, and services are performed for pairs of one customer from each type. The state of the queue is described by the number of pairs and the difference, called the excess, between the number of customers of each class. Under different assumptions for the arrival process, it is shown that the excess, considered at suitably defined epochs, forms a Markov chain which is either transient or null recurrent. A system with Poisson arrivals and exponential services is then considered, for which the arrival rates depend on the excess, in such a way that the excess is bounded. It is shown that the queue is stable whenever the service rate exceeds a critical value, which depends in a simple manner on the arrival rates. For stable queues, the stationary probability vector is of matrix-geometric form and is easily computable.

A formula is derived for the supremum of a stationary Gaussian process which has a correlation function that is tent-like in shape, until it flattens out at a constant negative value. Examples and graphs are presented in the last section.

Time series models for non-linear random vibrations are discussed from the viewpoint of the specification of the dynamics of the damping and restoring force of vibrations, and a non-linear threshold autoregressive model is introduced. Typical non-linear phenomena of vibrations are demonstrated using the models. Stationarity conditions and some structural aspects of the model are briefly discussed. Applications of the model in the statistical analysis of real data are also shown with numerical results.

In this paper we characterize the optimal class of output policies in a control model of a dam having a finite capacity. The input of water into the dam is determined by 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 a cost of K, (K ≧ 0) or decreased from M to 0 with zero cost, any such changes taking effect instantaneously. There is a reward of A monetary units for each unit of output, (A ≧ 0). The problem is to formulate an optimal output policy which maximizes the long-run average net reward per unit time.

How often will a store with two elevators be without service assuming that repairs are quick? In this note it is shown that, under very mild assumptions on the operating- and repair-time distributions, the times when the building is without service are asymptotically Poisson.

Using a definition of partial ordering of distribution functions, it is proven that for a tandem queueing system with many stations in series, where each station can have either one server with an arbitrary service distribution or a number of constant servers in parallel, the expected total waiting time in system of every customer decreases as the interarrival and service distributions becomes smaller with respect to that ordering. Some stronger conclusions are also given under stronger order relations. Using these results, bounds for the expected total waiting time in system are then readily obtained for wide classes of tandem queues.

Necessary and sufficient conditions for stability, imposed firstly on the initial structure and the sequence of recruitment, and secondly on the initial structure and the sequence of expansion are provided in forms of two theorems. Also the limiting behaviour of the expected relative grade sizes is studied if we drop the conditions for stability imposed on the initial structure and keep the same sequence of expansion. Finally we examine the limiting behaviour of the expected grade sizes if we drop the assumption of a continuously expanding system.

Let X1, X2, · ··, Xn, · ·· be independent and identically distributed non-negative integer-valued random variables with finite mean and variance. For any positive integer n and m we consider the random vector i.e., L has the same distribution as the conditional distribution of (X1, · ··, Xm) given the condition It is easy to see that our model includes the classical urn model, the Bose–Einstein urn model and the Pólya urn model as special cases. For any non-negative integer s define G(s) = the number of Li′s such that Li = s, and U = the number of Li′s such that Li is an even number; in this paper we study the asymptotic behaviour of the random variables considered above. Some central limit theorems and a multinormal local limit theorem are proved.

This paper considers certain stochastic models for token and type counts in literary texts. Elaborating on some models of Gani, it is shown that reasonable fits can be obtained to some data of Yule on Macaulay's Essays.

The steady-state distribution of the inventory position for a continuous-review (s, S) inventory system is derived in a computationally tractable form. Demands for items in inventory are assumed to form an N-process which is the ‘versatile Markovian point process' introduced by Neuts (1979). The N-process includes the phase-type renewal process, Markov-modulated Poisson process etc., as special cases and is especially useful in modelling a wide variety of qualitative phenomena such as peaked arrivals, interruptions, inhibition or stimulation of arrivals by certain events etc.

A new technique is developed for deriving velocities of propagation and shapes of travelling wave profiles in non-linear situations. Two models are considered for the spread of infection through a linear community. In one the infected individuals move, in the other the phenomenon of infection.

The random walk arising in the game of roulette involves an absorbing barrier at the origin; at each step either a unit displacement to the left or a fixed multiple displacement to the right can occur with probabilities q and p respectively. Using generating functions and Lagrange's theorem for the expansion of a function as a power series explicit expressions are deduced for the probabilities of the player's capital at the nth step.

Let n sets with volume ~ n-–1 be placed in Rm, independently and with the same distribution. As n →∞, the volume in V CRm, covered by exactly k of these sets under certain conditions converges to a non-random limit, which is the integral over V of a density that is of the type of a Poisson probability.

We give here fairly elementary proofs for the threshold theorems due to Williams (1971) and Whittle (1955). Our proofs are based on an application of the reflection principle through the ballot problem and the exact distribution of the size of the epidemic as derived by Foster (1955). Williams's threshold theorem is extended to an epidemic with multiple introduction of cases.

This paper considers a semi-infinite storage model, of the type studied by Senturia and Puri [13] and Balagopal [2], defined on a Markov renewal process, {(Xn, Tn), n = 0, 1, ·· ·}, with 0 = T0 < T1 < · ··, almost surely, where Xn takes values in the set {1, 2, ·· ·}. If at Tn, Xn = j, then there is a random ‘input' Vn (j) (a negative input implying a demand) of ‘type' j, having distribution function Fj(·). We assume that {Vn (j)} is an i.i.d. sequence of random variables, taken to be independent of {(Xn, Tn)} and of {Vn (k)}, for k ≠ j, and that Vn (j) has first and second moments. Here the random variables Vn (j) represent instantaneous ‘inputs' (a negative value implying a demand) of type j for our storage model. Under these assumptions, we establish certain limit distributions for the joint process (Z(t), L(t)), where Z(t) (defined in (2)) is the level of storage at time t and L(t) (defined in (3)) is the demand lost due to shortage of supply during [0, t]. Different limit distributions are obtained for the cases when the ‘average stationary input' ρ, as defined in (5), is positive, zero or negative.

Length distributions for random secants through a convex region K are derived for three types of randomness. The results are formulated in terms of geometric properties of K, e.g. the overlap surface content of K with its translated self. The distribution of distance between two random points in K, expressed in terms of the overlap volume, is shown to extend to non-convex (including disjoint) regions.

Let X1X2, · ·· be a Markov Bernoulli sequence with initial probabilities p of success and q = 1 – p of failure, and probabilities 1 – (1 – π) p, (1 – π) p in the first row and (1 – π) (1 – p), (1 – π) p + πin the second row of the transition matrix. If we define Sn = Σi=1nXi, then the limit distribution P{Sn = k} is obtained when n →∞, np →λ.