Mutual Information in Community Detection with Covariate Information and Correlated Networks
arXiv:1912.05375
Abstract
We study the problem of community detection when there is covariate information about the node labels and one observes multiple correlated networks. We provide an asymptotic upper bound on the per-node mutual information as well as a heuristic analysis of a multivariate performance measure called the MMSE matrix. These results show that the combined effects of seemingly very different types of information can be characterized explicitly in terms of formulas involving low-dimensional estimation problems in additive Gaussian noise. Our analysis is supported by numerical simulations.
References in corpus (15)
- Spectral redemption: clustering sparse networks
- Phase transition in the detection of modules in sparse networks
- Structure and inference in annotated networks
- Covariate-assisted spectral clustering
- Information-theoretic thresholds from the cavity method
- Mutual Information in Rank-One Matrix Estimation
- Phase transitions in semisupervised clustering of sparse networks
- The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness
- Community Detection with Side Information: Exact Recovery under the Stochastic Block Model
- Inference for multiple heterogeneous networks with a common invariant subspace
- Information-theoretic thresholds for community detection in sparse networks
- Contextual Stochastic Block Models
- Inference via Message Passing on Partially Labeled Stochastic Block Models
- Phase Transitions in Community Detection: A Solvable Toy Model
- Efficient inference in stochastic block models with vertex labels