$β$ models for random hypergraphs with a given degree sequence
Preprint
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.Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Maximum lilkelihood estimation in the $\beta$-modelThe Annals of Statistics, 2013
- A central limit theorem in the -model for undirected random graphs with a diverging number of verticesBiometrika, 2013
- Random graphs with a given degree sequenceThe Annals of Applied Probability, 2011
- A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed DegreesInternet Mathematics, 2011
- The phase transition in a random hypergraphJournal of Computational and Applied Mathematics, 2002
- Book Review : Discrete Multivariate Analysis: Theory and PracticeApplied Psychological Measurement, 1977