Partial Recovery Bounds for the Sparse Stochastic Block Model

02/02/2016
by   Jonathan Scarlett, et al.
0

In this paper, we study the information-theoretic limits of community detection in the symmetric two-community stochastic block model, with intra-community and inter-community edge probabilities a/n and b/n respectively. We consider the sparse setting, in which a and b do not scale with n, and provide upper and lower bounds on the proportion of community labels recovered on average. We provide a numerical example for which the bounds are near-matching for moderate values of a - b, and matching in the limit as a-b grows large.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/29/2021

Information Theoretic Limits of Exact Recovery in Sub-hypergraph Models for Community Detection

In this paper, we study the information theoretic bounds for exact recov...
research
05/14/2015

Achieving Optimal Misclassification Proportion in Stochastic Block Model

Community detection is a fundamental statistical problem in network data...
research
01/31/2022

Differentially Private Community Detection for Stochastic Block Models

The goal of community detection over graphs is to recover underlying lab...
research
08/11/2020

Estimation of Static Community Memberships from Temporal Network Data

This article studies the estimation of static community memberships from...
research
01/21/2019

Exact Recovery for a Family of Community-Detection Generative Models

Generative models for networks with communities have been studied extens...
research
07/25/2022

Minimax Rates for Robust Community Detection

In this work, we study the problem of community detection in the stochas...
research
05/30/2023

Exact Distributed Stochastic Block Partitioning

Stochastic block partitioning (SBP) is a community detection algorithm t...

Please sign up or login with your details

Forgot password? Click here to reset