Limit theorems for random spatial drainage networks

DOI10.1239/AAP/1282924058MaRDI QIDQ3059691zbMATH OpenOpenAlexFDO

Authors Mathew D. Penrose, Andrew R. Wade

Publication date 26 November 2010

Published in Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0901.3297

zbMATH Keywords

phase transitionrandom spatial graphspanning treeweak convergence

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Geometric probability and stochastic geometry (60D05) Central limit and other weak theorems (60F05) (L^p)-limit theorems (60F25) Stochastic network models in operations research (90B15)

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 $R^d$, $dgeq2$. 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.

Recommendations

• Random oriented trees: a model of drainage networks.
• Random directed trees and forest -- drainage networks with dependence
• Random minimal directed spanning trees and Dickman-type distributions
• scientific article; zbMATH DE number 5722222
• On the total length of the random minimal directed spanning tree

Cites work

• A fixed point theorem for distributions
• A general limit theorem for recursive algorithms and combinatorial structures
• A survey of max-type recursive distributional equations
• An Efron-Stein inequality for nonsymmetric statistics
• Asymptotic theory for the multidimensional random on-line nearest-neighbour graph
• Central limit theorems for some graphs in computational geometry.
• Explicit laws of large numbers for random nearest-neighbour-type graphs
• Gaussian limits for random geometric measures
• scientific article; zbMATH DE number 5702692 (Why is no real title available?)
• scientific article; zbMATH DE number 5722222 (Why is no real title available?)
• scientific article; zbMATH DE number 48363 (Why is no real title available?)
• scientific article; zbMATH DE number 1277441 (Why is no real title available?)
• scientific article; zbMATH DE number 2038750 (Why is no real title available?)
• scientific article; zbMATH DE number 227027 (Why is no real title available?)
• scientific article; zbMATH DE number 964350 (Why is no real title available?)
• Laws of large numbers in stochastic geometry with statistical applications
• Limit theory for the random on‐line nearest‐neighbor graph
• Multivariate spatial central limit theorems with applications to percolation and spatial graphs
• On a Class of Problems Related to the Random Division of an Interval
• On a random directed spanning tree
• On central limit theorems in geometrical probability
• On the total length of the random minimal directed spanning tree
• Probability theory of classical Euclidean optimization problems
• Random Geometric Graphs
• Random minimal directed spanning trees and Dickman-type distributions
• Random oriented trees: a model of drainage networks.
• Rooted edges of a minimal directed spanning tree on random points
• The central limit theorem for weighted minimal spanning trees on random points
• The radial spanning tree of a Poisson point process
• Weak laws of large numbers in geometric probability

Cited in

(14)

• Random directed trees and forest -- drainage networks with dependence
• Random oriented trees: a model of drainage networks.
• Transmission and navigation on disordered lattice networks, directed spanning forests and Brownian web
• A drainage network with dependence and the Brownian web
• Hack's law in a drainage network model: a Brownian web approach
• scientific article; zbMATH DE number 6500496 (Why is no real title available?)
• Convergence to the Brownian web for a generalization of the drainage network model
• On a random directed spanning tree
• Traffic flow densities in large transport networks
• Semi-Infinite Paths of the Two-Dimensional Radial Spanning Tree
• The Dickman–Goncharov distribution
• Gaussian approximation for rooted edges in a random minimal directed spanning tree
• Upper large deviations for power-weighted edge lengths in spatial random networks
• On the convergence of the drainage network with branching

This page was built for publication: Limit theorems for random spatial drainage networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3059691)