One-sided concentration conjecture for random spherical coverings

Let ϵ=ϵ(n)\epsilon=\epsilon(n) be the radius of the geodesic balls, let Nc,ϵ(n)N_{c,\epsilon(n)} be the number of independently and uniformly selected centers used for the covering, and let g(X)g(\mathbf X) be the covered surface measure. One-sided concentration conjecture. For every ϵ>0\epsilon>0,

P\originalleft(g(X)(1ec)>ϵ\aftergroup\originalright)Cec(n)Nc,ϵ(n)ϵ2,\mathbb P\mathopen{}\mathclose\bgroup\originalleft(g(\mathbf X)-(1-e^{c})>\epsilon\aftergroup\egroup\originalright)\leq C e^{-c(n)N_{c,\epsilon(n)}\epsilon^2},

where c(n)c(n)\to\infty as nn\to\infty. This is intended to sharpen the existing two-sided concentration estimate when the geodesic-ball radius is sufficiently small.

Sources & referencesView supporting material

Primary source

Steven Hoehner and Gil Kur, “A Concentration Inequality for Random Polytopes, Dirichlet-Voronoi Tiling Numbers and the Geometric Balls and Bins Problem”, arXiv:1801.00167 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.