The distribution of the length of a typical chord of a stationary random set is an interesting feature of the set's whole distribution. We give a nonparametric estimator of the chord length distribution and prove its strong consistency. We report on a simulation experiment in which our estimator compared favourably to a reduced sample estimator. Both estimators are illustrated by applying them to an image sample from a yoghurt ferment. We briefly discuss the closely related problem of estimation of the linear contact distribution. We show by a simulation experiment that a transformation of our estimator of the chord length distribution is more efficient than a Kaplan-Meier type estimator of the linear contact distribution.

A new statistical method for estimating the orientation distribution of fibres in a fibre process is suggested where the process is observed in the form of a degraded digital greyscale image. The method is based on line transect sampling of the image in a few fixed directions. A well-known method based on stereology is available if the intersections between the transects and fibres can be counted. We extend this to the case where, instead of the intersection points, only scaled variograms of grey levels along the transects are observed. The nonlinear estimation equations for a parametric orientation distribution as well as a numerical algorithm are given. The method is illustrated by a real-world example and simulated examples where the elliptic orientation distribution is applied. In its simplicity, the new approach is intended for industrial on-line estimation of fibre orientation in disordered fibrous materials.

A network is a system of segments or edges in ℝd which intersect only in the segment endpoints, which are called vertices. An example is the system of edges of a tessellation. It is possible to give formulas for the specific connectivity number of a random network; in the stationary case, the intensity of the 0-curvature measure is equal to the difference of the intensities of the point processes of vertices and edge centres.

The paper yields retrieval formulae of the directional distribution of a stationary k-flat process in ℝd if its rose of intersections with all r-flats is known. Cases k = d −1, 1 ≤ r ≤ d - 1 for arbitrary d and d = 4, k = 2, r = 2 are considered. Some generalizations to manifold processes in ℝd are made. The proofs use the methods of harmonic analysis on higher Grassmannians (spherical harmonics, integral transforms).

In this paper, we present the distribution of the coalescence time of two DNA sequences (or genes) subject to symmetric migration between two islands, and conditional on the observed number of segregating sites in the sequences. The distribution for the segregating-site pattern is also obtained. Some surprising results emerge when both genes are initially on the same island. First, the post-data mean coalescence time is shown to be dependent on the migration parameter, as opposed to the pre-data mean. Second, both the post-data density and expectation for the coalescence time are shown to converge, in the weak-migration limit, to the corresponding panmictic results, as opposed to the pre-data situation where there is convergence in the density but not in the expectation. Finally, it is shown that there is convergence in the weak-migration limit in the distribution of the number of segregating sites but not in the expectation and variance. Numerical and graphical results for samples of size greater than two are also presented.

Variograms and covariance functions are key tools in geostatistics. However, various properties, characterizations, and decomposition theorems have been established for covariance functions only. We present analogous results for variograms and explore the connections with covariance functions. Our findings include criteria for covariance functions on intervals, and we apply them to exponential models, fractional Brownian motion, and locally polynomial covariances. In particular, we characterize isotropic locally polynomial covariance functions of degree 3.

With the aim of providing greater flexibility in developing and applying shot noise models, this paper studies shot noise on cluster point processes with both pointwise and cluster marks. For example, in financial modelling, responses to events in the financial market may occur in clusters, with random amplitudes including a ‘cluster component’ reflecting a degree of commonness among responses within a cluster. For such shot noise models, general formulae for the characteristic functional are developed and specialized to the case of Neyman-Scott clustering with cluster marks. For several general forms of response function, long range dependence of the corresponding equilibrium shot noise models is investigated. It is shown, for example, that long range dependence holds when the ‘structure component’ of the response function decays slowly enough, or when the response function has a finite random duration with a heavy tailed distribution.

We prove a d-dimensional renewal theorem, with an estimate on the rate of convergence, for Markov random walks. This result is applied to a variety of boundary crossing problems for a Markov random walk (Xn,Sn), n ≥0, in which Xn takes values in a general state space and Sn takes values in ℝd. In particular, for the case d = 1, we use this result to derive an asymptotic formula for the variance of the first passage time when Sn exceeds a high threshold b, generalizing Smith's classical formula in the case of i.i.d. positive increments for Sn. For d > 1, we apply this result to derive an asymptotic expansion of the distribution of (XT,ST), where T = inf { n : Sn,1 > b } and Sn,1 denotes the first component of Sn.

Sharp upper and lower bounds are derived for the solution of renewal equations. These include as special cases exponential inequalities, some of which have been derived for specific renewal equations. Together with the well-known Cramér-Lundberg asymptotic estimate, these bounds give additional information about the behaviour of the solution. Nonexponential bounds, which are of use in connection with defective renewal equations, are also obtained. The results are then applied in examples involving the severity of insurance ruin, age-dependent branching processes, and a generalized type II Geiger counter.

We analyse a non-Markovian generalization of the telegrapher's random process. It consists of a stochastic process describing a motion on the real line characterized by two alternating velocities with opposite directions, where the random times separating consecutive reversals of direction perform an alternating renewal process. In the case of Erlang-distributed interrenewal times, explicit expressions of the transition densities are obtained in terms of a suitable two-index pseudo-Bessel function. Some results on the distribution of the maximum of the process are also disclosed.

The paper describes a new numerical method for the calculation of noncrossing probabilities for arbitrary boundaries by a Poisson process. We find the method to be simple in implementation, quick and efficient - it works reliably for Poisson processes of very high intensity n, up to several thousand. Hence, it can be used to detect unusual features in the finite-sample behaviour of empirical process and trace it down to very high sample sizes. It also can be used as a good approximation for noncrossing probabilities for Brownian motion and Brownian bridge, in particular when the boundaries are not regular. As a numerical example we demonstrate the divergence of normalized Kolmogorov-Smirnov statistics from their prescribed limiting distributions (Eicker (1979), Jaeshke (1979)) for quite large n in contrast to very regular behaviour of statistics of Mason (1983). For the Brownian motion case we considered square-root, Daniels' (1969) and Grooneboom's (1989) boundaries.