Random Euclidean coverage from within

Abstract

Let X1,X2, … be independent random uniform points in a bounded domain A ⊂ Rd with smooth boundary. Define the coverage threshold Rn to be the smallest r such that A is covered by the balls of radius r centred on X1,…,Xn. We obtain the limiting distribution of Rn and also a strong law of large numbers for Rn in the large-n limit. For example, if A has volume 1 and perimeter |∂ A|, if d=3 then [nπ Rn3 - n - 2 ( n) ≤ x] converges to (-2-4π5/3 |∂ A| e-2 x/3) and (n π Rn3)/( n) 1 almost surely, and if d=2 then [n π Rn2 - n - ( n) ≤ x] converges to (- e-x- |∂ A|π-1/2 e-x/2). We give similar results for general d, and also for the case where A is a polytope. We also generalize to allow for multiple coverage. The analysis relies on classical results by Hall and by Janson, along with a careful treatment of boundary effects. For the strong laws of large numbers, we can relax the requirement that the underlying density on A be uniform.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…