Simplicial closure and higher-order link prediction, Proceedings of the National Academy of Sciences, vol.115, issue.48, pp.11221-11230, 2018. ,
The asymptotic number of labeled graphs with given degree sequences, Journal of Combinatorial Theory, Series A, vol.24, issue.3, pp.296-307, 1978. ,
Generalized uniformity testing, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pp.880-889, 2017. ,
A sequential importance sampling algorithm for generating random graphs with prescribed degrees, Internet mathematics, vol.6, issue.4, pp.489-522, 2011. ,
Graphs and Hypergraphs, 1985. ,
A probabilistic proof of an asymptotic formula for the number of labelled regular graphs, European Journal of Combinatorics, vol.1, issue.4, pp.311-316, 1980. ,
Markov chain monte carlo convergence diagnostics: a comparative review, Journal of the American Statistical Association, vol.91, issue.434, pp.883-904, 1996. ,
Sequential monte carlo methods for statistical analysis of tables, Journal of the American Statistical Association, vol.100, issue.469, pp.109-120, 2005. ,
Configuration models of random hypergraphs, 2019. ,
Pseudofractal scale-free web, Physical review E, vol.65, issue.6, p.66122, 2002. ,
Sampling contingency tables, Random Structures & Algorithms, vol.10, issue.4, pp.487-506, 1997. ,
Configuring random graph models with fixed degree sequences, SIAM Review, vol.60, issue.2, pp.315-355, 2018. ,
Multiplicities and minimal widths for (0, 1)-matrices, Canadian Journal of Mathematics, vol.14, pp.498-508, 1962. ,
A theorem on flows in networks, Pacific J. Math, vol.7, issue.2, pp.1073-1082, 1957. ,
Hypergraphs and cellular networks, PLoS computational biology, vol.5, issue.5, 2009. ,
A note on importance sampling using standardized weights, vol.348, 1992. ,
On the uniform generation of random graphs with prescribed degree sequences, 2003. ,
Inequalities: theory of majorization and its applications, vol.143, 1979. ,
Networks: An Introduction, 2018. ,
Combinatorial properties of matrices of zeros and ones, Canadian Journal of Mathematics, vol.9, pp.371-377, 1957. ,
Using rich social media information for music recommendation via hypergraph model, ACM Transactions on Multimedia Computing, vol.7, issue.1, pp.211-237, 2011. ,
Hypergraph partitioning for social networks based on information entropy modularity, Journal of Network and Computer Applications, vol.86, pp.59-71, 2016. ,
Hypergraph index: an index for context-aware nearest neighbor query on social networks, Social Network Analysis and Mining, vol.3, issue.4, pp.813-828, 2013. ,
Learning with hypergraphs: Clustering, classification, and embedding, Advances in neural information processing systems, pp.1601-1608, 2007. ,
,
, P(E)
, Equation (4) is obtained due to the fact that, f (H(E )) = f (H) for any E ? E. Equation (5) follows from the definition off (Definition 5). Equation (6) follows from the definition ofÛ