Random Euclidean coverage from within

From MaRDI portal



Abstract: Let X1,X2,ldots be independent random uniform points in a bounded domain AsubsetmathbbRd 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,ldots,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 |partialA|, if d=3 then Pr[npiRn3−logn−2log(logn)leqx] converges to exp(−2−4pi5/3|partialA|e−2x/3) and (npiRn3)/(logn)o1 almost surely, and if d=2 then Pr[npiRn2−logn−log(logn)leqx] converges to exp(−e−x−|partialA|pi−1/2e−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.














This page was built for publication: Random Euclidean coverage from within

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6358385)