We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Explicit laws of large numbers for random nearest-neighbour-type graphs.

Wade, Andrew R. (2007) 'Explicit laws of large numbers for random nearest-neighbour-type graphs.', Advances in applied probability., 39 (2). pp. 326-342.


Under the unifying umbrella of a general result of Penrose and Yukich (Annals of Applied Probability 13 (2003), 277-303) we give laws of large numbers (in the Lp sense) for the total power-weighted length of several nearest-neighbour-type graphs on random point sets in ℝd, d ∈ ℕ. Some of these results are known; some are new. We give limiting constants explicitly, where previously they have been evaluated in less generality or not at all. The graphs we consider include the k-nearest-neighbours graph, the Gabriel graph, the minimal directed spanning forest, and the on-line nearest-neighbour graph.

Item Type:Article
Keywords:Nearest-neighbour-type graph, Law of large numbers, Spanning forest, Spatial network evolution.
Full text:(AM) Accepted Manuscript
Download PDF
Publisher Web site:
Date accepted:No date available
Date deposited:13 February 2013
Date of first online publication:June 2007
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar