Fast Generation of Spatially Embedded Random Networks
Abstract
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^2)$ 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.
- Publication:
-
arXiv e-prints
- Pub Date:
- December 2015
- DOI:
- 10.48550/arXiv.1512.03532
- arXiv:
- arXiv:1512.03532
- Bibcode:
- 2015arXiv151203532P
- Keywords:
-
- Computer Science - Data Structures and Algorithms;
- Computer Science - Social and Information Networks