Fast Generation of Spatially Embedded Random Networks
Data Structures and Algorithms
2015-12-14 v1 Social and Information 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 where is the number of nodes in the graph. In this paper we present an algorithm, where is the number of edges.
Cite
@article{arxiv.1512.03532,
title = {Fast Generation of Spatially Embedded Random Networks},
author = {Eric Parsonage and Matthew Roughan},
journal= {arXiv preprint arXiv:1512.03532},
year = {2015}
}