1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.PR2026★ 1 cited
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…
math.PR2026
The contact process on a bipartite spatial network
John Fernley, Christian Hirsch, Daniel Valesin
We study the contact process on a random bipartite connection hypergraph generated from two Poisson point processes, with mark-dependent connection thresholds. For asymmetric infec…