Efficient rare-event simulation for random geometric graphs via importance sampling

DOI10.1007/S11009-026-10273-YMaRDI QIDQ7254743zbMATH OpenFDO

Authors Sarat B. Moka, Christian Hirsch, Volker Schmidt, Dirk P. Kroese

Publication date 28 May 2026

Published in Methodology and Computing in Applied Probability (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11009-026-10273-Y

zbMATH Keywords

edge countGilbert graphhard-spheres modelmaximum degreespatial point processunbiased estimation

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Large deviations (60F10) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)

Cites work

• A large-deviations principle for all the components in a sparse inhomogeneous random graph
• A large‐deviations principle for all the cluster sizes of a sparse Erdős–Rényi graph
• Asymptotic approximations for modified Bessel functions
• Graph theory (to appear)
• Improved inequalities for the Poisson and binomial distribution and upper tail quantile functions
• Localization in random geometric graphs with too many edges
• Lower large deviations for geometric functionals
• On a coverage process ranging from the Boolean model to the Poisson-Voronoi tessellation with applications to wireless communications
• Random Geometric Graphs
• Random Networks for Communication
• Random Plane Networks
• Rare events in random geometric graphs
• Rejection- and importance-sampling-based perfect simulation for Gibbs hard-sphere models
• Scale-free graphs with many edges
• Statistical mechanics: Algorithms and computations. With CD-ROM.
• Stochastic geometry and wireless networks. Volume II. Applications
• Stochastic simulation: Algorithms and analysis
• Sur le problème des courbes gauches en topologie.
• Upper tail behavior of the number of triangles in random graphs with constant average degree

Cited in

(1)

• A new mixture model for spatiotemporal exceedances with flexible tail dependence

This page was built for publication: Efficient rare-event simulation for random geometric graphs via importance sampling

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