A navigation on a set of points S is a rule for choosing which point to move to from the present point in order to progress toward a specified target. We study some navigations in the plane where S is a nonuniform Poisson point process (in a finite domain) with intensity going to +∞. We show the convergence of the traveller's path lengths, and give the number of stages and the geometry of the traveller's trajectories, uniformly for all starting points and targets, for several navigations of geometric nature. Other costs are also considered. This leads to asymptotic results on the stretch factors of random Yao graphs and random θ-graphs.

We study stochastic properties of the empty space for stationary germ-grain models in R^d; in particular, we deal with the inner radius of the empty space with respect to a general structuring element which is allowed to be lower dimensional. We consider Poisson cluster and mixed Poisson germ-grain models, and show in several situations that more variability results in stochastically greater empty space in terms of the empty space hazard function. Furthermore, we study the asymptotic behaviour of the empty space hazard functions at 0 and at ∞.

Tessellations of R³ that use convex polyhedral cells to fill the space can be extremely complicated. This is especially so for tessellations which are not `facet-to-facet', that is, for those where the facets of a cell do not necessarily coincide with the facets of that cell's neighbours. Adjacency concepts between neighbouring cells (or between neighbouring cell elements) are not easily formulated when facets do not coincide. In this paper we make the first systematic study of these topological relationships when a tessellation of R<sup>3</sup> is not facet-to-facet. The results derived can also be applied to the simpler facet-to-facet case. Our study deals with both random tessellations and deterministic `tilings'. Some new theory for planar tessellations is also given.

In many service, production, and traffic systems there are multiple types of customers requiring different types of `servers', i.e. different services, products, or routes. Often, however, a proportion of the customers are flexible, i.e. they are willing to change their type in order to achieve faster service, and even if this proportion is small, it has the potential of achieving large performance gains. We generalize earlier results on the optimality of `join the shortest queue' (JSQ) for flexible arrivals to the following: arbitrary arrivals where only a subset are flexible, multiple-server stations, and abandonments. Surprisingly, with abandonments, the optimality of JSQ for minimizing the number of customers in the system depends on the relative abandonment and service rates. We extend our model to finite buffers and resequencing. We assume exponential service. Our optimality results are very strong; we minimize the queue length process in the weak majorization sense.

Systems of stochastic chemical kinetics are modeled as infinite level-dependent quasi-birth-and-death (LDQBD) processes. For these systems, in contrast to many other applications, levels have an increasing number of states as the level number increases and the probability mass may reside arbitrarily far away from lower levels. Ideas from Lyapunov theory are combined with existing matrix-analytic formulations to obtain accurate approximations to the stationary probability distribution when the infinite LDQBD process is ergodic. Results of numerical experiments on a set of problems are provided.

In this paper we study a general class of population genetic models where the total population is divided into a number of subpopulations or types. Migration between subpopulations is fast. Extending the results of Nordborg and Krone (2002) and Sagitov and Jagers (2005), we prove, as the total population size N tends to ∞, weak convergence of the joint ancestry of a given sample of haploid individuals in the Skorokhod topology towards Kingman's coalescent with a constant change of time scale c. Our framework includes age-structured models, geographically structured models, and combinations thereof. We also allow each individual to have offspring in several subpopulations, with general dependency structures between the number of offspring of various types. As a byproduct, explicit expressions for the coalescent effective population size N/c are obtained.

This paper is concerned with a stochastic model for the spread of an epidemic with a contact tracing scheme, in which diagnosed individuals may name some of their infectious contacts, who are then removed if they have not been already. Traced individuals may or may not also be asked to name their own contacts. The epidemic is studied by considering an approximating, modified birth-death process with intersibling dependencies, for which a threshold parameter and expressions from which extinction probabilities may be calculated are derived. When all individuals can name their contacts, it is shown that this threshold parameter depends on the infectious period distribution only through its mean. Numerical studies show that the infectious period distribution choice can have a material effect on the threshold behaviour of an epidemic, while the dependencies help reduce spread.

In this paper we investigate the relationship between the sampling formula and Laplace transform associated with the two-parameter Poisson-Dirichlet distribution. We conclude that they are equivalent to determining the corresponding infinite-dimensional distribution. With these tools, a central limit theorem is established associated with the infinitely-many-neutral-alleles model at any fixed time. We also obtain the probability generating function of random sampling from a generalized two-parameter diffusion process. At the end of the paper a selection case is considered.

In this paper we establish an extension of the method of approximating optimal discrete-time stopping problems by related limiting stopping problems for Poisson-type processes. This extension allows us to apply this method to a larger class of examples, such as those arising, for example, from point process convergence results in extreme value theory. Furthermore, we develop new classes of solutions of the differential equations which characterize optimal threshold functions. As a particular application, we give a fairly complete discussion of the approximative optimal stopping behavior of independent and identically distributed sequences with discount and observation costs.

Multivariate Lévy-driven mixed moving average (MMA) processes of the type X_t = ∬f(A, t - s)Λ(dA, ds) cover a wide range of well known and extensively used processes such as Ornstein-Uhlenbeck processes, superpositions of Ornstein-Uhlenbeck (supOU) processes, (fractionally integrated) continuous-time autoregressive moving average processes, and increments of fractional Lévy processes. In this paper we introduce multivariate MMA processes and give conditions for their existence and regular variation of the stationary distributions. Furthermore, we study the tail behavior of multivariate supOU processes and of a stochastic volatility model, where a positive semidefinite supOU process models the stochastic volatility.

Motivated by the pricing of lookback options in exponential Lévy models, we study the difference between the continuous and discrete supremums of Lévy processes. In particular, we extend the results of Broadie, Glasserman and Kou (1999) to jump diffusion models. We also derive bounds for general exponential Lévy models.

We consider the problem of estimation in a partially observed discrete-time Galton-Watson branching process, focusing on the first two moments of the offspring distribution. Our study is motivated by modelling the counts of new cases at the onset of a stochastic epidemic, allowing for the facts that only a part of the cases is detected, and that the detection mechanism may affect the evolution of the epidemic. In this setting, the offspring mean is closely related to the spreading potential of the disease, while the second moment is connected to the variability of the mean estimators. Inference for branching processes is known for its nonstandard characteristics, as compared with classical inference. When, in addition, the true process cannot be directly observed, the problem of inference suffers significant further perturbations. We propose nonparametric estimators related to those used when the underlying process is fully observed, but suitably modified to take into account the intricate dependence structure induced by the partial observation and the interaction scheme. We show consistency, derive the limiting laws of the estimators, and construct asymptotic confidence intervals, all valid conditionally on the explosion set.