Fast Generation of Sparse Random Kernel Graphs

The development of kernel-based inhomogeneous random graphs has provided models that are flexible enough to capture many observed characteristics of real networks, and that are also mathematically tractable. We specify a class of inhomogeneous random graph models, called random kernel graphs, that produces sparse graphs with tunable graph properties, and we develop an efficient generation algorithm to sample random instances from this model. As real-world networks are usually large, it is essential that the run-time of generation algorithms scales better than quadratically in the number of vertices n. We show that for many practical kernels our algorithm runs in time at most 𝒪(n(logn)2). As a practical example we show how to generate samples of power-law degree distribution graphs with tunable assortativity.

[1]  Joel C. Miller,et al.  Efficient Generation of Networks with Given Expected Degrees , 2011, WAW.

[2]  Amin Saberi,et al.  A Sequential Algorithm for Generating Random Graphs , 2007, Algorithmica.

[3]  Tamara G. Kolda,et al.  A Scalable Generative Graph Model with Community Structure , 2013, SIAM J. Sci. Comput..

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

[5]  David F. Gleich,et al.  Algorithms and Models for the Web Graph , 2014, Lecture Notes in Computer Science.

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

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

[8]  Christos Faloutsos,et al.  R-MAT: A Recursive Model for Graph Mining , 2004, SDM.

[9]  Madhav V. Marathe,et al.  Modeling and simulation of large biological, information and socio-technical systems: an interaction based approach , 2006 .

[10]  Béla Bollobás,et al.  The phase transition in inhomogeneous random graphs , 2007, Random Struct. Algorithms.

[11]  Donald F. Towsley,et al.  Resisting structural re-identification in anonymized social networks , 2010, The VLDB Journal.

[12]  Prasad Tetali,et al.  Simple Markov-chain algorithms for generating bipartite graphs and tournaments , 1997, SODA '97.

[13]  Béla Bollobás,et al.  Sparse random graphs with clustering , 2008, Random Struct. Algorithms.

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

[15]  Persi Diaconis,et al.  A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees , 2011, Internet Math..

[16]  Alessandro Vespignani.  Modelling dynamical processes in complex socio-technical systems , 2011, Nature Physics.

[17]  Svante Janson,et al.  Asymptotic equivalence and contiguity of some random graphs , 2008, Random Struct. Algorithms.

[18]  Rick Durrett,et al.  Some features of the spread of epidemics and information on a random graph , 2010, Proceedings of the National Academy of Sciences.

[19]  M E J Newman.  Assortative mixing in networks. , 2002, Physical review letters.

[20]  Ali Pinar,et al.  Are We There Yet? When to Stop a Markov Chain while Generating Random Graphs , 2012, WAW.

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

[22]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[23]  Mark Newman,et al.  Networks: An Introduction , 2010 .

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

[25]  Tamara G. Kolda,et al.  Community structure and scale-free collections of Erdös-Rényi graphs , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[26]  Nelly Litvak,et al.  Uncovering disassortativity in large scale-free networks. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

[29]  Fan Chung Graham,et al.  A Random Graph Model for Power Law Graphs , 2001, Exp. Math..

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

[31]  Aric Hagberg,et al.  Exploring Network Structure, Dynamics, and Function using NetworkX , 2008, Proceedings of the Python in Science Conference.

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

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