We discuss two formulations of the infinitely-many-neutral-alleles diffusion model that can be used to study the ages of alleles. The first one, which was introduced elsewhere, assumes values in the set of probability distributions on the set of alleles, and the ages of the alleles can be inferred from its sample paths. We illustrate this approach by proving a result of Watterson and Guess regarding the probability that the most frequent allele is oldest. The second diffusion model, which is new, assumes values in the set of probability distributions on the set of pairs (x, a), where x is an allele and a is its age. We illustrate this second approach by proving an extension of the Ewens sampling formula to age-ordered samples due to Donnelly and Tavaré.

We prove that the frequencies of the oldest, second-oldest, third-oldest, … alleles in the stationary infinitely-many-neutral-alleles diffusion model are distributed as X1, (1 − X1)X2, (1 − X1)(1 − X2)X3, …, where X1, X2,X3, … are independent beta (1, θ) random variables, θ being twice the mutation intensity; that is, the frequencies of age-ordered alleles have the so-called Griffiths–Engen–McCloskey, or GEM, distribution. In fact, two proofs are given, the first involving reversibility and the size-biased Poisson–Dirichlet distribution, and the second relying on a result of Donnelly and Tavaré relating their age-ordered sampling formula to the GEM distribution.

An extended version, called collective, of the randomized Reed-Frost processes is considered where each infective during his survival time fails to transmit the infection within any given set of susceptibles with a probability depending only on the size of that set. Our purpose is to provide a unified analysis of the distribution of the final size and severity, the two main components of the cost generated by the infection process. The method developed relies on the construction of a family of martingales and the use of a family of polynomials studied recently by the authors (Lefèvre and Picard (1990)). The results generalize a number of earlier ones and are derived in a more direct and systematic way than before.

The neutral two-locus model in population genetics is reformulated as a measure-valued diffusion process and is shown under certain conditions to have a unique stationary distribution and be weakly ergodic. The limits of the process and its stationary distribution as the recombination parameter tends to infinity are found. Genealogies are incorporated into the model, and it is shown that a random sample of size n from the population at stationarity has a common ancestor.

This paper presents a simple model of the decision problems which face many animals in the wild. Animals have an upper limit to the amount of energy reserves which can be stored as body fat. They constantly use energy and find food as a stochastic process. Death occurs if energy reserves fall to zero or if the animal is taken by a predator. Typically animals have a range of behavioural options which differ in the distribution of food gained and in the associated predation risk. There is often a trade-off between starvation and predation in that animals have to expose themselves to higher predation risks in order to gain more food.

The above situation is modelled as a finite-state, finite-time-horizon Markov decision problem. The policy which maximises long-term survival probability is characterised. As special cases two trade-offs are analysed. It is shown that an animal should take fewer risks in terms of predation as its reserves increase, and that an animal should reduce the variability of its food supply at the expense of its mean gain as its reserves increase.

The dynamical behaviour of particles which undergo diffusion with annihilation is modelled by a parabolic (Fokker–Planck) equation. Fundamental, closed-form solutions of this equation, identified with transition densities of the underlying stochastic process, are calculated by utilizing specific methods of probability measures on functional spaces and evolution semigroups.

In this paper, we refine the concept of Γ-variation up to second order, and we give a characterization of this type of asymptotic behaviour. We apply our results to obtain uniform rates of convergence in the weak convergence of renormalised sample maxima to the double exponential distribution. In a second application we derive a rate of convergence result for the Hill estimator.

This paper provides a global treatment of the final size distribution of Reed–Frost epidemic processes. Exact and asymptotic results are derived for both single and multipopulation situations. The key tool is a non-standard family of polynomials, introduced initially by Gontcharoff (1937) for one variable, revisited and extended here for several variables. The attractiveness of these polynomials will be enhanced in forthcoming works in the epidemic context as well as in other fields.

In this paper, we give an alternative derivation of Kendall's representation for symmetric transition functions which relies on the backward and/or forward integral recursions. The proof uses a lemma concerning approximation by finite sections (which is useful in its own right) and is similar to the original proof for birth and death processes by Lederman and Reuter. Finally, we obtain a general result guaranteeing the existence of representations of transition functions such as those obtained by Pruitt and Iglehart.

We consider a time reversible, continuous time Markov chain on a finite state space. The state space is partitioned into two sets, termed open and closed, and it is only possible to observe whether the process is in an open or a closed state. Further, short sojourns in either the open or closed states fail to be detected. We consider the situation when the length of minimal detectable sojourns follows a negative exponential distribution with mean μ–1. We show that the probability density function of observed open sojourns takes the form , where n is the size of the state space. We present a thorough asymptotic analysis of fO(t) as μ tends to infinity. We discuss the relevance of our results to the modelling of single channel records. We illustrate the theory with a numerical example.

