ALMA: Alternating Minimization Algorithm for Clustering Mixture Multilayer Network
arXiv:2102.10226
Abstract
The paper considers a Mixture Multilayer Stochastic Block Model (MMLSBM), where layers can be partitioned into groups of similar networks, and networks in each group are equipped with a distinct Stochastic Block Model. The goal is to partition the multilayer network into clusters of similar layers, and to identify communities in those layers. Jing et al. (2020) introduced the MMLSBM and developed a clustering methodology, TWIST, based on regularized tensor decomposition. The present paper proposes a different technique, an alternating minimization algorithm (ALMA), that aims at simultaneous recovery of the layer partition, together with estimation of the matrices of connection probabilities of the distinct layers. Compared to TWIST, ALMA achieves higher accuracy both theoretically and numerically.
References in corpus (10)
- Quantifying layer similarity in multiplex networks: a systematic study
- Estimating the number of communities in networks by spectral methods
- Provable Convex Co-clustering of Tensors
- Layer Communities in Multiplex Networks
- Optimal Covariance Change Point Localization in High Dimension
- The Power Mean Laplacian for Multilayer Graph Clustering
- General Community Detection with Optimal Recovery Conditions for Multi-relational Sparse Networks with Dependent Layers
- Exact Clustering in Tensor Block Model: Statistical Optimality and Computational Limit
- Multiresolution Tensor Decomposition for Multiple Spatial Passing Networks
- Testing Changes in Communities for the Stochastic Block Model