一维均匀数据中自反和共享最近邻对的个数
On the Number of Reflexive and Shared Nearest Neighbor Pairs in One-Dimensional Uniform Data
摘要:
对于$\mathbb{R}$中的点的随机样本,我们考虑其成员是彼此最近邻居(NN)的对的数量和共享公共NN的对的数量。第一种类型的对被称为自反NN,而后一种类型的对被称为共享NN。在这篇文章中,我们考虑的情况下,大小为$n$的随机样本是从一个区间上的均匀分布。我们将样本中自反NN对的数量和共享NN对的数量分别表示为$R_n$和$Q_n$。我们导出了$R_n$和$Q_n$的期望值和方差的精确形式,并导出了$R_n$的一个递推关系,它也可以用来计算$R_n$的精确概率质量函数.我们的方法是一个新的方法来寻找的pmf的$R_n$和文献中的结果一致。我们还介绍了$R_n$和$Q_n$的SLLN和CLT结果,因为$n$趋于无穷大。
英文摘要:
For a random sample of points in $\mathbb{R}$, we consider the number of pairs whose members are nearest neighbors (NN) to each other and the number of pairs sharing a common NN. The first type of pairs are called reflexive NNs whereas latter type of pairs are called shared NNs. In this article, we consider the case where the random sample of size $n$ is from the uniform distribution on an interval. We denote the number of reflexive NN pairs and the number of shared NN pairs in the sample as $R_n$ and $Q_n$, respectively. We derive the exact forms of the expected value and the variance for both $R_n$ and $Q_n$, and derive a recurrence relation for $R_n$ which may also be used to compute the exact probability mass function of $R_n$. Our approach is a novel method for finding the pmf of $R_n$ and agrees with the results in literature. We also present SLLN and CLT results for both $R_n$ and $Q_n$ as $n$ goes to infinity.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。