Exact Recovery in the Data Block Model

Community detection in networks is a fundamental problem in machine learning and statistical inference, with applications in social networks, biological systems, and communication networks. The stochastic block model (SBM) serves as a canonical framework for studying community structure, and exact recovery, identifying the true communities with high probability, is a central theoretical question. While classical results characterize the phase transition for exact recovery based solely on graph connectivity, many real-world networks contain additional data, such as node attributes or labels. In this work, we study exact recovery in the Data Block Model (DBM), an SBM augmented with node-associated data, as formalized by Asadi, Abbe, and Verdú (2017). We introduce the Chernoff–TV divergence and use it to characterize a sharp exact recovery threshold for the DBM. We further provide an efficient algorithm that achieves this threshold, along with a matching converse result showing impossibility below the threshold. Finally, simulations validate our findings and demonstrate the benefits of incorporating vertex data as side information in community detection.

💡 Research Summary

**
This paper studies exact recovery in the Data Block Model (DBM), an extension of the stochastic block model (SBM) that incorporates node‑specific side information (attributes, labels, or other data). While the classical SBM characterizes a sharp phase transition for exact recovery based solely on edge connectivity, many real‑world networks provide additional vertex data that can dramatically improve community detection. The authors introduce a new information‑theoretic quantity, the Chernoff‑TV divergence, which simultaneously captures the discriminative power of the graph structure and the node attributes.

Formally, for any two distinct communities (a) and (b), the Chernoff‑TV divergence (D_{\mathrm{CT}}(a,b)) is defined as the maximum over (\lambda\in