$\beta$ models for random hypergraphs with a given degree sequence

Abstract

We introduce the beta model for random hypergraphs in order to represent the occurrence of multi-way interactions among agents in a social network. This model builds upon and generalizes the well-studied beta model for random graphs, which instead only considers pairwise interactions. We provide two algorithms for fitting the model parameters, IPS (iterative proportional scaling) and fixed point algorithm, prove that both algorithms converge if maximum likelihood estimator (MLE) exists, and provide algorithmic and geometric ways of dealing the issue of MLE existence.

9 pages, 2 figures, Proceedings of 21st International Conference on Computational Statistics (2014), to appear

Cited by in corpus (5)

• What are higher-order networks?
• Hypergraph reconstruction from noisy pairwise observations
• Nonparametric Modeling of Higher-Order Interactions via Hypergraphons
• Coauthorship and citation networks for statisticians: Comment
• How Do Hyperedges Overlap in Real-World Hypergraphs? -- Patterns, Measures, and Generators