Fundamental limits of community detection from multi-view data: multi-layer, dynamic and partially labeled block models
Not on the map. Why?
Abstract (arXiv)
Multi-view data arises frequently in modern network analysis e.g. relations of multiple types among individuals in social network analysis, longitudinal measurements of interactions among observational units, annotated networks with noisy partial labeling of vertices etc. We study community detection in these disparate settings via a unified theoretical framework, and investigate the fundamental thresholds for community recovery. We characterize the mutual information between the data and the latent parameters, provided the degrees are sufficiently large. Based on this general result, (i) we derive a sharp threshold for community detection in an inhomogeneous multilayer block model citepchen2022global, (ii) characterize a sharp threshold for weak recovery in a dynamic stochastic block model citepmatias2017statistical, and (iii) identify the limiting mutual information in an unbalanced partially labeled block model. Our first two results are derived modulo coordinate-wise convexity assumptions on specific functions -- we provide extensive numerical evidence for their correctness. Finally, we introduce iterative algorithms based on Approximate Message Passing for community detection in these problems.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 6 of its 69 references that are in the map. First posted on arXiv 16 Jan 2024.
Builds on
6 of 69 references.
References · 6
- 2018Contextual Stochastic Block Modelscited by 134
- 2021Graph-based Approximate Message Passing Iterationscited by 35
- 2020Contextual Stochastic Block Model: Sharp Thresholds and Contiguitycited by 22
- 2020General Community Detection with Optimal Recovery Conditions for Multi-relational Sparse Networks with Dependent Layerscited by 6
- 2023Approximate Message Passing for the Matrix Tensor Product Modelcited by 6
- 2023Semi-supervised Community Detection via Structural Similarity Metricscited by 2
Built on by
Citing papers per year: 2024: 3; 2025: 1; 2026: 3.
7 papers.
- 2024Matrix Denoising with Doubly Heteroscedastic Noise: Fundamental Limits and Optimal Spectral Methodscited by 5
- 2024Efficient Graph Matching for Correlated Stochastic Block Modelscited by 5
- 2024Optimal thresholds and algorithms for a model of multi-modal learning in high dimensionscited by 4
- 2025Spectral Thresholds in Correlated Spiked Models and Fundamental Limits of Partial Least Squarescited by 4
- 2026Multi-layer Cross-attention is Provably Optimal for Multi-modal In-context Learningcited by 2
- 2026Fundamental Limits of Community Detection in Contextual Multi-Layer Stochastic Block Modelscited by 0
- 2026DAIF: A Data-Driven Intermediate Fusion Framework for Multimodal Supervised Learning via Approximate Message Passingcited by 0
- 2026DAIF: A Data-Driven Intermediate Fusion Framework for Multimodal Supervised Learning via Approximate Message Passing3 Aug 2026
- 2026Fundamental Limits of Community Detection in Contextual Multi-Layer Stochastic Block Models9 Feb 2026
- 2026Multi-layer Cross-attention is Provably Optimal for Multi-modal In-context Learning4 Feb 2026
- 2025Spectral Thresholds in Correlated Spiked Models and Fundamental Limits of Partial Least Squares20 Oct 2025
- 2024Efficient Graph Matching for Correlated Stochastic Block Models3 Dec 2024
- 2024Optimal thresholds and algorithms for a model of multi-modal learning in high dimensions3 Jul 2024
- 2024Matrix Denoising with Doubly Heteroscedastic Noise: Fundamental Limits and Optimal Spectral Methods22 May 2024