arXiv Analytics

Sign in

arXiv:math/0212230 [math.PR]AbstractReferencesReviewsResources

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

Published 2002-12-17, updated 2003-09-17Version 2

We study different ways of determining the mean distance $ < r_n >$ 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 $ < r_n >$. Next we describe two alternative means of deriving the exact expression of $<r_n>$: we review the method using absolute probability and develop an alternative method using conditional probability. Finally we obtain an approximation to $ < r_n >$ from the mean volume between the reference point and its $n$-th neighbour and compare it with the heuristic and exact results.

Comments: 6 pages (REVTex4), minor changes in content, typing errors corrected, references added
Categories: math.PR, physics.data-an
Related articles: Most relevant | Search more
arXiv:2309.13177 [math.PR] (Published 2023-09-22)
Mean distance in polyhedra
arXiv:1202.0045 [math.PR] (Published 2012-01-31, updated 2015-03-10)
Shortest Path through Random Points
arXiv:2103.16430 [math.PR] (Published 2021-03-30)
Projections of the uniform distribution on the cube -- a large deviation perspective