Limit theorems for random spatial drainage networks

Abstract

Suppose that under the action of gravity, liquid drains through the unit $d$-cube via a minimal-length network of channels constrained to pass through random sites and to flow with nonnegative component in one of the canonical orthogonal basis directions of ${\mathbb{R}}^d$, $d\ge 2$. The resulting network is a version of the so-called minimal directed spanning tree. We give laws of large numbers and convergence in distribution results on the large-sample asymptotic behaviour of the total power-weighted edge-length of the network on uniform random points in $(0,1{)}^d$. The distributional results exhibit a weight-dependent phase transition between Gaussian and boundary-effect-derived distributions. These boundary contributions are characterized in terms of limits of the so-called on-line nearest-neighbour graph, a natural model of spatial network evolution, for which we also present some new results. Also, we give a convergence in distribution result for the length of the longest edge in the drainage network; when $d=2$, the limit is expressed in terms of Dickman-type variables.

33 pages, 1 colour figure

References in corpus (10)

• A survey of max-type recursive distributional equations
• Laws of large numbers in stochastic geometry with statistical applications
• The radial spanning tree of a Poisson point process
• Weighted Scale-free Networks in Euclidean Space Using Local Selection Rule
• Random oriented Trees: a Model of drainage networks
• Asymptotic theory for the multidimensional random on-line nearest-neighbour graph
• Limit theory for the random on-line nearest-neighbour graph
• Scale-free network on a vertical plane
• Multivariate normal approximation in geometric probability
• Convergence of random measures in geometric probability

Cited by in corpus (1)

• New perspective on sampling-based motion planning via random geometric graphs