ICML 2016poster48 citations
Community Recovery in Graphs with Locality
Yuxin Chen, Govinda Kamath, Changho Suh, David Tse
Abstract
Motivated by applications in domains such as social networks and computational biology, we study the problem of community recovery in graphs with locality. In this problem, pairwise noisy measurements of whether two nodes are in the same community or different communities come mainly or exclusively from nearby nodes rather than uniformly sampled between all node pairs, as in most existing models. We present two algorithms that run nearly linearly in the number of measurements and which achieve the information limits for exact recovery.
BibTeX
@InProceedings{pmlr-v48-chena16,
title = {Community Recovery in Graphs with Locality},
author = {Chen, Yuxin and Kamath, Govinda and Suh, Changho and Tse, David},
booktitle = {Proceedings of The 33rd International Conference on Machine Learning},
pages = {689--698},
year = {2016},
editor = {Balcan, Maria Florina and Weinberger, Kilian Q.},
volume = {48},
series = {Proceedings of Machine Learning Research},
address = {New York, New York, USA},
month = {20--22 Jun},
publisher = {PMLR},
pdf = {http://proceedings.mlr.press/v48/chena16.pdf},
url = {https://proceedings.mlr.press/v48/chena16.html},
abstract = {Motivated by applications in domains such as social networks and computational biology, we study the problem of community recovery in graphs with locality. In this problem, pairwise noisy measurements of whether two nodes are in the same community or different communities come mainly or exclusively from nearby nodes rather than uniformly sampled between all node pairs, as in most existing models. We present two algorithms that run nearly linearly in the number of measurements and which achieve the information limits for exact recovery.}
}