The random surface measure of a stationary Boolean model with grains from the convex ring is considered. A sufficient condition and a necessary condition for the existence of the density of the second-order moment measure of are given and a representation of this density is derived. As applications, the surface pair correlation functions of a Boolean model with spheres and a Boolean model with randomly oriented right circular cylinders in ℝ3 are determined.

We introduce a new class of spatial-temporal point processes based on Voronoi tessellations. At each step of such a process, a point is chosen at random according to a distribution determined by the associated Voronoi cells. The point is then removed, and a new random point is added to the configuration. The dynamics are simple and intuitive and could be applied to modelling natural phenomena. We prove ergodicity of these processes under wide conditions.

The covariogram gK(x) of a convex body K ⊆ Ed is the function which associates to each x ∈ Ed the volume of the intersection of K with K + x, where Ed denotes the Euclidean d-dimensional space. Matheron (1986) asked whether gK determines K, up to translations and reflections in a point. Positive answers to Matheron's question have been obtained for large classes of planar convex bodies, while for d ≥ 3 there are both positive and negative results. One of the purposes of this paper is to sharpen some of the known results on Matheron's conjecture indicating how much of the covariogram information is needed to get the uniqueness of determination. We indicate some subsets of the support of the covariogram, with arbitrarily small Lebesgue measure, such that the covariogram, restricted to those subsets, identifies certain geometric properties of the body. These results are more precise in the planar case, but some of them, both positive and negative ones, are proved for bodies of any dimension. Moreover some results regard most convex bodies, in the Baire category sense. Another purpose is to extend the class of convex bodies for which Matheron's conjecture is confirmed by including all planar convex bodies possessing two nondegenerate boundary arcs being reflections of each other.

We consider two different models of small-world graphs on nodes whose locations are modelled by a stochastic point process. In the first model each node is connected to a fixed number of its nearest neighbours, while in the second model each node is connected to all nodes located within some fixed distance. In both models, nodes are additionally connected via shortcuts to other nodes chosen uniformly at random. We obtain sufficient conditions for connectivity in the first model, and necessary conditions in the second model. Thereby, we show that connectivity is achieved at a smaller value of total degree (nearest neighbours plus shortcuts) in the first model. We also obtain bounds on the diameter of the graph in this model.

Intersection densities are introduced for a large class of nonstationary Poisson processes of hypersurfaces and inequalities for them are proved. In doing so, similar results from both Wieacker (1986) and Schneider (2003) are summarized in one theorem and the concept of an associated zonoid of a Poisson process of hypersurfaces is generalized to a nonstationary setting.

Generalized local mean normal measures μz, z ∈ Rd, are introduced for a nonstationary process X of convex particles. For processes with strictly convex particles it is then shown that X is weakly stationary and weakly isotropic if and only if μz is rotation invariant for all z ∈ Rd. The paper is concluded by extending this result to processes of cylinders, generalizing Theorem 1 of Schneider (2003).

Let n points be randomly and independently placed in Rd according to a common probability law. It is known that the expected volume for the convex hull of these points, in the cases where n - d ≥ 2 and even, is related linearly to expected volumes of the convex hulls for j points, j < n. We show that similar identities for these volumes hold almost surely - and in contexts where independence and communality of law do not apply. New geometric and topological identities developed here provide a foundation for this result.

We consider the Voronoi tessellation based on a stationary Poisson process N in ℝd. We provide a complete and explicit description of the Palm distribution describing N as seen from a randomly chosen (typical) point on a k-face of the tessellation. In particular, we compute the joint distribution of the d−k+1 neighbours of the k-face containing the typical point. Using this result as well as a fundamental general relationship between Palm probabilities, we then derive some properties of the typical k-face and its neighbours. Generalizing recent results of Muche (2005), we finally provide the joint distribution of the typical edge (typical 1-face) and its neighbours.

The volume fraction of the intact grains of the dead leaves model with spherical grains of equal size is 2−d in d dimensions. This is the volume fraction of the original Stienen model. Here we consider some variants of these models: the dead leaves model with grains of a fixed convex shape and possibly random sizes and random orientations, and a generalisation of the Stienen model with convex grains growing at random speeds. The main result of this paper is that if the radius distribution in the dead leaves model equals the speed distribution in the Stienen model, then the volume fractions of the two models are the same in this case also. Furthermore, we show that for grains of a fixed shape and orientation, centrally symmetric sets give the highest volume fraction, while simplices give the lowest. If the grains are randomly rotated, then the volume fraction achieves its highest value only for spheres.

The Palm version of a stationary random subset of a d-dimensional grid is contructed using the two-step change-of-origin and change-of-measure method. An elementary proof is given of the fact that the Palm version is characterized by point-stationarity (distributional invariance under bijective shifts of the origin from a point of the set to another point of the set).

This paper is devoted to the study of two-person zero-sum games for continuous-time jump Markov processes with a discounted payoff criterion. The state and action spaces are all Polish spaces, the transition rates are allowed to be unbounded, and the payoff rates may have neither upper nor lower bounds. We give conditions on the game's primitive data under which the existence of a solution to the Shapley equation is ensured. Then, from the Shapley equation, we obtain the existence of the value of the game and of a pair of optimal stationary strategies using the extended infinitesimal operator associated with the transition function of a possibly nonhomogeneous continuous-time jump Markov process. We also provide a recursive way of computing (or at least approximating) the value of the game. Moreover, we present a ‘martingale characterization’ of a pair of optimal stationary strategies. Finally, we apply our results to a controlled birth and death system and a Schlögl first model, and then we use controlled Potlach processes to illustrate our conditions.

In this paper we consider a tessellation V generated by a homogeneous Poisson process Φ in Rd and, furthermore, the random set of spheres with centres being the points in Φ and having radii equal to half the distance to their closest neighbouring point in Φ. In Rd we give an integral formula for the correlation between the volume of the typical cell and the volume of the sphere in the typical cell, and we also show that this correlation is strictly positive. Furthermore, on the real line we give an analytical expression for the correlation, and in the plane and in space we give simplified integral formulae. Numerical values for the correlation for d = 2,…,7 are also given.

Under the unifying umbrella of a general result of Penrose and Yukich (Annals of Applied Probability13 (2003), 277-303) we give laws of large numbers (in the Lp sense) for the total power-weighted length of several nearest-neighbour-type graphs on random point sets in ℝd, d ∈ ℕ. Some of these results are known; some are new. We give limiting constants explicitly, where previously they have been evaluated in less generality or not at all. The graphs we consider include the k-nearest-neighbours graph, the Gabriel graph, the minimal directed spanning forest, and the on-line nearest-neighbour graph.

The problem of optimal dividends paid until absorbtion at zero is considered for a rather general diffusion model. With each dividend payment there is a proportional cost and a fixed cost. It is shown that there can be essentially three different solutions depending on the model parameters and the costs. (i) Whenever assets reach a barrier y*, they are reduced to y* - δ* through a dividend payment, and the process continues. (ii) Whenever assets reach a barrier y*, everything is paid out as dividends and the process terminates. (iii) There is no optimal policy, but the value function is approximated by policies of one of the two above forms for increasing barriers. A method to numerically find the optimal policy (if it exists) is presented and numerical examples are given.

We prove that the Bartlett spectrum of a stationary, infinitely divisible (ID) random measure determines ergodicity, weak mixing, and mixing. In this context, the Bartlett spectrum plays the same role as the spectral measure of a stationary Gaussian process.

A Euclidean first passage percolation model describing the competing growth between k different types of infection is considered. We focus on the long-time behavior of this multitype growth process and we derive multitype shape results related to its morphology.