Degree Heterogeneity in Higher-Order Networks: Inference in the Hypergraph -Model

by   Sagnik Nandy, et al.

The β-model for random graphs is commonly used for representing pairwise interactions in a network with degree heterogeneity. Going beyond pairwise interactions, Stasi et al. (2014) introduced the hypergraph β-model for capturing degree heterogeneity in networks with higher-order (multi-way) interactions. In this paper we initiate the rigorous study of the hypergraph β-model with multiple layers, which allows for hyperedges of different sizes across the layers. To begin with, we derive the rates of convergence of the maximum likelihood (ML) estimate and establish their minimax rate optimality. We also derive the limiting distribution of the ML estimate and construct asymptotically valid confidence intervals for the model parameters. Next, we consider the goodness-of-fit problem in the hypergraph β-model. Specifically, we establish the asymptotic normality of the likelihood ratio (LR) test under the null hypothesis, derive its detection threshold, and also its limiting power at the threshold. Interestingly, the detection threshold of the LR test turns out to be minimax optimal, that is, all tests are asymptotically powerless below this threshold. The theoretical results are further validated in numerical experiments. In addition to developing the theoretical framework for estimation and inference for hypergraph β-models, the above results fill a number of gaps in the graph β-model literature, such as the minimax optimality of the ML estimates and the non-null properties of the LR test, which, to the best of our knowledge, have not been studied before.


page 1

page 2

page 3

page 4


Community Detection for Hypergraph Networks via Regularized Tensor Power Iteration

To date, social network analysis has been largely focused on pairwise in...

Phase Transitions of the Maximum Likelihood Estimates in the Tensor Curie-Weiss Model

The p-tensor Curie-Weiss model is a two-parameter discrete exponential f...

Sharp detection boundaries on testing dense subhypergraph

We study the problem of testing the existence of a dense subhypergraph. ...

Detection of Dense Subhypergraphs by Low-Degree Polynomials

Detection of a planted dense subgraph in a random graph is a fundamental...

Limit Theorems and Phase Transitions in the Tensor Curie-Weiss Potts Model

In this paper, we derive results about the limiting distribution of the ...

Heterogeneous Dense Subhypergraph Detection

We study the problem of testing the existence of a heterogeneous dense s...

Towards hypergraph cognitive networks as feature-rich models of knowledge

Semantic networks provide a useful tool to understand how related concep...

Please sign up or login with your details

Forgot password? Click here to reset