We consider stochastic orders of the following type. Let be a class of functions and let P and Q be probability measures. Then define , if ∫ ⨍ d P ≦ ∫ ⨍ d Q for all f in . Marshall (1991) posed the problem of characterizing the maximal cone of functions generating such an ordering. We solve this problem by using methods from functional analysis. Another purpose of this paper is to derive properties of such integral stochastic orders from conditions satisfied by the generating class of functions. The results are illustrated by several examples. Moreover, we show that the likelihood ratio order is closed with respect to weak convergence, though it is not generated by integrals.

The Mellin-Stieltjes convolution and related decomposition of distributions in M(α) (the class of distributions μ on (0, ∞) with slowly varying αth truncated moments ) are investigated. Maller shows that if X and Y are independent non-negative random variables with distributions μ and v, respectively, and both μ and v are in D2, the domain attraction of Gaussian distribution, then the distribution of the product XY (that is, the Mellin-Stieltjes convolution μ ^ v of μ and v) also belongs to it. He conjectures that, conversely, if μ ∘ v belongs to D2, then both μ and v are in it. It is shown that this conjecture is not true: there exist distributions μ ∈ D2 and v μ ∈ D2 such that μ ^ v belongs to D2. Some subclasses of D2 are given with the property that if μ ^ v belongs to it, then both μ and v are in D2.

This paper establishes a compound Poisson limit theorem for the sum of a sequence of multi-state Markov chains. Our theorem generalizes an earlier one by Koopman for the two-state Markov chain. Moreover, a similar approach is used to derive a limit theorem for the sum of the k th-order two-state Markov chain.

A characterization of the exponential distribution based on a relevation-type equation and its discrete version are extended to the case of multidimensional spaces via variants of the Choquet–Deny theorem. Comments on some recent results in the literature are made.

The theory of majorization is applied to investigate the effects of heterogeneity in a class of epidemics. In particular, the heterogeneity of the components of the contact vector of a given susceptible is studied. It is shown that if the heterogeneity can be partially ordered through majorization, then the probability functions of escaping infection can be similarly ordered. The results can be applied to AIDS research on the spread of the HIV virus.

The shape of a rectangular prism in (d + 1)-dimensions is defined as Y = (Y 1, Y 2, · ··, Yd ), Yn = Ln/Ln +1 where the Ln are the prism's edge lengths, in ascending order. We investigate shape distributions that are invariant when the prism is cut into two, also rectangular, prisms, with one prism retained for measurement and the other discarded. Interesting new distributions on [0, 1]d arise.

In this article we define the s-order equilibrium distribution of a life distribution and establish some interesting properties regarding moments for s-order equilibrium distributions. Results are expected to be useful in reliability and renewal processes.

An aggregated Markov chain is a Markov chain for which some states cannot be distinguished from each other by the observer. In this paper we consider the identifiability problem for such processes in continuous time, i.e. the problem of determining whether two parameters induce identical laws for the observable process or not. We also study the order of a continuous-time aggregated Markov chain, which is the minimum number of states needed to represent it. In particular, we give a lower bound on the order. As a by-product, we obtain results of this kind also for Markov-modulated Poisson processes, i.e. doubly stochastic Poisson processes whose intensities are directed by continuous-time Markov chains, and phase-type distributions, which are hitting times in finite-state Markov chains.

The Stein–Chen method for Poisson approximation is adapted to the setting of the geometric distribution. This yields a convenient method for assessing the accuracy of the geometric approximation to the distribution of the number of failures preceding the first success in dependent trials. The results are applied to approximating waiting time distributions for patterns in coin tossing, and to approximating the distribution of the time when a stationary Markov chain first visits a rare set of states. The error bounds obtained are sharper than those obtainable using related Poisson approximations.

The paper is first concerned with a comparison of the partial sums associated with two sequences of n exchangeable Bernoulli random variables. It then considers a situation where such partial sums are obtained through an iterative procedure of branching type stopped at the first-passage time in a linearly decreasing upper barrier. These comparison results are illustrated with applications to certain urn models, sampling schemes and epidemic processes. A key tool is a non-standard hierarchical class of stochastic orderings between discrete random variables valued in {0, 1,· ··, n}.

