We study the variance-to-mean ratio of the distributions of parasites among hosts for some models of parasite infection, using the cohort approach. We consider a model with density dependence in parasite mortality, and two different formulations of disease induced host mortality. We show that the distributions of parasites, conditional on host survival, converge to quasi-stationary distributions as host age increases. When there is density dependence in parasite mortality, the limiting variance-to-mean ratio is less than 1 (an ‘under-dispersed’ distribution). In contrast, the two modes of disease induced host mortality show that either over- or underdispersed distributions may result.

Two features are desired in designing a sequential clinical trial: randomness and balance. The former makes the ground for valid statistical inferences and the latter strengthens efficiency in inference procedures. Unfortunately randomness and balance can be in conflict with one another, and clinicians may be caught between the need for both of them. This paper raises an interesting question: can one design consistently achieve more balance than another when both designs own the same randomness? The Ehrenfest urn design is presented to allocate two treatments under a sequential clinical trial, and its balance and randomness properties are investigated. The design is compared with the biased coin design with imbalance tolerance.

When the premium rate is a positive absolute constant throughout the time period of observation and the safety loading of the insurance business is positive, a classical result of collective risk theory claims that probabilities of ultimate ruin ψ(u) and of ruin within finite time ψ(t,u) decrease as eϰu with a constant ϰ>0, as the initial risk reserve u increases. This paper establishes uniform approximations to ψ(t,u) with slower rates of decrease when the premium rate depends on u in such a way that the safety loading decreases to zero as u→∞.

A duality is presented for continuous-time, real-valued, monotone, stochastic recursions driven by processes with stationary increments. A given recursion defines the time evolution of a content process (such as a dam or queue), and it is shown that the existence of the content process implies the existence of a corresponding dual risk process that satisfies a dual recursion. The one-point probabilities for the content process are then shown to be related to the one-point probabilities of the risk process. In particular, it is shown that the steady-state probabilities for the content process are equivalent to the first passage time probabilities for the risk process. A number of applications are presented that flesh out the general theory. Examples include regulated processes with one or two barriers, storage models with general release rate, and jump and diffusion processes.

This paper proposes and analyzes discrete-time approximations to a class of diffusions, with an emphasis on preserving certain important features of the continuous-time processes in the approximations. We start with multivariate diffusions having three features in particular: they are martingales, each of their components evolves within the unit interval, and the components are almost surely ordered. In the models of the term structure of interest rates that motivate our investigation, these properties have the important implications that the model is arbitrage-free and that interest rates remain positive. In practice, numerical work with such models often requires Monte Carlo simulation and thus entails replacing the original continuous-time model with a discrete-time approximation. It is desirable that the approximating processes preserve the three features of the original model just noted, though standard discretization methods do not. We introduce new discretizations based on first applying nonlinear transformations from the unit interval to the real line (in particular, the inverse normal and inverse logit), then using an Euler discretization, and finally applying a small adjustment to the drift in the Euler scheme. We verify that these methods enforce important features in the discretization with no loss in the order of convergence (weak or strong). Numerical results suggest that these methods can also yield a better approximation to the law of the continuous-time process than does a more standard discretization.

The authors prove that certain reliability formulas which link asymptotic availability, mean normal operation time, mean time between failures, mean number of failures over a period of time and asymptotic Vesely rate, and which are well known in the case of modelling using a Markov jump process or an alternating renewal process, are also true in the context of more general modelling.

Often, the statistical analysis of the shape of a random planar curve is based on a model for a polygonal approximation to the curve. In the present paper, we instead describe the curve as a continuous stochastic deformation of a template curve. The advantage of this continuous approach is that the parameters in the model do not relate to a particular polygonal approximation. A somewhat similar approach has been used in Kent et. al. (1996), who describe the limiting behaviour of a model with a first-order Markov property as the landmarks on the curve become closely spaced; see also Grenander (1993). The model studied in the present paper is an extension of this model. Our model possesses a second-order Markov property. Its geometrical characteristics are studied in some detail and an explicit expression for the covariance function is derived. The model is applied to the boundaries of profiles of cell nuclei from a benign tumour and a malignant tumour. It turns out that the model with the second-order Markov property is the most appropriate, and that it is indeed possible to distinguish between the two samples.

This work develops a class of stochastic global optimization algorithms that are Kiefer-Wolfowitz (KW) type procedures with an added perturbing noise and partial step size restarting. The motivation stems from the use of KW-type procedures and Monte Carlo versions of simulated annealing algorithms in a wide range of applications. Using weak convergence approaches, our effort is directed to proving the convergence of the underlying algorithms under general noise processes.

