Fast Generation of Spatially Embedded Random Networks

الأصل · EN

Spatially Embedded Random Networks such as the Waxman random graph have been used in a variety of settings for synthesizing networks. However, little thought has been put into fast generation of these networks. Existing techniques are O(n²) where n is the number of nodes in the graph. In this paper we present an O(n + e) algorithm, where e is the number of edges.