Construction of Directed 2K Graphs

We study the problem of generating synthetic graphs that resemble real-world directed graphs in terms of their degree correlations. In order to capture degree correlation specifically for directed graphs, we define directed 2K (D2K) as those graphs with a given directed degree sequence (DDS) and a given target joint degree and attribute matrix (JDAM). We provide necessary and sufficient conditions for a target D2K to be realizable and we design an efficient algorithm that generates graph realizations with exactly the target D2K. We apply our algorithm to generate synthetic graphs that target real-world directed graphs (such as Twitter), and we demonstrate its benefits compared to state-of-the-art construction algorithms.

[1]  Isabelle Stanton,et al.  Constructing and sampling graphs with a prescribed joint degree distribution , 2011, JEAL.

[2]  Milena Mihail,et al.  Graphic Realizations of Joint-Degree Matrices , 2015, ArXiv.

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

[4]  Kevin E. Bassler,et al.  Efficient sampling of graphs with arbitrary degree sequence , 2010 .

[5]  S. Hakimi.  On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I , 1962 .

[6]  Kevin E. Bassler,et al.  Exact sampling of graphs with prescribed degree correlations , 2015, ArXiv.

[7]  Václav Havel,et al.  Poznámka o existenci konečných grafů , 1955 .

[8]  Fan Chung Graham,et al.  A random graph model for massive graphs , 2000, STOC '00.

[9]  Zoltán Toroczkai,et al.  New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling , 2016, Combinatorics, Probability and Computing.

[10]  István Miklós,et al.  Not all simple looking degree sequence problems are easy , 2016 .

[11]  Amin Vahdat,et al.  Graph annotations in modeling complex network topologies , 2007, TOMC.

[12]  D. R. Fulkerson.  Zero-one matrices with zero trace. , 1960 .

[13]  Chiara Orsini,et al.  Quantifying randomness in real networks , 2015, Nature Communications.

[14]  István Miklós,et al.  The second order degree sequence problem is NP-complete , 2016, ArXiv.

[15]  István Miklós,et al.  On realizations of a joint degree matrix , 2015, Discret. Appl. Math..

[16]  PÁL és,et al.  Gráfok előírt fokú pontokkal , 2004 .

[17]  Alexander I. Barvinok,et al.  The number of graphs and a random graph with a given degree sequence , 2010, Random Struct. Algorithms.

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

[19]  Jure Leskovec,et al.  {SNAP Datasets}: {Stanford} Large Network Dataset Collection , 2014 .

[20]  P. Holland,et al.  Local Structure in Social Networks , 1976 .

[21]  Zoltán Király,et al.  On the Swap-Distances of Different Realizations of a Graphical Degree Sequence , 2013, Comb. Probab. Comput..

[22]  Minas Gjoka,et al.  Construction of simple graphs with a target joint degree matrix and beyond , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[23]  Priya Mahadevan,et al.  Systematic topology analysis and generation using degree correlations , 2006, SIGCOMM 2006.

[24]  Zoltán Toroczkai,et al.  A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix , 2015, SIAM J. Discret. Math..

[25]  Kevin E. Bassler,et al.  Constructing and sampling directed graphs with given degree sequences , 2011, ArXiv.

[26]  Leo van Iersel,et al.  Graph Realizations Constrained by Skeleton Graphs , 2017, Electron. J. Comb..

[27]  S. N. Dorogovtsev.  Networks with desired correlations , 2003 .