On the Number of Reflexive and Shared Nearest Neighbor Pairs in One-Dimensional Uniform Data

Abstract

For a random sample of points in 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 Rn and Qn, respectively. We derive the exact forms of the expected value and the variance for both Rn and Qn, and derive a recurrence relation for Rn which may also be used to compute the exact probability mass function of Rn. Our approach is a novel method for finding the pmf of Rn and agrees with the results in literature. We also present SLLN and CLT results for both Rn and Qn as n goes to infinity.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…