Fast Generation of Spatially Embedded Random Networks

Spatially Embedded Random Networks such as the Waxman random graph have been used in many settings for synthesizing networks. Prior to our work, there existed no software for generating these efficiently. Existing techniques are
$O(n^2)$
where
$n$
is the number of nodes in the network; in this paper we present an
$O(n + e)$
algorithm, where
$e$
is the number of edges.