pith. sign in

arxiv: 1805.10594 · v1 · pith:XUA2GW2Enew · submitted 2018-05-27 · 📊 stat.ME · cs.SI· math.ST· stat.TH

Spectral Clustering for Multiple Sparse Networks: I

classification 📊 stat.ME cs.SImath.STstat.TH
keywords networksmultiplecommunityclusteringmethodssparsespectralblock
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A functional tensor model for dynamic multilayer networks with common invariant subspaces and the RKHS estimation

    stat.ME 2025-09 unverdicted novelty 6.0

    A functional tensor model with common invariant subspaces and RKHS-based estimation is introduced for dynamic multilayer networks to handle shared structures, temporal smoothness, and layer heterogeneity.