• Corpus ID: 233168964

Community Detection with Contextual Multilayer Networks

@article{Ma2021CommunityDW,
  title={Community Detection with Contextual Multilayer Networks},
  author={Zongming Ma and Sagnik Nandy},
  journal={ArXiv},
  year={2021},
  volume={abs/2104.02960}
}
In this paper, we study community detection when we observe $m$ sparse networks and a high dimensional covariate matrix, all encoding the same community structure among $n$ subjects. In the asymptotic regime where the number of features $p$ and the number of subjects $n$ grows proportionally, we derive an exact formula of asymptotic minimum mean square error (MMSE) for estimating the common community structure in the balanced two block case. The formula implies the necessity of integrating… 

Figures from this paper

Correlated Stochastic Block Models: Exact Graph Matching with Applications to Recovering Communities
TLDR
It is shown how one can exactly recover the latent communities using multiple correlated graphs in parameter regimes where it is information-theoretically impossible to do so using just a single graph.
Rank-one matrix estimation with groupwise heteroskedasticity
TLDR
This work proves asymptotically exact formulas for the minimum mean-squared error in estimating both the matrix and the latent variables of a rank-one matrix from Gaussian observations.
An iterative clustering algorithm for the Contextual Stochastic Block Model with optimality guarantees
TLDR
This work proposes a new iterative algorithm to cluster networks with side information for nodes (in the form of covariates) and shows that the algorithm is optimal under the Contextual Symmetric Stochastic Block Model.