Efficient generation of large random networks
Open Access
- 11 March 2005
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 71 (3), 036113
- https://doi.org/10.1103/physreve.71.036113
Abstract
Random networks are frequently generated, for example, to investigate the effects of model parameters on network properties or to test the performance of algorithms. Recent interest in the statistics of large-scale networks sparked a growing demand for network generators that can generate large numbers of large networks quickly. We here present simple and efficient algorithms to randomly generate networks according to the most commonly used models. Their running time and space requirement is linear in the size of the network generated, and they are easily implemented.Keywords
This publication has 8 references indexed in Scilit:
- The degree sequence of a scale‐free random graph processRandom Structures & Algorithms, 2001
- Emergence of Scaling in Random NetworksScience, 1999
- Collective dynamics of ‘small-world’ networksNature, 1998
- An Improved Algorithm for Ordered Sequential Random SamplingACM Transactions on Mathematical Software, 1990
- An efficient algorithm for sequential random samplingACM Transactions on Mathematical Software, 1987
- Development of Sampling Plans by Using Sequential (Item by Item) Selection Techniques and Digital ComputersJournal of the American Statistical Association, 1962
- Random GraphsThe Annals of Mathematical Statistics, 1959
- The Number of Components in Random Linear GraphsThe Annals of Mathematical Statistics, 1959