Efficient generation of large random networks.

  title={Efficient generation of large random networks.},
  author={V. Batagelj and U. Brandes},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  volume={71 3 Pt 2A},
  • V. Batagelj, U. Brandes
  • Published 2005
  • Medicine, Physics
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 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… CONTINUE READING

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Centrality Estimation in Large Networks
    • 282
    • PDF
    A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks
    • 270
    • PDF
    Evaluating local community methods in networks
    • 175
    • PDF
    Efficient Generation of Networks with Given Expected Degrees
    • 62
    • Highly Influenced
    • PDF
    network: A Package for Managing Relational Data in R
    • 212
    • PDF
    Fast random graph generation
    • 51
    • Highly Influenced
    • PDF


    Publications referenced by this paper.
    • 1,904
    • PDF
    LEDA: a platform for combinatorial and geometric computing
    • 1,245
    • PDF
    Graph Drawing Software
    • 338
    • PDF
    Science 286
    • 1999
    ACM Trans. Math. Softw
      ACM Trans. Math. Softw
        ACM Transactions on Mathematical Software
        • 1990
        ACM Transactions on Mathematical Software 13
        • 1987