z-logo
open-access-imgOpen Access
Efficient generation of large random networks
Author(s) -
Vladimir Batagelj,
Ulrik Brandes
Publication year - 2005
Publication title -
physical review e
Language(s) - English
Resource type - Journals
eISSN - 1550-2376
pISSN - 1539-3755
DOI - 10.1103/physreve.71.036113
Subject(s) - computer science , simple (philosophy) , random graph , complex network , theoretical computer science , graph , philosophy , epistemology , world wide web
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom