The HyperKron Graph Model for Higher-Order Features

In this manuscript we present the HyperKron Graph model: an extension of the Kronecker Model, but with a distribution over hyperedges. We prove that we can efficiently generate graphs from this model in time proportional to the number of edges times a small log-factor, and find that in practice the runtime is linear with respect to the number of edges. We illustrate a number of useful features of the HyperKron model including non-trivial clustering and highly skewed degree distributions. Finally, we fit the HyperKron model to real-world networks, and demonstrate the model's flexibility with a complex application of the HyperKron model to networks with coherent feed-forward loops.

[1]  Blai Bonet.  Efficient Algorithms to Rank and Unrank Permutations in Lexicographic Order , 2008 .

[2]  Nathan Lemons,et al.  Fast Generation of Sparse Random Kernel Graphs , 2015, PloS one.

[3]  Jennifer Neville,et al.  A Scalable Method for Exact Sampling from Kronecker Family Models , 2014, 2014 IEEE International Conference on Data Mining.

[4]  Joel Nishimura,et al.  Configuring Random Graph Models with Fixed Degree Sequences , 2016, SIAM Rev..

[5]  Christos Faloutsos,et al.  Kronecker Graphs: An Approach to Modeling Networks , 2008, J. Mach. Learn. Res..

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

[7]  David F. Gleich,et al.  Coin-flipping, ball-dropping, and grass-hopping for generating random graphs from matrices of edge probabilities , 2017, SIAM Rev..

[8]  Christos Faloutsos,et al.  RTM: Laws and a Recursive Generator for Weighted Time-Evolving Graphs , 2008, 2008 Eighth IEEE International Conference on Data Mining.

[9]  Jure Leskovec,et al.  Multiplicative Attribute Graph Model of Real-World Networks , 2010, Internet Math..

[10]  Jure Leskovec,et al.  Higher-order organization of complex networks , 2016, Science.

[11]  A Díaz-Guilera,et al.  Self-similar community structure in a network of human interactions. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  J. Grilli,et al.  Higher-order interactions stabilize dynamics in competitive network models , 2017, Nature.

[13]  James W. McGalliard.  8 1/2 , 1993, Int. CMG Conference.

[14]  Mervin E. Muller,et al.  Development of Sampling Plans by Using Sequential (Item by Item) Selection Techniques and Digital Computers , 1962 .

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

[16]  Jennifer Neville,et al.  Tied Kronecker product graph models to capture variance in network populations , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[17]  Bonnie Berger,et al.  Global alignment of multiple protein interaction networks with application to functional orthology detection , 2008, Proceedings of the National Academy of Sciences.

[18]  Mason A. Porter,et al.  Social Structure of Facebook Networks , 2011, ArXiv.

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

[20]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[21]  Kathryn B. Laskey,et al.  Stochastic blockmodels: First steps , 1983 .

[22]  T. Wassmer.  6 , 1900, EXILE.

[23]  Andrzej Cichocki,et al.  On Revealing Replicating Structures in Multiway Data: A Novel Tensor Decomposition Approach , 2012, LVA/ICA.

[24]  M E J Newman,et al.  Random graphs with clustering. , 2009, Physical review letters.

[25]  Peter Morters,et al.  Spatial preferential attachment networks: Power laws and clustering coefficients , 2012, 1210.3830.

[26]  David F. Gleich,et al.  Moment-Based Estimation of Stochastic Kronecker Graph Parameters , 2011, Internet Math..

[27]  Guy Bresler,et al.  Mixing Time of Exponential Random Graphs , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

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

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

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

[31]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[32]  Jure Leskovec,et al.  Higher-order clustering in networks , 2017, Physical review. E.

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

[34]  David F. Gleich,et al.  The Spacey Random Walk: A Stochastic Process for Higher-Order Data , 2016, SIAM Rev..

[35]  Anthony Bonato,et al.  Geometric Protean Graphs , 2011, Internet Math..

[36]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[37]  Christos Faloutsos,et al.  Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication , 2005, PKDD.

[38]  Martin Rosvall,et al.  Memory in network flows and its effects on spreading dynamics and community detection , 2013, Nature Communications.

[39]  S. Shen-Orr,et al.  Networks Network Motifs : Simple Building Blocks of Complex , 2002 .

[40]  Brian W. Barrett,et al.  Introducing the Graph 500 , 2010 .

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

[42]  Tamara G. Kolda,et al.  An in-depth analysis of stochastic Kronecker graphs , 2011, JACM.