Community detection in multi-relational data with restricted multi-layer stochastic blockmodel
Subhadeep Paul, Yuguo Chen

TL;DR
This paper introduces and analyzes the restricted multi-layer stochastic blockmodel (RMLSBM) for community detection in multi-relational data, demonstrating its advantages over existing models through theoretical results and empirical validation.
Contribution
The paper develops the RMLSBM, derives consistency and minimax error rates, and compares its performance with other methods, showing its superiority in certain growth scenarios.
Findings
RMLSBM outperforms MLSBM when community growth is high or degrees are low.
Consistency results are established for maximum likelihood estimators in multi-layer models.
Simulation and real data confirm the effectiveness of multi-layer approaches.
Abstract
In recent years there has been an increased interest in statistical analysis of data with multiple types of relations among a set of entities. Such multi-relational data can be represented as multi-layer graphs where the set of vertices represents the entities and multiple types of edges represent the different relations among them. For community detection in multi-layer graphs, we consider two random graph models, the multi-layer stochastic blockmodel (MLSBM) and a model with a restricted parameter space, the restricted multi-layer stochastic blockmodel (RMLSBM). We derive consistency results for community assignments of the maximum likelihood estimators (MLEs) in both models where MLSBM is assumed to be the true model, and either the number of nodes or the number of types of edges or both grow. We compare MLEs in the two models with other baseline approaches, such as separate modeling…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
