Abstract
AbstractWe 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 thek-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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have