Efficient generation of large random networks

被引:155
作者
Batagelj, V
Brandes, U [1 ]
机构
[1] Univ Konstanz, Dept Comp & Informat Sci, D-7750 Constance, Germany
[2] Univ Ljubljana, Dept Math, Ljubljana 61000, Slovenia
关键词
D O I
10.1103/PhysRevE.71.036113
中图分类号
O35 [流体力学]; O53 [等离子体物理学];
学科分类号
070204 ; 080103 ; 080704 ;
摘要
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.
引用
收藏
页数:5
相关论文
共 14 条
  • [1] THE NUMBER OF COMPONENTS IN RANDOM LINEAR GRAPHS
    AUSTIN, TL
    FAGEN, RE
    PENNEY, WF
    RIORDAN, J
    [J]. ANNALS OF MATHEMATICAL STATISTICS, 1959, 30 (03): : 747 - 754
  • [2] Emergence of scaling in random networks
    Barabási, AL
    Albert, R
    [J]. SCIENCE, 1999, 286 (5439) : 509 - 512
  • [3] Batagelj V, 2004, MATH VIS, P77
  • [4] The degree sequence of a scale-free random graph process
    Bollobás, B
    Riordan, O
    Spencer, J
    Tusnády, G
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2001, 18 (03) : 279 - 290
  • [5] Erdos P., 1959, PUBL MATH-DEBRECEN, V6, P290, DOI [10.5486/PMD.1959.6.3-4.12, DOI 10.5486/PMD.1959.6.3-4.12]
  • [6] Faloutsos M, 1999, COMP COMM R, V29, P251, DOI 10.1145/316194.316229
  • [7] DEVELOPMENT OF SAMPLING PLANS BY USING SEQUENTIAL (ITEM BY ITEM) SELECTION TECHNIQUES AND DIGITAL-COMPUTERS
    FAN, CT
    MULLER, ME
    REZUCHA, I
    [J]. JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1962, 57 (298) : 387 - &
  • [8] FISHER R. A., 1938, Statistical tables for biological, agricultural and medical research.
  • [9] RANDOM GRAPHS
    GILBERT, EN
    [J]. ANNALS OF MATHEMATICAL STATISTICS, 1959, 30 (04): : 1141 - 1144
  • [10] Mehlhorn Kurt, 1999, LEDA: A Platform for Combinatorial and Geometric Computing