Configuration Models of Random Hypergraphs and their Applications

Many empirical networks are intrinsically polyadic, with interactions occurring within groups of agents of arbitrary size. There are, however, few flexible null models that can support statistical inference for such polyadic networks. We define a class of null random hypergraphs that hold constant both the node degree and edge dimension sequences, generalizing the classical dyadic configuration model. We provide a Markov Chain Monte Carlo scheme for sampling from these models, and discuss connections and distinctions between our proposed models and previous approaches. We then illustrate these models through a triplet of applications. We start with two classical network topics -- triadic clustering and degree-assortativity. In each, we emphasize the importance of randomizing over hypergraph space rather than projected graph space, showing that this choice can dramatically alter statistical inference and study findings. We then define and study the edge intersection profile of a hypergraph as a measure of higher-order correlation between edges, and derive asymptotic approximations under the stub-labeled null. Our experiments emphasize the ability of explicit, statistically-grounded polyadic modeling to significantly enhance the toolbox of network data science. We close with suggestions for multiple avenues of future work.

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

[2]  Catherine S. Greenhill,et al.  The mixing time of the swap (switch) Markov chains: a unified approach , 2019, ArXiv.

[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]  M. Farber,et al.  Random Simplicial Complexes , 2014, 1412.5805.

[5]  Alice Patania,et al.  The shape of collaborations , 2017, EPJ Data Science.

[6]  James H. Fowler,et al.  Legislative cosponsorship networks in the US House and Senate , 2006, Soc. Networks.

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

[8]  Jon M. Kleinberg,et al.  Simplicial closure and higher-order link prediction , 2018, Proceedings of the National Academy of Sciences.

[9]  Luís M. A. Bettencourt,et al.  Invention as a combinatorial process: evidence from US patents , 2014, Journal of The Royal Society Interface.

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

[11]  Austin R. Benson,et al.  Random Walks on Simplicial Complexes and the normalized Hodge Laplacian , 2018, SIAM Rev..

[12]  Philip S. Chodrow,et al.  Annotated hypergraphs: models and applications , 2019, Applied Network Science.

[13]  Andrea Gabrielli,et al.  Randomizing bipartite networks: the case of the World Trade Web , 2015, Scientific Reports.

[14]  D. Aldous Probability Approximations via the Poisson Clumping Heuristic , 1988 .

[15]  Yang Song,et al.  An Overview of Microsoft Academic Service (MAS) and Applications , 2015, WWW.

[16]  Danielle S. Bassett,et al.  Two’s company, three (or more) is a simplex , 2016, Journal of Computational Neuroscience.

[17]  Bogumil Kaminski,et al.  Clustering via hypergraph modularity , 2018, PloS one.

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

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

[20]  Guido Caldarelli,et al.  Random hypergraphs and their applications , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[22]  Siddhartha R. Jonnalagadda,et al.  Scientific collaboration networks using biomedical text. , 2014, Methods in molecular biology.

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

[24]  Catherine S. Greenhill,et al.  The switch Markov chain for sampling irregular graphs and digraphs , 2017, Theor. Comput. Sci..

[25]  M. Newman,et al.  Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[27]  C. J. Carstens Proof of uniform sampling of binary matrices with fixed row sums and column sums for the fast Curveball algorithm. , 2015, Physical review. E, Statistical, nonlinear, and soft matter physics.

[28]  N. Verhelst An Efficient MCMC Algorithm to Sample Binary Matrices with Fixed Marginals , 2008 .

[29]  A. Barabasi,et al.  Evolution of the social network of scientific collaborations , 2001, cond-mat/0104162.

[30]  Alessandro Vespignani,et al.  Detecting rich-club ordering in complex networks , 2006, physics/0602134.

[31]  Casey M. Warmbrand,et al.  A Network Analysis of Committees in the U.S. House of Representatives , 2013, Proceedings of the National Academy of Sciences of the United States of America.

[32]  Giovanni Strona,et al.  A fast and unbiased procedure to randomize ecological binary matrices with fixed row and column totals , 2014, Nature Communications.

[33]  Jean-Gabriel Young,et al.  Construction of and efficient sampling from the simplicial configuration model. , 2017, Physical review. E.

[34]  Eugene M Terentjev,et al.  Emergence of biaxial nematic phases in solutions of semiflexible dimers. , 2017, Physical review. E.

