Side Information in the Binary Stochastic Block Model: Exact Recovery

TL;DR

This paper investigates how different types and qualities of side information influence the phase transition for exact community detection in the binary stochastic block model, providing new theoretical thresholds and an efficient recovery algorithm.

Contribution

It characterizes the impact of binary symmetric and erasure side information on phase transitions and proposes an efficient algorithm incorporating side information for exact recovery.

Findings

Side information via binary symmetric channel improves phase transition when lpha is appropriately scaled.

Side information via binary erasure channel enhances exact recovery under certain conditions.

Derived tight necessary and sufficient conditions for exact recovery with various side information models.

Abstract

In the community detection problem, one may have access to additional observations (side information) about the label of each node. This paper studies the effect of the quality and quantity of side information on the phase transition of exact recovery in the binary symmetric stochastic block model (SBM) with $n$ nodes. When the side information consists of the label observed through a binary symmetric channel with crossover probability $\alpha$, and when $\log(\frac{1-\alpha}{\alpha}) =O(\log(n))$, it is shown that side information has a positive effect on phase transition; the new phase transition under this condition is characterized. When $\alpha$ is constant or approaches zero sufficiently slowly, i.e., $\log(\frac{1-\alpha}{\alpha}) = o(\log(n))$, it is shown that side information does not help exact recovery. When the side information consists of the label observed through a binary erasure channel with parameter $\epsilon$, and when $\log(\epsilon)=O(\log(n))$, it is shown that side information improves exact recovery and the new phase transition is characterized. If $\log(\epsilon)=o(\log(n))$, then it is shown that side information is not helpful. The results are then generalized to an arbitrary side information of finite cardinality. Necessary and sufficient conditions are derived for exact recovery that are tight, except for one special case under $M$-ary side information. An efficient algorithm that incorporates the effect of side information is proposed that uses a partial recovery algorithm combined with a local improvement procedure. Sufficient conditions are derived for exact recovery under this efficient algorithm.