ALMOST SURE CENTRAL LIMIT THEOREMS IN STOCHASTIC GEOMETRY

We prove an almost sure central limit theorem on the Poisson space, which is perfectly tailored for stabilizing functionals arising in stochastic geometry. As a consequence, we provide almost sure central limit theorems for (i) the total edge length of the k-nearest neighbors random graph. (ii) the clique count in random geometric graphs. and (iii) the volume of the set approximation via the Poisson-Voronoi tessellation.