Generating Simple Random Graphs with Prescribed Degree Distribution

Let F be a probability distribution with support on the non-negative integers. Four methods for generating a simple undirected graph with (approximate) degree distribution F are described and compared. Two methods are based on the so called configuration model with modifications ensuring a simple graph, one method is an extension of the classical Erdös-Rényi graph where the edge probabilities are random variables, and the last method starts with a directed random graph which is then modified to a simple undirected graph. All methods are shown to give the correct distribution in the limit of large graph size, but under different assumptions on the degree distribution F and also using different order of operations.

[1]  W. Feller,et al.  An Introduction to Probability Theory and its Applications, Vol. II , 1967 .

[2]  Edward A. Bender,et al.  The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.

[3]  Béla Bollobás,et al.  A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..

[4]  N. Wormald.  Some problems in the enumeration of labelled graphs , 1980, Bulletin of the Australian Mathematical Society.

[5]  B. Bollobás.  The evolution of random graphs , 1984 .

[6]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[7]  Béla Bollobás,et al.  Random Graphs , 1985 .

[8]  Brendan D. McKay,et al.  Uniform Generation of Random Regular Graphs of Moderate Degree , 1990, J. Algorithms.

[9]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[10]  Bruce A. Reed,et al.  The Size of the Giant Component of a Random Graph with a Given Degree Sequence , 1998, Combinatorics, Probability and Computing.

[11]  FaloutsosMichalis,et al.  On power-law relationships of the Internet topology , 1999 .

[12]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[13]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[14]  Svante Janson,et al.  Random graphs , 2000, ZOR Methods Model. Oper. Res..

[15]  L. Amaral,et al.  The web of human sexual contacts , 2001, Nature.

[16]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[18]  A. Rbnyi.  ON THE EVOLUTION OF RANDOM GRAPHS , 2001 .

[19]  B. Söderberg.  General formalism for inhomogeneous random graphs. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  F. Chung,et al.  Connected Components in Random Graphs with Given Expected Degree Sequences , 2002 .

[21]  F. Chung,et al.  The average distances in random graphs with given expected degrees , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[22]  Sergey N. Dorogovtsev,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW (Physics) , 2003 .

[23]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[24]  Albert-László Barabási,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW , 2004 .

[25]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.