Efficient generation of large random networks

Vladimir Batagelj and Ulrik Brandes
Phys. Rev. E 71, 036113 – Published 11 March 2005

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.

  • Figure
  • Received 14 September 2004

DOI:https://doi.org/10.1103/PhysRevE.71.036113

©2005 American Physical Society

Authors & Affiliations

Vladimir Batagelj*

  • Department of Mathematics, University of Ljubljana, Slovenia

Ulrik Brandes

  • Department of Computer & Information Science, University of Konstanz, Germany

  • *Email address: vladimir.batagelj@uni-lj.si
  • Corresponding author. Email address: ulrik.brandes@uni-konstanz.de

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 71, Iss. 3 — March 2005

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×