Let (Y(t), t > 0) be a d-dimensional non-homogeneous multivariate extremal process. We suppose the ith component of Y describes time-dependent behaviour of random utilities associated with the ith choice. At time t we choose the ith alternative if the ith component of Y(t) is the largest of all the components. Let J(t) be the index of the largest component at time t so J has range {1, …, d} and call {J(t)} the leader process. Let Z(t) be the value of the largest component at time t. Then the bivariate process (J(t), Z(t)} is Markov. We discuss when J(t) and Z(t) are independent, when {J(s), 0<s≦t} and Z(t) are independent and when J(t) and {Z(s), 0<s≦t} are independent. In usual circumstances, {J(t)} is Markov and particular properties are given when the underlying distribution is max-stable. In the max-stable time-homogeneous case, {J(et)} is a stationary Markov chain with stationary transition probabilities.

The existence of the multitype measure branching process is established as a small particle limit of a system of particles of several types in Rd with immigration undergoing migration, branching and mutation. The process is characterized as a solution of a martingale problem. The single-type case was studied by Dawson (1975), (1977) and Watanabe (1968).

A sequence of random triangles is constructed by choosing successively the three vertices of one triangle at random in the interior of its predecessor. A way is found to prove that the shapes of these triangles converge, almost surely, to collinear shapes, thus closing a gap in one of the central arguments of Mannion [5]. The new approach is based on a representation of the triangle process by a sequence of products of i.i.d. random matrices. We succeed in calculating the corresponding Lyapounov exponent.

Central limit theorems are proved for random walks on the non-negative integers where the transition probabilities are homogeneous with respect to a sequence of orthogonal polynomials. Assuming some restrictions concerning the three-term recursion formula of these polynomials, one gets a Rayleigh distribution as limit distribution where bounds of the order of convergence can be computed explicitly. These central limit theorems are applied to generalized birth and death random walks and random walks on polynomial hypergroups. Finally some examples of polynomial hypergroups are discussed in view of the limit theorems above.

Electric water heating loads, in power systems, can be adequately modeled by Markov processes comprising a mix of continuous and discrete states. A physically-based characterization of the dynamic behavior of large aggregates of electric water heating loads is obtained by deriving the forward Kolmogorov equations associated with the individual hybrid-state processes. In addition, by focusing on the discrete part of the state, a Markov renewal viewpoint of the processes is developed. Both viewpoints are used to analyze and predict the transient and steady-state behavior of these loads, of great importance in load management applications.

Most theoretical studies of image processing employ discrete image models. While that might be a good approximation to digital analysis, it severely restricts the class of tractable models for the blur component of image degradation, and concentrates excessive attention on specialized features of the pixel lattice. It is analogous to modelling all real statistical data using discrete distributions, which is clearly unnecessary. In this paper we study a continuous model for image analysis, in the presence of systematic degradation via a point spread function and stochastic degradation by a second-order stationary random field. Thus, we depart from the restrictive white-noise models which are commonly used in the theory of image analysis. We establish a general result which describes the performance of optimal image processing methods when the noise process has short-range dependence. Concise limits to resolution are derived, depending on image type, point spread function and noise correlation. These results are developed in important special cases, giving explicit formulae for optimal smoothing sets and convergence rates.

A recent Monte Carlo method for solving one-dimensional reaction–diffusion equations is considered here as a convergence problem for a sequence of spatial branching processes with interaction. The martingale problem is studied and a limit theorem is proved by embedding spaces of measures in Sobolev spaces.

The approximation of sums of independent random variables by compound Poisson distributions with respect to stop-loss distances is investigated. These distances are motivated by risk-theoretic considerations. In contrast to the usual construction of approximating compound Poisson distributions, the method suggested in this paper is to fit several moments. For two moments, this can be achieved by scale transformations. It is shown that the new approximations are more stable and improve the usual approximations by accompanying laws in examples where the probability 1 – pi that the ith summand is zero is not too large.

The shape of the nth in a sequence of random triangle shapes is (xn, yn). It was shown in [8] and [9] that yn → 0, almost surely, as n → ∞. In this paper we show that x„ converges in distribution, as n→∞, to a random variable x, and we find the probability distribution of x. The convergence in law of xn enables us to complete an argument used in one part of [9].

It is shown how Markov chain theory can be exploited to study non-linear time series, the emphasis being on the classification into stationary and non-stationary models. A generalized h-step version of the Tweedie (1975), (1976) criteria is formulated, and applications are given to a number of non-linear models. New results are obtained, and known results are shown to emerge as special cases in both the scalar and vector case. A connection to stability theory is briefly discussed, and it is indicated how the Markov property can be utilized for estimation purposes.