Spectral Clustering for Multiple Sparse Networks: I
Not on the map. Why?
Abstract (arXiv)
Although much of the focus of statistical works on networks has been on static networks, multiple networks are currently becoming more common among network data sets. Usually, a number of network data sets, which share some form of connection between each other are known as multiple or multi-layer networks. We consider the problem of identifying the common community structures for multiple networks. We consider extensions of the spectral clustering methods for the multiple sparse networks, and give theoretical guarantee that the spectral clustering methods produce consistent community detection in case of both multiple stochastic block model and multiple degree-corrected block models. The methods are shown to work under sufficiently mild conditions on the number of multiple networks to detect associative community structures, even if all the individual networks are sparse and most of the individual networks are below community detectability threshold. We reinforce the validity of the theoretical results via simulations too.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). First posted on arXiv 27 May 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 2; 2023: 3; 2024: 1.
8 papers.
- 2021Spectral embedding for dynamic networks with stability guaranteescited by 13
- 2023Intensity Profile Projection: A Framework for Continuous-Time Representation Learning for Dynamic Networkscited by 5
- 2022Consensus Knowledge Graph Learning via Multi-view Sparse Low Rank Block Modelcited by 3
- 2021Clustering multilayer graphs with missing nodescited by 2
- 2022Community detection in multiplex networks based on orthogonal nonnegative matrix tri-factorizationcited by 2
- 2023A pseudo-likelihood approach to community detection in weighted networkscited by 2
- 2023Privacy-Preserving Community Detection for Locally Distributed Multiple Networkscited by 2
- 2024Bias-Corrected Joint Spectral Embedding for Multilayer Networks with Invariant Subspace: Entrywise Eigenvector Perturbation and Inferencecited by 0
- 2024Bias-Corrected Joint Spectral Embedding for Multilayer Networks with Invariant Subspace: Entrywise Eigenvector Perturbation and Inference12 Jun 2024
- 2023Privacy-Preserving Community Detection for Locally Distributed Multiple Networks27 Jun 2023
- 2023Intensity Profile Projection: A Framework for Continuous-Time Representation Learning for Dynamic Networks9 Jun 2023
- 2023A pseudo-likelihood approach to community detection in weighted networks10 Mar 2023
- 2022Consensus Knowledge Graph Learning via Multi-view Sparse Low Rank Block Model28 Sep 2022
- 2022Community detection in multiplex networks based on orthogonal nonnegative matrix tri-factorization2 May 2022
- 2021Spectral embedding for dynamic networks with stability guarantees2 Jun 2021
- 2021Clustering multilayer graphs with missing nodes4 Mar 2021