The Mean Distance to the n-th Neighbour in a Uniform Distribution of Random Points: An Application of Probability Theory
Pratip Bhattacharyya, Bikas K. Chakrabarti
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.
Create a lesson
Related papers
Superdiffusive Invariance Principle for the two-dimensional Asymmetric Simple Exclusion Process
Quentin Moulard
Branching explosion of Brownian Fleming-Viot systems
Yaohui Lin, Tiankui Lu
A formula for the free energy of non-convex vector spin glasses
Hong-Bin Chen, Fu-Hsuan Ho, Victor Issa
A Randomized Approximation Algorithm for Doubly Free-Boundary Macdonald Processes
Zhongyang Li
The forward-loop-erased ants walk
Wilfred Armfield, Cécile Mailler
A Central Limit Theorem for High-Temperature SYK Model
Yoshinori Kamijima, Shuta Nakajima, Ryoichiro Noda et al.