pith. sign in

arxiv: 1606.03695 · v1 · pith:L6WHFL7Dnew · submitted 2016-06-12 · 💻 cs.IT · math.IT

Nearest Neighbour Distance Distribution in Hard-Core Point Processes

classification 💻 cs.IT math.IT
keywords pointprocessnearestneighbourcasedistancedistributionhard-core
0
0 comments X
read the original abstract

In this paper we present an analytic framework for formulating the statistical distribution of the nearest neighbour distance in hard-core point processes. We apply this framework to Mat\'{e}rn hard-core point process (MHC) to derive the cumulative distribution function of the contact distance in three cases. The first case is between a point in an MHC process and its nearest neighbour from the same process. The second case is between a point in an independent Poisson point process and the nearest neighbour from an MHC process. The third case is between a point in the complement of an MHC process and its sibling MHC process. We test the analytic results against Monte-Carlo simulations to verify their consistency.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.