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

Tight Lower Bounds on the Contact Distance Distribution in Poisson Hole Process (1705.02492v1)

Published 6 May 2017 in cs.IT and math.IT

Abstract: In this letter, we derive new lower bounds on the cumulative distribution function (CDF) of the contact distance in the Poisson Hole Process (PHP) for two cases: (i) reference point is selected uniformly at random from $\mathbb{R}2$ independently of the PHP, and (ii) reference point is located at the center of a hole selected uniformly at random from the PHP. While one can derive upper bounds on the CDF of contact distance by simply ignoring the effect of holes, deriving lower bounds is known to be relatively more challenging. As a part of our proof, we introduce a tractable way of bounding the effect of all the holes in a PHP, which can be used to study other properties of a PHP as well.

Citations (14)

Summary

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