The size of components in continuum nearest-neighbor graphs

DOI10.1214/009117905000000729MaRDI QIDQ2496957zbMATH OpenOpenAlexFDO

Authors Iva Kozakova, Seema Nanda, Ronald Meester

Publication date 26 July 2006

Published in The Annals of Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0605640

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Abstract: We study the size of connected components of random nearest-neighbor graphs with vertex set the points of a homogeneous Poisson point process in ${mathbbR}^d$. The connectivity function is shown to decay superexponentially, and we identify the exact exponent. From this we also obtain the decay rate of the maximal number of points of a path through the origin. We define the generation number of a point in a component and establish its asymptotic distribution as the dimension $d$ tends to infinity.

Recommendations

• Connectivity of random k-nearest-neighbour graphs
• scientific article; zbMATH DE number 1222330
• Distribution of components in the \(k\)-nearest neighbour random geometric graph for \(k\) below the connectivity threshold
• Small components in \(k\)-nearest neighbour graphs
• \(k\)-nearest-neighbor clustering and percolation theory

Cites work

• scientific article; zbMATH DE number 1369838 (Why is no real title available?)
• Nearest neighbor and hard sphere models in continuum percolation
• The Kissing Numbers of Convex Bodies - A Brief Survey

Cited in

(4)

• scientific article; zbMATH DE number 5763331 (Why is no real title available?)
• Limit theorems for geometric functionals of Gibbs point processes
• On the number of reflexive and shared nearest neighbor pairs in one-dimensional uniform data
• Random nearest neighbor graphs: the translation invariant case

This page was built for publication: The size of components in continuum nearest-neighbor graphs

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