Local Algorithms for Block Models with Side Information

08/10/2015
by   Elchanan Mossel, et al.
0

There has been a recent interest in understanding the power of local algorithms for optimization and inference problems on sparse graphs. Gamarnik and Sudan (2014) showed that local algorithms are weaker than global algorithms for finding large independent sets in sparse random regular graphs. Montanari (2015) showed that local algorithms are suboptimal for finding a community with high connectivity in the sparse Erdős-Rényi random graphs. For the symmetric planted partition problem (also named community detection for the block models) on sparse graphs, a simple observation is that local algorithms cannot have non-trivial performance. In this work we consider the effect of side information on local algorithms for community detection under the binary symmetric stochastic block model. In the block model with side information each of the n vertices is labeled + or - independently and uniformly at random; each pair of vertices is connected independently with probability a/n if both of them have the same label or b/n otherwise. The goal is to estimate the underlying vertex labeling given 1) the graph structure and 2) side information in the form of a vertex labeling positively correlated with the true one. Assuming that the ratio between in and out degree a/b is Θ(1) and the average degree (a+b) / 2 = n^o(1), we characterize three different regimes under which a local algorithm, namely, belief propagation run on the local neighborhoods, maximizes the expected fraction of vertices labeled correctly. Thus, in contrast to the case of symmetric block models without side information, we show that local algorithms can achieve optimal performance for the block model with side information.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/13/2021

Spectral Recovery of Binary Censored Block Models

Community detection is the problem of identifying community structure in...
research
04/11/2019

Community Detection in the Sparse Hypergraph Stochastic Block Model

We consider the community detection problem in sparse random hypergraphs...
research
02/19/2015

Finding One Community in a Sparse Graph

We consider a random sparse graph with bounded average degree, in which ...
research
02/14/2020

Scalable Dyadic Independence Models with Local and Global Constraints

An important challenge in the field of exponential random graphs (ERGs) ...
research
06/11/2018

On the universality of the stochastic block model

Mesoscopic pattern extraction (MPE) is the problem of finding a partitio...
research
05/18/2021

A sparse stochastic block model with two unequal communities

We show posterior convergence for the community structure in the planted...
research
05/28/2021

Inferring community characteristics in labelled networks

Labelled networks form a very common and important class of data, natura...

Please sign up or login with your details

Forgot password? Click here to reset