Generating random regular graphs quickly

被引：148
|
作者：
Steger, A [1 ]
Wormald, NC
机构：
[1] Tech Univ Munich, Inst Informat, D-80290 Munich, Germany
[2] Univ Melbourne, Dept Math & Stat, Parkville, Vic 3052, Australia
来源：
COMBINATORICS PROBABILITY & COMPUTING | 1999年 / 8卷 / 04期
关键词：
D O I：
10.1017/S0963548399003867
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We present a practical algorithm for generating random regular graphs. For all d growing as a small power of n, the d-regular graphs on n vertices are generated approximately uniformly at random, in the sense that all d-regular graphs on n vertices have in the limit the same probability as n --> infinity. The expected runtime for these ds is O(nd(2)).
引用
下载
收藏
页码：377 / 396
页数：20
相关论文
共 50 条
  • [31] THE NUMBER OF MATCHINGS IN RANDOM REGULAR GRAPHS AND BIPARTITE GRAPHS
    BOLLOBAS, B
    MCKAY, BD
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1986, 41 (01) : 80 - 91
  • [32] A sequential algorithm for generating random graphs
    Bayati, Mohsen
    Kim, Jeong Han
    Saberi, Amin
    APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2007, 4627 : 326 - +
  • [33] Generating outerplanar graphs uniformly at random
    Bodirsky, M
    Kang, M
    COMBINATORICS PROBABILITY & COMPUTING, 2006, 15 (03): : 333 - 343
  • [34] Generating random connected planar graphs
    Griffith, Daniel A.
    GEOINFORMATICA, 2018, 22 (04) : 767 - 782
  • [35] Generating random connected planar graphs
    Daniel A. Griffith
    GeoInformatica, 2018, 22 : 767 - 782
  • [36] A Sequential Algorithm for Generating Random Graphs
    Bayati, Mohsen
    Kim, Jeong Han
    Saberi, Amin
    ALGORITHMICA, 2010, 58 (04) : 860 - 910
  • [37] Random Cluster Model on Regular Graphs
    Bencs, Ferenc
    Borbenyi, Marton
    Csikvari, Peter
    COMMUNICATIONS IN MATHEMATICAL PHYSICS, 2023, 399 (01) : 203 - 248
  • [38] Random Cluster Model on Regular Graphs
    Ferenc Bencs
    Márton Borbényi
    Péter Csikvári
    Communications in Mathematical Physics, 2023, 399 : 203 - 248
  • [39] The cover time of random regular graphs
    Cooper, C
    Frieze, A
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2005, 18 (04) : 728 - 740
  • [40] Distribution of subgraphs of random regular graphs
    Gao, Zhicheng
    Wormald, N. C.
    RANDOM STRUCTURES & ALGORITHMS, 2008, 32 (01) : 38 - 48
12345