[35]  Ernesto Estrada,et al.  Centralities in Simplicial Complexes , 2017, ArXiv.

[36]  Alain Barrat,et al.  Contact Patterns in a High School: A Comparison between Data Collected Using Wearable Sensors, Contact Diaries and Friendship Surveys , 2015, PloS one.

[37]  M. Markus,et al.  Oscillations and turbulence induced by an activating agent in an active medium. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[38]  M E Newman,et al.  Scientific collaboration networks. I. Network construction and fundamental results. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[39]  S. Fortunato,et al.  Resolution limit in community detection , 2006, Proceedings of the National Academy of Sciences.

[40]  Matthieu Latapy,et al.  Efficient and simple generation of random simple connected graphs with prescribed degree sequence , 2005, J. Complex Networks.

[41]  Mark Jerrum,et al.  Fast Uniform Generation of Regular Graphs , 1990, Theor. Comput. Sci..

[42]  Remco van der Hofstad,et al.  Limit laws for self-loops and multiple edges in the configuration model , 2016, Annales de l'Institut Henri Poincaré, Probabilités et Statistiques.

[43]  T. Aushev,et al.  Radiative B meson decays into Kπγ and Kππγ final states , 2002 .

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

[45]  Srinivasan Parthasarathy,et al.  Hypergraph Clustering: A Modularity Maximization Approach , 2018, ArXiv.

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

[47]  Antoine Allard,et al.  General and exact approach to percolation on random graphs. , 2015, Physical review. E, Statistical, nonlinear, and soft matter physics.

[48]  J. Fowler Connecting the Congress: A Study of Cosponsorship Networks , 2006, Political Analysis.

[49]  Danielle S Bassett,et al.  The importance of the whole: Topological data analysis for the network neuroscientist , 2018, Network Neuroscience.

[50]  Lars Backstrom,et al.  Structural diversity in social contagion , 2012, Proceedings of the National Academy of Sciences.

[51]  D. Gale A theorem on flows in networks , 1957 .

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

[53]  Gunnar E. Carlsson,et al.  Topology and data , 2009 .

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

[55]  Mason A. Porter,et al.  A network analysis of committees in the United States House of Representatives , 2005, ArXiv.

[56]  L. Stone,et al.  Generating uniformly distributed random networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[57]  Catherine S. Greenhill A Polynomial Bound on the Mixing Time of a Markov Chain for Sampling Regular Directed Graphs , 2011, Electron. J. Comb..

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

[59]  J. Moody Race, School Integration, and Friendship Segregation in America1 , 2001, American Journal of Sociology.

[60]  Yiming Yang,et al.  Introducing the Enron Corpus , 2004, CEAS.

[61]  Ciro Cattuto,et al.  High-Resolution Measurements of Face-to-Face Contact Patterns in a Primary School , 2011, PloS one.

[62]  S. Welle,et al.  The Regulation of Skeletal Muscle Protein Turnover during the Progression of Cancer Cachexia in the ApcMin/+ Mouse , 2011, PloS one.

[63]  Prasad Tetali,et al.  Simple Markov-Chain Algorithms for Generating Bipartite Graphs and Tournaments (Extended Abstract) , 1999, SODA.

[64]  M. Farber,et al.  Large random simplicial complexes, I , 2015, 1503.06285.

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

[66]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[67]  H. J. Ryser,et al.  Matrices of zeros and ones , 1960 .

[68]  Co-prescription network reveals social dynamics of opioid doctor shopping , 2019, PloS one.

[69]  C. Fred Bergsten Two's Company , 2009 .

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

[71]  Yiming Yang,et al.  The Enron Corpus: A New Dataset for Email Classi(cid:12)cation Research , 2004 .

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

[73]  Kazuyuki Aihara,et al.  Corrigendum: Quantifying the Antiviral Effect of IFN on HIV-1 Replication in Cell Culture , 2015, Scientific reports.

[74]  Ginestra Bianconi,et al.  Generalized network structures: The configuration model and the canonical ensemble of simplicial complexes. , 2016, Physical review. E.

[75]  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.

[76]  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.

[77]  Joel Nishimura,et al.  The connectivity of graphs of graphs with self-loops and a given degree sequence , 2017, J. Complex Networks.

[78]  M. Newman,et al.  Mixing patterns in networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.