The Mean Distance to the n-th Neighbour in a Uniform Distribution of Random Points: An Application of Probability Theory
Abstract
We study different ways of determining the mean distance < rn > between a reference point and its n-th neighbour among random points distributed with uniform density in a D-dimensional Euclidean space. First we present a heuristic method; though this method provides only a crude mathematical result, it shows a simple way of estimating < rn >. Next we describe two alternative means of deriving the exact expression of <rn>: we review the method using absolute probability and develop an alternative method using conditional probability. Finally we obtain an approximation to < rn > from the mean volume between the reference point and its n-th neighbour and compare it with the heuristic and exact results.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.