For Markov processes on the positive integers with the origin as an absorbing state, Ferrari, Kesten, Martínez and Picco studied the existence of quasi-stationary and limiting conditional distributions by characterizing quasi-stationary distributions as fixed points of a transformation Φ on the space of probability distributions on {1, 2, …}. In the case of a birth–death process, the components of Φ(ν) can be written down explicitly for any given distribution ν. Using this explicit representation, we will show that Φ preserves likelihood ratio ordering between distributions. A conjecture of Kryscio and Lefèvre concerning the quasi-stationary distribution of the SIS logistic epidemic follows as a corollary.

Design engineers are well aware that a system where active spare allocation is made at the component level has a lifetime stochastically larger than the corresponding system where active spare allocation is made at the system level. In view of the importance of hazard rate ordering in reliability and survival analysis, Boland and El-Neweihi (1995) recently investigated this principle in hazard rate ordering and demonstrated that it does not hold in general. They showed that for a 2-out-of-n system with independent and identical components and spares, active spare allocation at the component level is superior to active spare allocation at the system level. They conjectured that such a principle holds in general for a k-out-of-n system when components and spares are independent and identical. We prove that for a k-out-of-n system where components and spares have independent and identical life distributions active spare allocation at the component level is superior to active spare allocation at the system level in likelihood ratio ordering. This is stronger than hazard rate ordering, thus establishing the conjecture of Boland and El-Neweihi (1995).

Stochastic majorization is a tool that has been used in many areas of probability and statistics (such as multivariate statistical analysis, queueing theory and reliability theory) in order to obtain useful bounds and inequalities. In this paper we study the relations among several notions of stochastic majorization and stochastic convexity and obtain sufficient (and sometimes necessary) conditions which imply some of these notions. Extensions and generalizations of several results in the literature are obtained. Some examples and applications regarding stochastic comparisons of order statistics are also presented in order to illustrate the results of the paper.

The bivariate characterization of stochastic ordering relations given by Shanthikumar and Yao (1991) is based on collections of bivariate functions g(x, y), where g(x, y) and g(y, x) satisfy certain properties. We give an alternate characterization based on collections of pairs of bivariate functions, g1(x, y) and g2(x, y), satisfying certain properties. This characterization allows us to extend results for single machine scheduling of jobs that are identical except for their processing times, to jobs that may have different costs associated with them.

Bivariate (and multivariate) functional representations for the following stochastic order relations are established: the likelihood ratio ordering, hazard rate ordering, and the usual stochastic ordering. The motivation of the study is (i) to provide a general approach that supports the ‘pairwise interchange' arguments widely used in various settings, and (ii) to develop new notions of stochastic order relations so that dependent random variables can be meaningfully compared. Applications are illustrated through problems in stochastic scheduling, closed queueing network and reliability.

A star-like circuit-switching network with multistage service is considered. Likelihood ratio ordering is used to show that there exists an optimal threshold for the mean number of messages processed through the network as a function of the input traffic intensity.

In this paper we study the equilibrium behavior of the queue lengths in a product-form closed queueing network when the service rates at a subset of stations (nodes) are increased. Univariate and multivariate likelihood ratio orderings as well as multivariate stochastic ordering of the queue lengths are established to indicate the effect of increasing the service rates. Relations among these orderings are also developed.