资源分类
》 资源 》论文》Community Recovery in Graphs with Locality

Community Recovery in Graphs with Locality

2020-03-06 | |  78 |   46 |   0

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.

上一篇：Persistence weighted Gaussian kernel for topological data analysis

下一篇：Understanding and Improving Convolutional Neural Networks via Concatenated Rectified Linear Units

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...