Let be a Poisson process of intensity one in the infinite plane ℝ2. We surround each point x of by the open disc of radius r centred at x. Now let Sn be a fixed disc of area n, and let Cr(Sn) be the set of discs which intersect Sn. Write Erk for the event that Cr(Sn) is a k-cover of Sn, and Frk for the event that Cr(Sn) may be partitioned into k disjoint single covers of Sn. We prove that P(Erk ∖ Frk) ≤ ck / logn, and that this result is best possible. We also give improved estimates for P(Erk). Finally, we study the obstructions to k-partitionability in more detail. As part of this study, we prove a classification theorem for (deterministic) covers of ℝ2 with half-planes that cannot be partitioned into two single covers.

The point process of vertices of an iteration infinitely divisible or, more specifically, of an iteration stable random tessellation in the Euclidean plane is considered. We explicitly determine its covariance measure and its pair-correlation function, as well as the cross-covariance measure and the cross-correlation function of the vertex point process and the random length measure in the general nonstationary regime. We also give special formulae in the stationary and isotropic setting. Exact formulae are given for vertex count variances in compact and convex sampling windows, and asymptotic relations are derived. Our results are then compared with those for a Poisson line tessellation having the same length density parameter. Moreover, a functional central limit theorem for the joint process of suitably rescaled total edge counts and edge lengths is established with the process (ξ, tξ), t > 0, arising in the limit, where ξ is a centered Gaussian variable with explicitly known variance.

Studying the geometry generated by Gaussian and Gaussian-related random fields via their excursion sets is now a well-developed and well-understood subject. The purely non-Gaussian scenario has, however, not been studied at all. In this paper we look at three classes of stable random fields, and obtain asymptotic formulae for the mean values of various geometric characteristics of their excursion sets over high levels. While the formulae are asymptotic, they contain enough information to show that not only do stable random fields exhibit geometric behaviour very different from that of Gaussian fields, but they also differ significantly among themselves.

We investigate the degree sequence of the geometric preferential attachment model of Flaxman, Frieze and Vera (2006), (2007) in the case where the self-loop parameter α is set to 0. We show that, given certain conditions on the attractiveness function F, the degree sequence converges to the same sequence as found for standard preferential attachment in Bollobás et al. (2001). We also apply our method to the extended model introduced in van der Esker (2008) which allows for an initial attractiveness term, proving similar results.

Let K be a d-dimensional convex body with a twice continuously differentiable boundary and everywhere positive Gauss-Kronecker curvature. Denote by Kn the convex hull of n points chosen randomly and independently from K according to the uniform distribution. Matching lower and upper bounds are obtained for the orders of magnitude of the variances of the sth intrinsic volumes Vs(Kn) of Kn for s ∈ {1,…,d}. Furthermore, strong laws of large numbers are proved for the intrinsic volumes of Kn. The essential tools are the economic cap covering theorem of Bárány and Larman, and the Efron-Stein jackknife inequality.

We consider spatial stochastic models, which can be applied to, e.g. telecommunication networks with two hierarchy levels. In particular, we consider Cox processes XL and XH concentrated on the edge set T(1) of a random tessellation T, where the points XL,n and XH,n of XL and XH can describe the locations of low-level and high-level network components, respectively, and T(1) the underlying infrastructure of the network, such as road systems, railways, etc. Furthermore, each point XL,n of XL is marked with the shortest path along the edges of T to the nearest (in the Euclidean sense) point of XH. We investigate the typical shortest path length C* of the resulting marked point process, which is an important characteristic in, e.g. performance analysis and planning of telecommunication networks. In particular, we show that the distribution of C* converges to simple parametric limit distributions if a scaling factor κ converges to 0 or ∞. This can be used to approximate the density of C* by analytical formulae for a wide range of κ.

We present new ideas about the type of random tessellation which evolves through successive division of its cells. These ideas are developed in an intuitive way, with many pictures and only a modicum of mathematical formalism–so that the wide application of the ideas is clearly apparent to all readers. A vast number of new tessellation models, with known probability distribution for the volume of the typical cell, follow from the concepts in this paper. There are other interesting models for which results are not presented (or presented only through simulation methods), but these models have illustrative value. A large agenda of further research is opened up by the ideas in this paper.

