Almost sure central limit theorems in stochastic geometry

From MaRDI portal



Abstract: We prove an almost sure central limit theorem on the Poisson space, which is perfectly tailored for stabilizing functionals emerging 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, (iii) the volume of the set approximation via the Poisson-Voronoi tessellation.












This page was built for publication: Almost sure central limit theorems in stochastic geometry

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