R. Austin-r-benson, . Abebe, T. Michael, A. Schaub, J. Jadbabaie et al., Simplicial closure and higher-order link prediction, Proceedings of the National Academy of Sciences, vol.115, issue.48, pp.11221-11230, 2018.

A. Edward, E. Bender, and . Canfield, The asymptotic number of labeled graphs with given degree sequences, Journal of Combinatorial Theory, Series A, vol.24, issue.3, pp.296-307, 1978.

T. Batu and . Clément-l-canonne, Generalized uniformity testing, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pp.880-889, 2017.

J. Blitzstein and P. Diaconis, A sequential importance sampling algorithm for generating random graphs with prescribed degrees, Internet mathematics, vol.6, issue.4, pp.489-522, 2011.

C. Berge, Graphs and Hypergraphs, 1985.

B. Bollobás, 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.

M. K. Cowles and . Bradley-p-carlin, Markov chain monte carlo convergence diagnostics: a comparative review, Journal of the American Statistical Association, vol.91, issue.434, pp.883-904, 1996.

Y. Chen, P. Diaconis, P. Susan, J. Holmes, and . Liu, Sequential monte carlo methods for statistical analysis of tables, Journal of the American Statistical Association, vol.100, issue.469, pp.109-120, 2005.

P. S. Chodrow, Configuration models of random hypergraphs, 2019.

N. Sergey, A. V. Dorogovtsev, J. Goltsev, F. Ferreira, and . Mendes, Pseudofractal scale-free web, Physical review E, vol.65, issue.6, p.66122, 2002.

M. Dyer, R. Kannan, and J. Mount, Sampling contingency tables, Random Structures & Algorithms, vol.10, issue.4, pp.487-506, 1997.

K. Bailey, . Fosdick, J. Daniel-b-larremore, J. Nishimura, and . Ugander, Configuring random graph models with fixed degree sequences, SIAM Review, vol.60, issue.2, pp.315-355, 2018.

D. R. Fulkerson and H. Ryser, Multiplicities and minimal widths for (0, 1)-matrices, Canadian Journal of Mathematics, vol.14, pp.498-508, 1962.

D. Gale, A theorem on flows in networks, Pacific J. Math, vol.7, issue.2, pp.1073-1082, 1957.

S. Klamt, . Utz-uwe, F. Haus, and . Theis, Hypergraphs and cellular networks, PLoS computational biology, vol.5, issue.5, 2009.

A. Kong, A note on importance sampling using standardized weights, vol.348, 1992.

N. Mki-+-03]-ron-milo, S. Kashtan, . Itzkovitz, E. J. Mark, U. Newman et al., On the uniform generation of random graphs with prescribed degree sequences, 2003.

W. Albert, I. Marshall, B. Olkin, and . Arnold, Inequalities: theory of majorization and its applications, vol.143, 1979.

M. Newman, Networks: An Introduction, 2018.

. Hj-ryser, Combinatorial properties of matrices of zeros and ones, Canadian Journal of Mathematics, vol.9, pp.371-377, 1957.

C. , C. B. Xu, C. S. Wang, J. Tan, X. Bu et al., Using rich social media information for music recommendation via hypergraph model, ACM Transactions on Multimedia Computing, vol.7, issue.1, pp.211-237, 2011.

M. W. Bhuiyan, G. Yang, K. R. Wang, and . Choo, Hypergraph partitioning for social networks based on information entropy modularity, Journal of Network and Computer Applications, vol.86, pp.59-71, 2016.

Y. Wang and B. Zheng, 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.

D. Zhou, J. Huang, and B. Schölkopf, 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Û