Most epidemic models previously studied have assumed a homogeneously mixing population. Instead of making this assumption, a population divided into classes is considered; and it is assumed that the degree of mixing between classes is less than that within classes. The stochastic model in this form is intractable and approximations are made, yielding results in reasonable agreement with simulation trials.

A sufficient condition is derived for the existence of a strictly stationary solution of the general bilinear time series equations. The condition is shown to reduce to the conditions of Pham and Tran (1981) and Bhaskara Rao et al. (1983) in the special cases which they consider. Under the condition specified, a solution is constructed which is shown to be causal, stationary and ergodic. It is moreover the unique causal solution and the unique stationary solution of the defining equations. In the special case when the defining equations contain no non-linear terms, our condition reduces to the well-known necessary and sufficient condition for existence of a causal stationary solution.

In this note we deal with the allocation of independent and identical active redundancies to a k-out-of-n system with the usual stochastic order among its independent components. The optimal policy is proved both to assign more redundancies to the weaker component and to majorize all other policies. This improves the corresponding one in Hu and Wang (2009) and serves as a nice supplement to that in Misra, Dhariyal and Gupta (2009) as well.

This account is meant to serve as an introduction to certain mathematical ideas which can be of considerable importance in applied probability and in statistical theory. Since a wide field is to be covered in a short space, the account has to depend on heuristic arguments and a sympathetic understanding from those familiar with the technical details of the subject is called for. Constant reference to the sources of the underlying mathematics is not called for, as it will be clear that the author is not claiming these results as his own. The references at the end of the paper, which are arranged so as to aid those readers who wish to proceed further, will also indicate the sources of the mathematical and statistical ideas used. We assume some knowledge of the groups, though most concepts are defined below. By beginning from the finite dimensional case and motivating later concepts in terms of this we hope to make the later, rather technical sections, more accessible.

It is common to represent taxonomic hierarchies of related objects (such as similar plant or animal species or languages of the same family) by rooted trees with labelled terminal vertices which represent the objects. The multivariate data comparing numerous characteristics of the objects is first reduced to indices of similarity (or more often of dissimilarity) between each pair of objects. These are used to classify the objects into groups which are then depicted on a tree.

This paper shows that an unrooted tree with labelled terminal vertices may provide a better representation of the relationships between the objects because the similarity indices are required to conform to fewer restrictions. Also for a given number of terminal vertices, there are fewer unrooted than rooted trees so that studies using probability distributions of trees or seeking the most suitable tree to represent the data are more practicable.

In many situations, it is reasonable to assume that a priority rule does not affect the total time spent in service of any job. Rules with this property are said to be work-conserving. This concept unifies and simplifies the analysis of a variety of priority queues. Some results are obtained for rules applied to the GI/G/1 queue. Some special properties of Poisson arrivals are discussed, and a new proof of the equivalence of averaging over all time with averaging over arrival epochs is presented. In this case, explicit results for particular rules are obtained in examples. In another example, the optimal rule (from a very restrictive class) is determined without specializing the arrival stream.

