Global and Local Information in Clustering Labeled Block Models

DOI10.1109/TIT.2016.2516564MaRDI QIDQ2976593zbMATH OpenOpenAlexFDO

Authors Varun Kanade, Elchanan Mossel, Tselil Schramm

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1404.6325

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Information theory (general) (94A15) Applications of graph theory to circuits and networks (94C15)

Abstract: The stochastic block model is a classical cluster-exhibiting random graph model that has been widely studied in statistics, physics and computer science. In its simplest form, the model is a random graph with two equal-sized clusters, with intra-cluster edge probability p, and inter-cluster edge probability q. We focus on the sparse case, i.e., p, q = O(1/n), which is practically more relevant and also mathematically more challenging. A conjecture of Decelle, Krzakala, Moore and Zdeborova, based on ideas from statistical physics, predicted a specific threshold for clustering. The negative direction of the conjecture was proved by Mossel, Neeman and Sly (2012), and more recently the positive direction was proven independently by Massoulie and Mossel, Neeman, and Sly. In many real network clustering problems, nodes contain information as well. We study the interplay between node and network information in clustering by studying a labeled block model, where in addition to the edge information, the true cluster labels of a small fraction of the nodes are revealed. In the case of two clusters, we show that below the threshold, a small amount of node information does not affect recovery. On the other hand, we show that for any small amount of information efficient local clustering is achievable as long as the number of clusters is sufficiently large (as a function of the amount of revealed information).

Cited in

(4)

• New mathematical techniques in information theory. Abstracts from the workshop held March 13--19, 2022
• Mutual information for the sparse stochastic block model
• Fundamental limits of community detection from multi-view data: multi-layer, dynamic and partially labeled block models
• Semi-supervised clustering of sparse graphs: crossing the information-theoretic threshold

This page was built for publication: Global and Local Information in Clustering Labeled Block Models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976593)