Recently new partial orderings s-SFR, s-FR, s-ST, s-CV and s-CX have been defined in the literature. These are more general in the sense that most of the earlier known partial orderings reduce to particular cases of these orderings. Moreover, these orderings have helped in defining a new and useful ageing criterion. In this paper, we discuss preservation properties of these orderings under mixtures. Results are expected to be useful in engineering and reliability, where mixtures of distributions arise naturally in numerous situations. Moreover, existing results, specifically for LR, FR and ST orderings under the operation of mixtures, reduce to special cases.

The multihit–one target model induces a stochastic ordering of cell survival with respect to the cell sensitivity characteristics. This property can be used for a description of cell killing effects in heterogeneous populations of cells on the basis of randomized versions of the model. In such versions, either the critical number of lesions or the mean number of hits per unit dose (sensitivity), or both, are assumed to be random. We give some new results specifying conditions under which the randomized multihit models are identifiable, with a focus on the following cases: (1) the critical number of radiation-induced lesions, m, is random; (2) the sensitivity parameter, x, is random given m is known or otherwise; (3) x and m form a pair of independent random variables.

For (marked) Poisson point processes we give, for increasing events, a new proof of the analog of the BK inequality. In contrast to other proofs, which use weak-convergence arguments, our proof is ‘direct' and requires no extra topological conditions on the events. Apart from some well-known properties of Poisson point processes, the proof is self-contained.

We derive multivariate Sobel–Uppuluri–Galambos-type lower bounds for the probability that at least a 1 and at least a 2, and for the probability that exactly a 1 and a 2, out of n and N events, occur. The lower bound presented here reduces to a sharper bound than that of Galambos and Lee (1992). Our approach is by way of indicator functions and bivariate binomial moments. A new concept, marginal Bonferroni summation, is introduced in this paper.

We investigate the behaviour of P(R ≧ r) and P(R ≦ −r) as r → ∞for the random variable where is an independent, identically distributed sequence with P(− 1 ≦ M ≦ 1) = 1. Random variables of this type appear in insurance mathematics, as solutions of stochastic difference equations, in the analysis of probabilistic algorithms and elsewhere. Exponential and Poissonian tail behaviour can arise.

We derive upper bounds for the total variation distance, d, between the distributions of two random sums of non-negative integer-valued random variables. The main results are then applied to some important random sums, including cluster binomial and cluster multinomial distributions, to obtain bounds on approximating them to suitable Poisson or compound Poisson distributions. These bounds are generally better than the known results on Poisson and compound Poisson approximations. We also obtain a lower bound for d and illustrate it with an example.

In this paper we investigate operators that map one or more probability distributions on the positive real line into another via their Laplace–Stieltjes transforms. Our goal is to make it easier to construct new transforms by manipulating known transforms. We envision the results here assisting modelling in conjunction with numerical transform inversion software. We primarily focus on operators related to infinitely divisible distributions and Lévy processes, drawing upon Feller (1971). We give many concrete examples of infinitely divisible distributions. We consider a cumulant-moment-transfer operator that allows us to relate the cumulants of one distribution to the moments of another. We consider a power-mixture operator corresponding to an independently stopped Lévy process. The special case of exponential power mixtures is a continuous analog of geometric random sums. We introduce a further special case which is remarkably tractable, exponential mixtures of inverse Gaussian distributions (EMIGs). EMIGs arise naturally as approximations for busy periods in queues. We show that the steady-state waiting time in an M/G/1 queue is the difference of two EMIGs when the service-time distribution is an EMIG. We consider several transforms related to first-passage times, e.g. for the M/M/1 queue, reflected Brownian motion and Lévy processes. Some of the associated probability density functions involve Bessel functions and theta functions. We describe properties of the operators, including how they transform moments.

In the paper we first show how to convert a generalized Bonferroni-type inequality into an estimation for the generating function of the number of occurring events, then we give estimates for the deviation of two discrete probability distributions in terms of the maximum distance between their generating functions over the interval [0, 1].

Intersymbol and cochannel interference in a communications channel can often be modelled as the sum of an infinite series of random variables with weights which decay fairly rapidly. Frequently, this yields a random variable which is singular but non-atomic. The Hausdorff dimension of the distribution is estimated and methods for calculating expectations are studied. A connection is observed between the dimension and the complexity of the calculation of an expectation.

In this paper we establish a characterization theorem for a general class of life-testing models based on a relationship between conditional expectation and the failure rate function. As a simple application of the theorem, we characterize the gamma, Weibull, and Gompertz distributions, since they have many probabilistic and statistical properties useful in both biometry and engineering reliability.