In this paper, a strong asymptotic estimate for the queue content distribution of a fluid queue fed by a fractional Brownian input with Hurst parameter H ∊ [1/2,1[is studied. By applying general results on suprema of centred Gaussian processes, in particular, we show that for large x. Explicit formulae for constants κ, γ and L are given in terms of H and system parameters.

Variability orderings indicate that one probability distribution is more spread out or dispersed than another. Here variability orderings are considered that are preserved under conditioning on a common subset. One density f on the real line is said to be less than or equal to another, g, in uniform conditional variability order (UCVO) if the ratio f(x)/g(x) is unimodal with the model yielding a supremum, but f and g are not stochastically ordered. Since the unimodality is preserved under scalar multiplication, the associated conditional densities are ordered either by UCVO or by ordinary stochastic order. If f and g have equal means, then UCVO implies the standard variability ordering determined by the expectation of all convex functions. The UCVO property often can be easily checked by seeing if f(x)/g(x) is log-concave. This is illustrated in a comparison of open and closed queueing network models.

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.

This paper is concerned with the cost Cis = aWis + bTis (a, b > 0) of a general stochastic epidemic starting with i infectives and s susceptibles; Tis denotes the duration of the epidemic, and Wis the area under the infective curve. The joint Laplace-Stieltjes transform of (Wis, Tis) is studied, and a recursive equation derived for it. The duration Tis and its mean Nis are considered in some detail, as are also Wis and its mean Mis. Using the results obtained, bounds are found for the mean cost of the epidemic.

The first-passage time of a Markov process to a moving barrier is considered as a first-exit time for a vector whose components include the process and the barrier. Thus when the barrier is itself a solution of a differential equation, the theory of first-exit times for multidimensional processes may be used to obtain differential equations for the moments and density of the first-passage time of the process to the barrier. The procedure is first illustrated for first-passage-time problems where the solutions are known. The mean first-passage time of an Ornstein–Uhlenbeck process to an exponentially decaying barrier is then found by numerical solution of a partial differential equation. Extensions of the method to problems involving Markov processes with discontinuous sample paths and to cases where the process is confined between two moving barriers are also discussed.

Let {(Xn,Jn)} be a stationary Markov-modulated random walk on ℝ x E (E is finite), defined by its probability transition matrix measure F = {Fij}, Fij(B) = ℙ[X1 ∈ B, J1 = j | J0 = i], B ∈ B(ℝ), i, j ∈ E. If Fij([x,∞))/(1-H(x)) → Wij ∈ [0,∞), as x → ∞, for some long-tailed distribution function H, then the ascending ladder heights matrix distribution G+(x) (right Wiener-Hopf factor) has long-tailed asymptotics. If 𝔼Xn < 0, at least one Wij > 0, and H(x) is a subexponential distribution function, then the asymptotic behavior of the supremum of this random walk is the same as in the i.i.d. case, and it is given by ℙ[supn≥0Sn > x] → (−𝔼Xn)−1 ∫x∞ ℙ[Xn > u]du as x → ∞, where Sn = ∑1nXk, S0 = 0. Two general queueing applications of this result are given.

First, if the same asymptotic conditions are imposed on a Markov-modulated G/G/1 queue, then the waiting time distribution has the same asymptotics as the waiting time distribution of a GI/GI/1 queue, i.e., it is given by the integrated tail of the service time distribution function divided by the negative drift of the queue increment process. Second, the autocorrelation function of a class of processes constructed by embedding a Markov chain into a subexponential renewal process, has a subexponential tail. When a fluid flow queue is fed by these processes, the queue-length distribution is asymptotically proportional to its autocorrelation function.

The limiting distributions of the actual waiting time and the virtual waiting time are determined for a single-server queue with Poisson input and general service times in the case where there are two types of services and no customer can stay in the system longer than an interval of length m.

If for two c.d.f.'s F(·) and G(·), 1 – F(x)/1 – G(x) → A, 0 <A <∞, as x → ∞, then for normalizing constants an > 0, bn, n > 1, Fn(anx + bn) → φ(x), φ(x) non-degenerate, iff Gn(anx + bn)→ φ A−1(x). Conversely, if Fn(anx+bn)→ φ(x), Gn(anx + bn) → φ'(x), φ(x) and φ'(x) non-degenerate, then there exist constants C >0 and D such that φ'(x) =φ(Cx + D) and limx→∞ 1 — F(x)/1 — G(x) exists and is expressed in terms of C and D, depending on which type of extreme value distribution φ(x) is. These results are used to study domain of attraction questions for products of distribution functions and to reduce the limit law problem for maxima of a sequence of random variables defined on a Markov chain (M.C.) to the independent, identically distributed (i.i.d.) case.

The continuous-time Markov model of a multigrade organization is extended in several ways. Firstly the internal transitions and the leaving process are generalized to a semi-Markov formulation which allows for the inclusion of well-authenticated leaving distributions such as the mixed exponential distribution. The previous assumption of Poisson recruitment is then generalized to allow for a time-dependent Poisson arrival distribution in which the instantaneous probability of an arrival is a mixture of exponential terms. Finally we extend the capital-related manpower model to describe a multigrade organization.

In this paper, we give some upper (lower) bounds on where the Xi's are real-valued random variables. Some applications are given.

We extend some results of the extreme-value theory of stationary random sequences to non-stationary random sequences. The extremal index, defined in the stationary case, plays a similar role in the extended case. The details show that this index describes not only the behaviour of exceedances above a high level but also above a non-constant high boundary.

There are two types of Asian options in the financial markets which differ according to the role of the average price. We give a symmetry result between the floating- and fixed-strike Asian options. The proof involves a change of numéraire and time reversal of Brownian motion. Symmetries are very useful in option valuation, and in this case the result allows the use of more established fixed-strike pricing methods to price floating-strike Asian options.

A queueing model of considerable interest in computer engineering is the processor-sharing model in which the server shares its fixed capacity equally among all units present in the system. Here, we derive the mean and the variance of the equilibrium sojourn time, and deduce that the variance of the sojourn time is larger for the processor-sharing model than for the corresponding FCFS model.

First, asymptotic results for inter-record times when the CDF of the underlying IID process is not necessarily continuous are obtained, by a stochastic order argument, from known results for the continuous case. Then the asymptotic behaviour of the bivariate process of upper-record values and inter-record times is studied. Finally, assuming continuity of the underlying CDF, we derive the law of the process of total times spent in sets of states, viewing upper record values as states and inter-record times as times spent in a state, the process so viewed being a discrete time continuous state Markov jump process.

The possible relevance of this result to single lane road traffic flow is indicated.