On the Number of Weakly Connected Subdigraphs in Random kNN Digraphs

Abstract

In a digraph with $n$ vertices, a minuscule construct is a subdigraph with $m<<n$ vertices. We study the number of copies of a minuscule constructs in $k$ nearest neighbor ($k$NN) digraph of the data from a random point process in $\mathbb{R}^d$. Based on the asymptotic theory for functionals of point sets under homogeneous Poisson process and binomial point process, we provide a general result for the asymptotic behavior of the number of minuscule constructs and as corollaries, we obtain asymptotic results for the number of vertices with fixed indegree, the number of shared $k$NN pairs and the number of reflexive $k$NN's in a $k$NN digraph.