Central limit theorems for \(k\)-nearest neighbour distances

DOI10.1016/S0304-4149(99)00080-0zbMath0997.60014WikidataQ127644718 ScholiaQ127644718MaRDI QIDQ1613596

Mathew D. Penrose

Publication date: 29 August 2002

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

zbMATH Keywords

Gaussian processempirical processesdependency graphnearest neighbours

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Order statistics; empirical distribution functions (62G30) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)

Related Items (8)

Limit behaviors of random connected graphs driven by a Poisson process ⋮ A strong law of large numbers for random biased connected graphs ⋮ Large deviations for the volume of \(k\)-nearest neighbor balls ⋮ A law of large numbers for nearest neighbour statistics ⋮ A class of Rényi information estimators for multidimensional densities ⋮ Extremes on trees ⋮ Nearest-neighbor graphs on the cantor set ⋮ Functional limit theorems for the euler characteristic process in the critical regime

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On normal approximations of distributions in terms of dependency graphs
• Goodness of fit problem and scanning innovation martingales
• Asymptotic efficiencies of spacings tests for goodness of fit
• Goodness of fit testing in \(R^ m \)based on the weighted empirical distribution of certain nearest neighbor statistics
• On powerful distributional tests based on sample spacings
• An innovation approach to goodness-of-fit tests in \(R^ m\)
• Sums of functions of nearest neighbor distances, moment bounds, limit theorems and a goodness of fit test
• Multivariate k-nearest neighbor density estimates
• On central limit theorems in geometrical probability
• The longest edge of the random minimal spanning tree
• The central limit theorem for Euclidean minimal spanning trees. I
• Goodness of fit in multidimensions based on nearest neighbour distances
• On the fraction of random points by specified nearest-neighbour interrelations and degree of attraction
• Asymptotic Behaviour of an Empirical Nearest-Neighbour Distance Function for Stationary Poisson Cluster Processes
• Some Useful Functions for Functional Limit Theorems
• Nearest-Neighbor Clutter Removal for Estimating Features in Spatial Point Processes
• The Maximum Vertex Degree of a Graph on Uniform Points in [0, 1^d]
• A Multidimensional Goodness-of-Fit Test Based on Interpoint Distances
• On the connectivity of a random interval graph
• The Central Limit Theorem for a Sequence of Random Variables with a Slowly Growing Number of Dependences

This page was built for publication: Central limit theorems for \(k\)-nearest neighbour distances