Detecting Overlapping Communities in Networks Using Spectral Methods

12/10/2014
by   Yuan Zhang, et al.
0

Community detection is a fundamental problem in network analysis which is made more challenging by overlaps between communities which often occur in practice. Here we propose a general, flexible, and interpretable generative model for overlapping communities, which can be thought of as a generalization of the degree-corrected stochastic block model. We develop an efficient spectral algorithm for estimating the community memberships, which deals with the overlaps by employing the K-medians algorithm rather than the usual K-means for clustering in the spectral domain. We show that the algorithm is asymptotically consistent when networks are not too sparse and the overlaps between communities not too large. Numerical experiments on both simulated networks and many real social networks demonstrate that our method performs very well compared to a number of benchmark methods for overlapping community detection.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/03/2015

Estimating the number of communities in networks by spectral methods

Community detection is a fundamental problem in network analysis with ma...
research
09/20/2020

Overlapping community detection in networks via sparse spectral decomposition

We consider the problem of estimating overlapping community memberships ...
research
01/16/2014

Community Detection in Networks using Graph Distance

The study of networks has received increased attention recently not only...
research
09/23/2019

Community Detection and Improved Detectability in Multiplex Networks

We investigate the widely encountered problem of detecting communities i...
research
10/02/2017

Testing for Global Network Structure Using Small Subgraph Statistics

We study the problem of testing for community structure in networks usin...
research
01/23/2018

The Importance of Communities for Learning to Influence

We consider the canonical problem of influence maximization in social ne...
research
06/12/2015

A Spectral Algorithm with Additive Clustering for the Recovery of Overlapping Communities in Networks

This paper presents a novel spectral algorithm with additive clustering ...

Please sign up or login with your details

Forgot password? Click here to reset