In the present study, we establish the existence of site percolation in the Gabriel graph for Poisson and hard-core stationary point processes.

Knowing the (geometric) covariogram of a convex body is equivalent to knowing, for each direction u, the distribution of the lengths of the chords of that body which are parallel to u. We prove that the covariogram determines convex polygons, among all convex bodies, up to translation and reflection. This gives a partial answer to a problem posed by Matheron.

Geometric sampling, and local stereology in particular, often require observations at isotropic random directions on the sphere, and some sort of systematic design on the sphere becomes necessary on grounds of efficiency and practical applicability. Typically, the relevant probes are of nucleator type, in which several rays may be contained in a sectioning plane through a fixed point (e.g. through a nucleolus within a biological cell). The latter requirement considerably reduces the choice of design in practice; in this paper, we concentrate on a nucleator design based on splitting the sphere into regions of equal area, but not of identical shape; this design is pseudosystematic rather than systematic in a strict sense. Firstly, we obtain useful exact representations of the variance of an estimator under pseudosystematic sampling on the sphere. Then we adopt a suitable covariogram model to obtain a variance predictor from a single sample of arbitrary size, and finally we examine the prediction accuracy by way of simulation on a synthetic particle model.

Let U1,U2,… be a sequence of i.i.d. random vectors distributed uniformly in a compact plane region A of unit area. Sufficient conditions on the geometry of A are provided under which the Euclidean diameter Dn of the first n of the points converges weakly upon suitable rescaling.

The set covariance of a dead leaves model, constructed from hard spheres of constant diameter, is calculated analytically. The calculation is based on the covariance of a single sphere and on the pair correlation function of the centres of the spheres. There exist applications in the field of random sequential adsorption and in the interpretation of small-angle scattering experiments.

Among the disks centered at a typical particle of the two-dimensional Poisson-Voronoi tessellation, let Rm be the radius of the largest included within the polygonal cell associated with that particle and RM be the radius of the smallest containing that polygonal cell. In this article, we obtain the joint distribution of Rm and RM. This result is derived from the covering properties of the circle due to Stevens, Siegel and Holst. The same method works for studying the Crofton cell associated with the Poisson line process in the plane. The computation of the conditional probabilities P{RM ≥ r + s | Rm = r} reveals the circular property of the Poisson-Voronoi typical cells (as well as the Crofton cells) having a ‘large’ in-disk.

The usual direct method of simulation for cluster processes requires the generation of the parent point process over a region larger than the actual observation window, since we have to allow for all possible parents giving rise to observed daughter points, and some of these parents may fall outwith the observation window. When there is no a priori bound on the distance between parent and child then we have to take care to control approximations arising from edge effects. In this paper, we present a simulation method which requires simulation only of those parent points actually giving rise to observed daughter points, thus avoiding edge effect approximation. The idea is to replace the cluster distribution by one which is conditioned to plant at least one daughter point in the observation window, and to modify the parent process to have an inhomogeneous intensity exactly balancing the effect of the conditioning. We furthermore show how the method extends to cases involving infinitely many potential parents, for example gamma-Poisson processes and shot-noise G-Cox processes, allowing us to avoid approximation due to truncation of the parent process.

Recently, systematic sampling on the circle and the sphere has been studied by Gual-Arnau and Cruz-Orive (2000) from a design-based point of view. In this note, it is shown that their mathematical model for the covariogram is, in a model-based statistical setting, a special case of the p-order shape model suggested by Hobolth, Pedersen and Jensen (2000) and Hobolth, Kent and Dryden (2002) for planar objects without landmarks. Benefits of this observation include an alternative variance estimator, applicable in the original problem of systematic sampling. In a wider perspective, the paper contributes to the discussion concerning design-based versus model-based stereology.

We study the contribution made by three or four points to certain areas associated with a typical polygon in a Voronoi tessellation of a planar Poisson process. We obtain some new results about moments and distributions and give simple proofs of some known results. We also use Robbins' formula to obtain the first three moments of the area of a typical polygon and hence the variance of the area of the polygon covering the origin.

Generalizing Matérn's (1960) two hard-core processes, marked point processes are considered as models for systems of varying-sized, nonoverlapping convex grains. A Poisson point process is generated and grains are placed at the points. The grains are supposed to have varying sizes but the same shape as a fixed convex grain, with spheres as an important special case. The pattern is thinned so that no grains overlap. We consider the thinning probability of a ‘typical point’ under various thinning procedures, the volume fraction of the resulting system of grains, the relation between the intensity of the point processes before and after thinning, and the corresponding size distributions. The study is inspired by problems in material fatigue, where cracks are supposed to be initiated by large defects.

We propose and study a random crystalline algorithm (a discrete approximation) of the Gauss curvature flow of smooth simple closed convex curves in ℝ2 as a stepping stone to the full understanding of such phenomena as the wearing process of stones on a beach.

The main purpose of this work is to study and apply generalized contact distributions of (inhomogeneous) Boolean models Z with values in the extended convex ring. Given a convex body L ⊂ ℝd and a gauge body B ⊂ ℝd, such a generalized contact distribution is the conditional distribution of the random vector (dB(L,Z),uB(L,Z),pB(L,Z),lB(L,Z)) given that Z∩L = ∅, where Z is a Boolean model, dB(L,Z) is the distance of L from Z with respect to B, pB(L,Z) is the boundary point in L realizing this distance (if it exists uniquely), uB(L,Z) is the corresponding boundary point of B (if it exists uniquely) and lB(L,·) may be taken from a large class of locally defined functionals. In particular, we pursue the question of the extent to which the spatial density and the grain distribution underlying an inhomogeneous Boolean model Z are determined by the generalized contact distributions of Z.

