Bounds on the mean power-weighted nearest neighbour distance

DOI10.1098/RSPA.2007.0234MaRDI QIDQ3560320zbMATH OpenOpenAlexFDO

Authors Elia Liitiäinen, Amaury Lendasse, Francesco Corona

Publication date 19 May 2010

Published in Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1098/rspa.2007.0234

zbMATH Keywords

boundsrandom graphsnearest neighbour distances

Mathematics Subject Classification ID

Asymptotic distribution theory in statistics (62E20) Inequalities; stochastic orderings (60E15)

Recommendations

• Asymptotic moments of near–neighbour distance distributions
• Limit distributions of extremal distances to the nearest neighbor
• Limit theory for the random on‐line nearest‐neighbor graph
• On nearest-neighbor graphs
• On nearest-neighbor graphs

Cites work

• A proof of the Gamma test
• Asymptotic moments of near–neighbour distance distributions
• Rates of convergence for partitioning and nearest neighbor regression estimates with unbounded data
• Rates of convergence of nearest neighbor estimation under arbitrary sampling
• Weak laws of large numbers in geometric probability

Cited in

(5)

• Partitioning estimation of local variance based on nearest neighbors under censoring
• Reweighting samples under covariate shift using a Wasserstein distance criterion
• A boundary corrected expansion of the moments of nearest neighbor distributions
• New instability results for high-dimensional nearest neighbor search
• Balancing geometry and density: path distances on high-dimensional data

This page was built for publication: Bounds on the mean power-weighted nearest neighbour distance

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