Let X = {Xt: t ≥ 0} be a stationary piecewise continuous Rd-valued process that moves between jumps along the integral curves of a given continuous vector field, and let S ⊂ Rd be a smooth surface. The aim of this paper is to derive a multivariate version of Rice's formula, relating the intensity of the point process of (localized) continuous crossings of S by X to the distribution of X0. Our result is illustrated by examples relating to queueing networks and stress release network models.

A stationary partition based on a stationary point process N in ℝd is an ℝd-valued random field π={π(x): x∈ℝd} such that both π(y)∈N for each y∈ℝd and the random partition {{y∈ℝd: π(y)=x}: x∈N} is stationary jointly with N. Stationary partitions may be considered as general versions of the stationary random tessellations studied in stochastic geometry. As in the special case of the Voronoi tessellation, a stationary partition can be used to relate the underlying stationary probability measure to the associated Palm probability measure of N. In doing so, we will develop some basic theory for stationary partitions and extend properties of stationary tessellations to our more general case. One basic idea is that the stationary measure is (up to a shift) a weighted version of the Palm measure, where the weight is the volume of the typical cell. We will make systematic use of a known modified probability measure. Finally, we use our approach to extend some recent results on the shift coupling of the stationary distribution and the Palm distribution.

We consider a hard-sphere model in ℝd generated by a stationary point process N and the lilypond growth protocol: at time 0, every point of N starts growing with unit speed in all directions to form a system of balls in which any particular ball ceases its growth at the instant that it collides with another ball. Some quite general conditions are given, under which it is shown that the model is well defined and exhibits no percolation. The absence of percolation is attributable to the fact that, under our assumptions, there can be no descending chains in N. The proof of this fact forms a significant part of the paper. It is also shown that, in the absence of descending chains, mutual-nearest-neighbour matching can be used to construct a bijective point map as defined by Thorisson.

In this paper we derive some of the main ergodicity properties of a class of Markov renewal processes and the associated marked point processes. This class represents a generic model of applied probability and is of importance in earthquake modeling, reliability theory and queueing.

By using an adaptation of the radial generation method, we give an integral formula for the proportion of triangles in a Poisson-Voronoi tessellation, which gives a value of 0.0112354 to 7 decimal places. We also obtain the first four moments of some characteristics of triangles.

We consider a stationary germ-grain model Ξ with convex and compact grains and the distance r(x) from x ε ℝd to Ξ. For almost all points x ε ℝd there exists a unique point p(x) in the boundary of Ξ such that r(x) is the length of the vector x-p(x), which is called the spherical contact vector at x. In this paper we relate the distribution of the spherical contact vector to the times it takes a typical boundary point of Ξ to hit another grain if all grains start growing at the same time and at the same speed. The notion of a typical point is made precise by using the generalized curvature measures of Ξ. The result generalizes a well known formula for the Boolean model. Specific examples are discussed in detail.

The object studied in this paper is a pair (Φ, Y), where Φ is a random surface in and Y a random vector field on . The pair is jointly stationary, i.e. its distribution is invariant under translations. The vector field Y is smooth outside Φ but may have discontinuities on Φ. Gauss' divergence theorem is applied to derive a flow conservation law for Y. For this specializes to a well-known rate conservation law for point processes. As an application, relationships for the linear contact distribution of Φ are derived.

In this short note we derive Sengupta's (1989) invariance relation using elementary arguments and we show that Miyazawa's (1983), (1985) conservation principle, on which Sengupta's proof is based, admits the Palm inversion formula as a consequence. This contrasts with Miyazawa's first proof based on the inversion formula. We also show that Neveu's (1976) cycle formula is a direct consequence of Miyazawa's principle.

We derive a rate conservation law for distribution densities which extends a result of Brill and Posner. Based on this conservation law, we obtain a generalized Takács equation for the G/G/m/B queueing system that only requires the existence of a stochastic intensity for the arrival process and the residual service time distribution density for the G/GI/1/B queue. Finally, we solve Takács' equation for the N/GI/1/∞ queueing system.

Theorem: A necessary and sufficient condition for the superposition of two ordinary renewal processes to again be a renewal process is that they be Poisson processes.

A complete proof of this theorem is given; also it is shown how the theorem follows from the corresponding one for the superposition of two stationary renewal processes.