Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 71 tok/s
Gemini 2.5 Pro 54 tok/s Pro
GPT-5 Medium 22 tok/s Pro
GPT-5 High 29 tok/s Pro
GPT-4o 88 tok/s Pro
Kimi K2 138 tok/s Pro
GPT OSS 120B 446 tok/s Pro
Claude Sonnet 4.5 35 tok/s Pro
2000 character limit reached

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

Published 6 May 2016 in math.PR

Abstract: 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.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube