DeepAI AI Chat
Log In Sign Up

Information Theoretic Limits of Exact Recovery in Sub-hypergraph Models for Community Detection

by   Jiajun Liang, et al.

In this paper, we study the information theoretic bounds for exact recovery in sub-hypergraph models for community detection. We define a general model called the m-uniform sub-hypergraph stochastic block model (m-ShSBM). Under the m-ShSBM, we use Fano's inequality to identify the region of model parameters where any algorithm fails to exactly recover the planted communities with a large probability. We also identify the region where a Maximum Likelihood Estimation (MLE) algorithm succeeds to exactly recover the communities with high probability. Our bounds are tight and pertain to the community detection problems in various models such as the planted hypergraph stochastic block model, the planted densest sub-hypergraph model, and the planted multipartite hypergraph model.


page 1

page 2

page 3

page 4


Community detection in censored hypergraph

Community detection refers to the problem of clustering the nodes of a n...

Multilayer hypergraph clustering using the aggregate similarity matrix

We consider the community recovery problem on a multilayer variant of th...

Exact Recovery for a Family of Community-Detection Generative Models

Generative models for networks with communities have been studied extens...

Partial Recovery Bounds for the Sparse Stochastic Block Model

In this paper, we study the information-theoretic limits of community de...

Statistical and computational thresholds for the planted k-densest sub-hypergraph problem

Recovery a planted signal perturbed by noise is a fundamental problem in...

Information-theoretic Limits for Community Detection in Network Models

We analyze the information-theoretic limits for the recovery of node lab...

Hypergraph Clustering in the Weighted Stochastic Block Model via Convex Relaxation of Truncated MLE

We study hypergraph clustering under the weighted d-uniform hypergraph s...