Exact Community Recovery over Signed Graphs

02/22/2022
by   Xiaolu Wang, et al.
0

Signed graphs encode similarity and dissimilarity relationships among different entities with positive and negative edges. In this paper, we study the problem of community recovery over signed graphs generated by the signed stochastic block model (SSBM) with two equal-sized communities. Our approach is based on the maximum likelihood estimation (MLE) of the SSBM. Unlike many existing approaches, our formulation reveals that the positive and negative edges of a signed graph should be treated unequally. We then propose a simple two-stage iterative algorithm for solving the regularized MLE. It is shown that in the logarithmic degree regime, the proposed algorithm can exactly recover the underlying communities in nearly-linear time at the information-theoretic limit. Numerical results on both synthetic and real data are reported to validate and complement our theoretical developments and demonstrate the efficacy of the proposed method.

READ FULL TEXT

page 7

page 8

research
06/29/2020

Non-Convex Exact Community Recovery in Stochastic Block Model

Learning community structures in graphs that are randomly generated by s...
research
11/03/2020

Regularized spectral methods for clustering signed networks

We study the problem of k-way clustering in signed graphs. Considerable ...
research
03/29/2022

Exact Community Recovery in Correlated Stochastic Block Models

We consider the problem of learning latent community structure from mult...
research
07/14/2021

Correlated Stochastic Block Models: Exact Graph Matching with Applications to Recovering Communities

We consider the task of learning latent community structure from multipl...
research
06/05/2020

Linear Programming and Community Detection

The problem of community detection with two equal-sized communities is c...
research
07/20/2023

Exact Community Recovery in the Geometric SBM

We study the problem of exact community recovery in the Geometric Stocha...
research
11/07/2017

Learning Overcomplete HMMs

We study the problem of learning overcomplete HMMs---those that have man...

Please sign up or login with your details

Forgot password? Click here to reset