What is the effect of punching holes at random in an infinite tensed membrane? When will the membrane still support tension? This problem was introduced by Connelly in connection with applications of rigidity theory to natural sciences. The answer clearly depends on the shapes and the distribution of the holes. We briefly outline a mathematical theory of tension based on graph rigidity theory and introduce a probabilistic model for this problem. We show that if the centers of the holes are distributed in ℝ2 according to a Poisson law with density λ > 0, and the shapes are i.i.d. and independent of the locations of their centers, the tension is lost on all of ℝ2 for any λ. After introducing a certain step-by-step dynamic for the loss of tension, we establish the existence of a nonrandom N = N(λ) such that N steps are almost surely enough for the loss of tension. Also, we prove that N(λ) > 2 almost surely for sufficiently small λ. The processes described in the paper are related to bootstrap and rigidity percolation.

We consider the Poisson Boolean model of percolation where the percolating shapes are convex regions. By an enhancement argument we strengthen a result of Jonasson (2000) to show that the critical intensity of percolation in two dimensions is minimized among the class of convex shapes of unit area when the percolating shapes are triangles, and, for any other shape, the critical intensity is strictly larger than this minimum value. We also obtain a partial generalization to higher dimensions. In particular, for three dimensions, the critical intensity of percolation is minimized among the class of regular polytopes of unit volume when the percolating shapes are tetrahedrons. Moreover, for any other regular polytope, the critical intensity is strictly larger than this minimum value.

Given sets C and R in d-dimensional space, take a constant intensity Poisson point process on R; the associated scan statistic S is the maximum number of Poisson points in any translate of C. As R becomes large with C fixed, bounded and open but otherwise arbitrary, the distribution of S becomes concentrated on at most two adjacent integers. A similar result holds when the underlying Poisson process is replaced by a binomial point process, and these results can be extended to a large class of nonuniform distributions. Also, similar results hold for other finite-range scanning schemes such as the clique number of a geometric graph.

Let be the mean normal measure of a stationary random set Z in the extended convex ring in ℝd. For k ∈ {1,…,d-1}, connections are shown between and the mean of . Here, the mean is understood to be with respect to the random isotropic k-dimensional linear subspace ξk and the mean normal measure of the intersection is computed in ξk. This mean to be well defined, a suitable spherical lifting must be applied to before averaging. A large class of liftings and their resulting means are discussed. In particular, a geometrically motivated lifting is presented, for which the mean of liftings of determines uniquely for any fixed k ∈ {2,…,d-1}.

In this paper, we analyse a model of a regular tree loss network that supports two types of calls: unicast calls that require unit capacity on a single link, and multicast calls that require unit capacity on every link emanating from a node. We study the behaviour of the distribution of calls in the core of a large network that has uniform unicast and multicast arrival rates. At sufficiently high multicast call arrival rates the network exhibits a ‘phase transition’, leading to unfairness due to spatial variation in the multicast blocking probabilities. We study the dependence of the phase transition on unicast arrival rates, the coordination number of the network, and the parity of the capacity of edges in the network. Numerical results suggest that the nature of phase transitions is qualitatively different when there are odd and even capacities on the links. These phenomena are seen to persist even with the introduction of nonuniform arrival rates and multihop multicast calls into the network. Finally, we also show the inadequacy of approximations such as the Erlang fixed-point approximations when multicasting is present.

Let X, X1, X2, … be a sequence of i.i.d. random closed subsets of a certain locally compact, Hausdorff and separable base space E. For a fixed normalised Borel measure μ on E, we investigate the behaviour of random variables μ(E \ (X1 ∪ ∙ ∙ ∙ ∪ Xn)) for large n. The results obtained include a description of variance asymptotics, strong law of large numbers and a central limit theorem. As an example we give an application of the developed methods for asymptotic analysis of the mean width of convex hulls generated by uniform samples from a multidimensional ball. Another example deals with unions of random balls in ℝd with centres distributed according to a spherically-symmetric heavy-tailed law.

The paper concerns a class of discounted restless bandit problems which possess an indexability property. Conservation laws yield an expression for the reward suboptimality of a general policy. These results are utilised to study the closeness to optimality of an index policy for a special class of simple and natural dual speed restless bandits for which indexability is guaranteed. The strong performance of the index policy is confirmed by a computational study.

We consider a general control problem for networks with linear dynamics which includes the special cases of scheduling in multiclass queueing networks and routeing problems. The fluid approximation of the network is used to derive new results about the optimal control for the stochastic network. The main emphasis lies on the average-cost criterion; however, the β-discounted as well as the finite-cost problems are also investigated. One of our main results states that the fluid problem provides a lower bound to the stochastic network problem. For scheduling problems in multiclass queueing networks we show the existence of an average-cost optimal decision rule, if the usual traffic conditions are satisfied. Moreover, we give under the same conditions a simple stabilizing scheduling policy. Another important issue that we address is the construction of simple asymptotically optimal decision rules. Asymptotic optimality is here seen with respect to fluid scaling. We show that every minimizer of the optimality equation is asymptotically optimal and, what is more important for practical purposes, we outline a general way to identify fluid optimal feedback rules as asymptotically optimal. Last, but not least, for routeing problems an asymptotically optimal decision rule is given explicitly, namely a so-called least-loaded-routeing rule.