A Strong Law for the Largest Nearest-Neighbour Link between Random Points

DOI10.1112/S0024610799008157zbMath0955.60009MaRDI QIDQ4487496

Mathew D. Penrose

Publication date: 22 June 2000

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

nearest-neighbour graphindependent random points

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Extreme value theory; extremal stochastic processes (60G70) Strong limit theorems (60F15)

Related Items

Local convex hull support and boundary estimation, Degree distribution of the FKP network model, Convergence rates for estimators of geodesic distances and Frèchet expectations, The connectivity threshold of random geometric graphs with Cantor distributed vertices, Nonuniform random geometric graphs with location-dependent radii, Tie the straps: uniform bootstrap confidence bands for semiparametric additive models, Percolation on random Johnson-Mehl tessellations and related models, When does the union of random spherical caps become connected?, New instability results for high-dimensional nearest neighbor search, Criticality of the exponential rate of decay for the largest nearest-neighbor link in random geometric graphs, Instability results for Euclidean distance, nearest neighbor search on high dimensional Gaussian data, A strong law for the longest edge of the minimal spanning tree, Convergence rate for the \(\lambda \)-medial-axis estimation under regularity conditions