Efficient Generation of Networks with Given Expected Degrees

We present an efficient algorithm to generate random graphs with a given sequence of expected degrees. Existing algorithms run in O(N2) time where N is the number of nodes. We prove that our algorithm runs in O(N +M) expected time where M is the expected number of edges. If the expected degrees are chosen from a distribution with finite mean, this is O(N) as N → ∞.

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

[2]  Andrei Z. Broder,et al.  Graph structure in the Web , 2000, Comput. Networks.

[3]  Aravind Srinivasan,et al.  Structural and algorithmic aspects of massive social networks , 2004, SODA '04.

[4]  Ulrik Brandes,et al.  Efficient generation of large random networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  B. Bollobás,et al.  The phase transition in inhomogeneous random graphs , 2007 .

[6]  Fan Chung Graham,et al.  The Average Distance in a Random Graph with Given Expected Degrees , 2004, Internet Math..

[7]  Ayalvadi J. Ganesh,et al.  A random walk model for infection on graphs: spread of epidemics & rumours with mobile agents , 2010, Discret. Event Dyn. Syst..

[8]  A. Martin-Löf,et al.  Generating Simple Random Graphs with Prescribed Degree Distribution , 2006, 1509.06985.

[9]  M. Keeling,et al.  Networks and epidemic models , 2005, Journal of The Royal Society Interface.

[10]  Kevin E. Bassler,et al.  Efficient and Exact Sampling of Simple Graphs with Given Arbitrary Degree Sequence , 2010, PloS one.

[11]  Ilkka Norros,et al.  On a conditionally Poissonian graph process , 2006, Advances in Applied Probability.

[12]  Fan Chung Graham,et al.  The Volume of the Giant Component of a Random Graph with Given Expected Degrees , 2006, SIAM J. Discret. Math..

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

[14]  F. Chung,et al.  Spectra of random graphs with given expected degrees , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[15]  S. D. Chatterji.  Proceedings of the International Congress of Mathematicians , 1995 .

[16]  Remco van der Hofstad,et al.  Critical behavior in inhomogeneous random graphs , 2009, Random Struct. Algorithms.

[17]  M. Newman.  Spread of epidemic disease on networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.