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

DOI10.1239/AAP/1183667613MaRDI QIDQ3590741zbMATH OpenOpenAlexFDO

Authors Andrew R. Wade

Publication date 3 September 2007

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

Full work available at URL https://arxiv.org/abs/math/0603559, https://projecteuclid.org/euclid.aap/1183667613

zbMATH Keywords

law of large numbersspanning forestnearest-neighbour-type graphspatial network evolution

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) (L^p)-limit theorems (60F25)

Abstract: Under the unifying umbrella of a general result of Penrose & Yukich [Ann. Appl. Probab., (2003) 13, 277--303] we give laws of large numbers (in the $L^p$ sense) for the total power-weighted length of several nearest-neighbour type graphs on random point sets in $R^d$, $dinN$. 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.

Recommendations

• Asymptotic theory for the multidimensional random on-line nearest-neighbour graph
• Limit theory for the random on‐line nearest‐neighbor graph
• Weak laws of large numbers in geometric probability
• A strong law of large numbers for random biased connected graphs
• The law of the iterated logarithm for the total length of the nearest neighbor graph

Cites work

• 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 3273551 (Why is no real title available?)
• scientific article; zbMATH DE number 3410828 (Why is no real title available?)
• scientific article; zbMATH DE number 964350 (Why is no real title available?)
• A proof of the Gamma test
• Almost sure convergence of certain slowly changing symmetric one- and multi-sample statistics
• Asymptotic moments of near–neighbour distance distributions
• Central limit theorems for some graphs in computational geometry.
• GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING
• Graph-theoretic measures of multivariate association and prediction
• Graph-theoretic procedures for dimension identification
• Multivariate spatial central limit theorems with applications to percolation and spatial graphs
• On a random directed spanning tree
• On central limit theorems in geometrical probability
• On the Distribution of the Number of Admissible Points in a Vector Random Sample
• On the fraction of random points by specified nearest-neighbour interrelations and degree of attraction
• On the homogeneous planar Poisson point process
• 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
• Scaling universalities of \(k\)th-nearest neighbor distances on closed manifolds
• Sums of functions of nearest neighbor distances, moment bounds, limit theorems and a goodness of fit test
• The central limit theorem for weighted minimal spanning trees on random points
• Weak laws of large numbers in geometric probability

Cited in

(24)

• A boundary corrected expansion of the moments of nearest neighbor distributions
• Normal approximation for statistics of Gibbsian input in geometric probability
• A strong law of large numbers for random biased connected graphs
• Multivariate normal approximation in geometric probability
• Laws of large numbers in stochastic geometry with statistical applications
• Quantitative two-scale stabilization on the Poisson space
• Multivariate goodness-of-fit on flat and curved spaces via nearest neighbor distances
• Asymptotics for Euclidean functionals of mixing processes
• Random nearest neighbor graphs: the translation invariant case
• On the number of weakly connected subdigraphs in random \(k\)NN digraphs
• Asymptotic theory for the multidimensional random on-line nearest-neighbour graph
• Limit theory for point processes in manifolds
• Mutual and shared neighbor probabilities: finite- and infinite-dimensional results
• Law of the iterated logarithm for random graphs
• Strong law of large numbers on graphs and groups
• Limit theory for the random on‐line nearest‐neighbor graph
• Criticality of the exponential rate of decay for the largest nearest-neighbor link in random geometric graphs
• Limit theorems for random spatial drainage networks
• A detailed investigation into near degenerate exponential random graphs
• The law of the iterated logarithm for the total length of the nearest neighbor graph
• scientific article; zbMATH DE number 5252621 (Why is no real title available?)
• Upper large deviations for power-weighted edge lengths in spatial random networks
• A law of large numbers for nearest neighbour statistics
• Strong laws for Euclidean graphs with general edge weights

This page was built for publication: Explicit laws of large numbers for random nearest-neighbour-type graphs

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