Community Recovery in Graphs with Locality

11 Feb 2016  ·  Yuxin Chen, Govinda Kamath, Changho Suh, David Tse ·

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 nodes pairs, as in most existing models... We present an algorithm that runs nearly linearly in the number of measurements and which achieves the information theoretic limit for exact recovery. read more

PDF Abstract
No code implementations yet. Submit your code now



  Add Datasets introduced or used in this paper

Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.


No methods listed for this paper. Add relevant methods here