On the rate of convergence in the Hall-Janson coverage theorem
Mathew D. Penrose, Xiaochuan Yang

TL;DR
This paper establishes the rate at which the probability of full coverage in a spherical Poisson Boolean model converges to its limit as the intensity grows, improving understanding of coverage thresholds in high-dimensional spaces.
Contribution
It provides explicit bounds on the convergence rate in the Hall-Janson coverage theorem, refining previous asymptotic results with quantitative estimates.
Findings
Rate of convergence is $O(( ext{log log } t)/ ext{log } t)$
Improved rate to $O(1/ ext{log } t$ with slight adjustment
Quantitative bounds enhance understanding of coverage probabilities
Abstract
Consider a spherical Poisson Boolean model in Euclidean -space with , with Poisson intensity and radii distributed like with a scaling parameter and a fixed nonnegative random variable with finite -nd moment (or if , a finite -moment condition for some ). Let be compact with a nice boundary. Let be the expected volume of a ball of radius , and suppose is chosen so that is a constant independent of . A classical result of Hall and of Janson determines the (non-trivial) large- limit of the probability that is fully covered by . In this paper we provide an bound on the rate of convergence in that result. With a slight adjustment to , this can be improved to .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and financial applications
