Central Limit Theorem for the Crossing Number of a Random Geometric Graph
Conference
65th ISI World Statistics Congress 2025
Format: IPS Abstract - WSC 2025
Keywords: complex_networks
Session: IPS 853 - Stein's Method and Stochastic Geometry
Monday 6 October 10:50 a.m. - 12:30 p.m. (Europe/Amsterdam)
Abstract
To compare the crossing number of real world networks with the number of edge intersections in the projection of a random geometric graph, we apply the Malliavin-Stein method and prove a central limit theorem together with a rate of convergence in the thermodynamic regime. In the sparse regime we will show a Poisson limit.