We consider a device that is subject to three types of failures: repairable, non-repairable and failures due to wear-out. This last type is also non-repairable. The times when the system is operative or being repaired follow phase type distributions. When a repairable failure occurs, the operating time of the device decreases, in that the lifetimes between failures are stochastically decreasing according to a geometric process. Following a non-repairable failure or after a previously fixed number of repairs occurs, the device is replaced by a new one. Under these conditions, the functioning of the device can be modelled by a Markov process. We consider two different models depending on whether or not the phase of the operational system at the instants of failure is remembered or not. For both models we derive the stationary distribution of the Markov process, the availability of the device, the rate of occurrence of the different types of failures, and certain quantities of interest.

The isotropic planar point processes of phase-type are natural generalizations of the Poisson process on the plane. On the one hand, those processes are isotropic and stationary for the mean count, as in the case of the Poisson process. On the other hand, they exhibit dependence of counts in disjoint sets. In a recent paper, we have proved that the number of points in a square window has a Poisson distribution asymptotically as the window is located far away from the origin of the process. We extend our work to the case of a window of arbitrary shape.

We consider Markov processes of DNA sequence evolution in which the instantaneous rates of substitution at a site are allowed to depend upon the states at the sites in a neighbourhood of the site at the instant of the substitution. We characterize the class of Markov process models of DNA sequence evolution for which the stationary distribution is a Gibbs measure, and give a procedure for calculating the normalizing constant of the measure. We develop an MCMC method for estimating the transition probability between sequences under models of this type. Finally, we analyse an alignment of two HIV-1 gene sequences using the developed theory and methodology.

We study the following stochastic investment model: opportunities occur randomly over time, following a renewal process with mean interarrival time d, and at each of them the decision-maker can choose a distribution for an instantaneous net gain (or loss) from the set of all probability measures that have some prespecified expected value e and for which his maximum possible loss does not exceed his current capital. Between the investments he spends money at some constant rate. The objective is to avoid bankruptcy as long as possible. For the case e>d we characterize a strategy maximizing the probability that ruin never occurs. It is proved that the optimal value function is a concave function of the initial capital and uniquely determined as the solution of a fixed point equation for some intricate operator. In general, two-point distributions suffice; furthermore, we show that the cautious strategy of always taking the deterministic amount e is optimal if the interarrival times are hyperexponential, and, in the case of bounded interarrival times, is optimal ‘from some point on’, i.e. whenever the current capital exceeds a certain threshold. In the case e = 0 we consider a class of natural objective functions for which the optimal strategies are non-stationary and can be explicitly determined.

The paper compares non-parametric (design-based) and parametric (model-based) approaches to the analysis of data in the form of replicated spatial point patterns in two or more experimental groups. Basic questions for data of this kind concern estimating the properties of the underlying spatial point process within each experimental group, and comparing the properties between groups. A non-parametric approach, building on work by Diggle et. al. (1991), summarizes each pattern by an estimate of the reduced second moment measure or K-function (Ripley (1977)) and compares mean K-functions between experimental groups using a bootstrap testing procedure. A parametric approach fits particular classes of parametric model to the data, uses the model parameter estimates as summaries and tests for differences between groups by comparing fits with and without the assumption of common parameter values across groups. The paper discusses how either approach can be implemented in the specific context of a single-factor replicated experiment and uses simulations to show how the parametric approach can be more efficient when the underlying model assumptions hold, but potentially misleading otherwise.

We consider a multiserver queue in the heavy-traffic regime introduced and studied by Halfin and Whitt who investigated the case of a single customer class with exponentially distributed service times. Our purpose is to extend their analysis to a system with multiple customer classes, priorities, and phase-type service distributions. We prove a weak convergence limit theorem showing that a properly defined and normalized queue length process converges to a particular K-dimensional diffusion process, where K is the number of phases in the service time distribution. We also show that a properly normalized waiting time process converges to a simple functional of the limit diffusion for the queue length.

In, Tory and Pickard show that a simple subclass of unilateral AR processes identifies with Gaussian Pickard random fields on Z2. First, we extend this result to the whole class of unilateral AR processes, by showing that they all satisfy a Pickard-type property, under which correlation matching and maximum entropy properties are assessed. Then, it is established that the Pickard property provides the ‘missing’ equations that complement the two-dimensional Yule-Walker equations, in the sense that the conjunction defines a one-to-one mapping between the set of AR parameters and a set of correlations. It also implies Markov chain conditions that allow exact evaluation of the likelihood and an exact sampling scheme on finite lattices.

We establish new multidimensional martingales for Markov additive processes and certain modifications of such processes (e.g., such processes with reflecting barriers). These results generalize corresponding one-dimensional martingale results for Lévy processes. This martingale is then applied to various storage processes, queues and Brownian motion models.

Based on remote sensing of a potential minefield, point locations are identified, some of which may not be mines. The mines and mine-like objects are to be distinguished based on their point patterns, although it must be emphasized that all one sees is the superposition of their locations. In this paper, we construct a hierarchical spatial point-process model that accounts for the different patterns of mines and mine-like objects and uses posterior analysis to distinguish between them. Our Bayesian approach is applied to minefield data obtained from a multispectral video remote-sensing system.