Efficient Rare-Event Simulation for Random Geometric Graphs via Importance Sampling

Sarat Moka, Christian Hirsch, Volker Schmidt +1

Random geometric graphs defined on Euclidean subspaces, also called Gilbert graphs, are widely used to model spatially embedded networks across various domains. In such graphs, nod…