In this paper we focus on the asymptotic properties of the sequence of convex hulls which arise as a result of a peeling procedure applied to the convex hull generated by a Poisson point process. Processes of the considered type are tightly connected with empirical point processes and stable random vectors. Results are given about the limit shape of the convex hulls in the case of a discrete spectral measure. We give some numerical experiments to illustrate the peeling procedure for a larger class of Poisson point processes.

This paper deals with continuous-time Markov decision processes in Polish spaces, under the discounted and average cost criteria. All underlying Markov processes are determined by given transition rates which are allowed to be unbounded, and the costs are assumed to be bounded below. By introducing an occupation measure of a randomized Markov policy and analyzing properties of occupation measures, we first show that the family of all randomized stationary policies is ‘sufficient’ within the class of all randomized Markov policies. Then, under the semicontinuity and compactness conditions, we prove the existence of a discounted cost optimal stationary policy by providing a value iteration technique. Moreover, by developing a new average cost, minimum nonnegative solution method, we prove the existence of an average cost optimal stationary policy under some reasonably mild conditions. Finally, we use some examples to illustrate applications of our results. Except that the costs are assumed to be bounded below, the conditions for the existence of discounted cost (or average cost) optimal policies are much weaker than those in the previous literature, and the minimum nonnegative solution approach is new.

Using the geometry of the Kendall shape space, in this paper we study the shape, as well as the size-and-shape, of the projection of a configuration after it has been rotated and, when the given configuration lies in a Euclidean space of an arbitrary dimension, we obtain expressions for the induced distributions of such shapes when the rotation is uniformly distributed.

In this paper we present formulae for contact distributions of a Voronoi tessellation generated by a homogeneous Poisson point process in the d-dimensional Euclidean space. Expressions are given for the probability density functions and moments of the linear and spherical contact distributions. They are double and simple integral formulae, which are tractable for numerical evaluation and for large d. The special cases d = 2 and d = 3 are investigated in detail, while, for d = 3, the moments of the spherical contact distribution function are expressed by standard functions. Also, the closely related chord length distribution functions are considered.

Consider independent fair coin flips at each site of the lattice ℤd. A translation-equivariant matching rule is a perfect matching of heads to tails that commutes with translations of ℤd and is given by a deterministic function of the coin flips. Let ZΦ be the distance from the origin to its partner, under the translation-equivariant matching rule Φ. Holroyd and Peres (2005) asked, what is the optimal tail behaviour of ZΦ for translation-equivariant perfect matching rules? We prove that, for every d ≥ 2, there exists a translation-equivariant perfect matching rule Φ such that EZΦ2/3-ε < ∞ for every ε > 0.

In this paper we describe methods for randomly thinning certain classes of spatial point processes. In the case of a Markov point process, the proposed method involves a dependent thinning of a spatial birth-and-death process, where clans of ancestors associated with the original points are identified, and where we simulate backwards and forwards in order to obtain the thinned process. In the case of a Cox process, a simple independent thinning technique is proposed. In both cases, the thinning results in a Poisson process if and only if the true Papangelou conditional intensity is used, and, thus, can be used as a graphical exploratory tool for inspecting the goodness-of-fit of a spatial point process model. Several examples, including clustered and inhibitive point processes, are considered.

In this paper we generalize a bounded Markov process, described by Stoyanov and Pacheco-González for a class of transition probability functions. A recursive integral equation for the probability density of these bounded Markov processes is derived and the stationary probability density is obtained by solving an equivalent differential equation. Examples of stationary densities for different transition probability functions are given and an application for designing a robotic coverage algorithm with specific emphasis on particular regions is discussed.

Let n points be placed independently in d-dimensional space according to the density f(x) = Ade−λ||x||α, λ, α > 0, x ∈ ℝd, d ≥ 2. Let dn be the longest edge length of the nearest-neighbor graph on these points. We show that (λ−1 log n)1−1/α dn - bn converges weakly to the Gumbel distribution, where bn ∼ ((d − 1)/λα) log log n. We also prove the following strong law for the normalized nearest-neighbor distance d̃n = (λ−1 log n)1−1/α dn/ log log n: (d − 1)/αλ ≤ lim infn→∞d̃n ≤ lim supn→∞d̃n ≤ d/αλ almost surely. Thus, the exponential rate of decay α = 1 is critical, in the sense that, for α > 1, dn → 0, whereas, for α ≤ 1, dn → ∞ almost surely as n → ∞.