Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Nearest Neighbour Distance Distribution in Hard-Core Point Processes (1606.03695v1)

Published 12 Jun 2016 in cs.IT and math.IT

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.

Citations (54)

Summary

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