Limit theorems for random spatial drainage networks
From MaRDI portal
Publication:3059691
DOI10.1239/aap/1282924058zbMath1208.60010arXiv0901.3297OpenAlexW2122035815MaRDI QIDQ3059691
Andrew R. Wade, Mathew D. Penrose
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
Geometric probability and stochastic geometry (60D05) Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) (L^p)-limit theorems (60F25)
Related Items (3)
Gaussian approximation for rooted edges in a random minimal directed spanning tree ⋮ Traffic flow densities in large transport networks ⋮ The Dickman–Goncharov distribution
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of max-type recursive distributional equations
- Asymptotic theory for the multidimensional random on-line nearest-neighbour graph
- An Efron-Stein inequality for nonsymmetric statistics
- A fixed point theorem for distributions
- On central limit theorems in geometrical probability
- Probability theory of classical Euclidean optimization problems
- A general limit theorem for recursive algorithms and combinatorial structures
- The central limit theorem for weighted minimal spanning trees on random points
- Weak laws of large numbers in geometric probability
- Central limit theorems for some graphs in computational geometry.
- Random oriented trees: a model of drainage networks.
- Gaussian limits for random geometric measures
- The radial spanning tree of a Poisson point process
- Laws of large numbers in stochastic geometry with statistical applications
- Multivariate spatial central limit theorems with applications to percolation and spatial graphs
- Explicit laws of large numbers for random nearest-neighbour-type graphs
- Random Geometric Graphs
- On a random directed spanning tree
- Random minimal directed spanning trees and Dickman-type distributions
- Limit theory for the random on‐line nearest‐neighbor graph
- Rooted edges of a minimal directed spanning tree on random points
- On the total length of the random minimal directed spanning tree
- On a Class of Problems Related to the Random Division of an Interval
This page was built for publication: Limit theorems for random spatial drainage networks
