期刊
EUROPEAN PHYSICAL JOURNAL B
卷 67, 期 3, 页码 277-284出版社
SPRINGER
DOI: 10.1140/epjb/e2008-00418-0
关键词
-
资金
- Direct For Social, Behav & Economic Scie [0830388] Funding Source: National Science Foundation
- Office of Advanced Cyberinfrastructure (OAC)
- Direct For Computer & Info Scie & Enginr [0838564] Funding Source: National Science Foundation
Most networks found in social and biochemical systems have modular structures. An important question prompted by the modularity of these networks is whether nodes can be said to belong to a single group. If they cannot, we would need to consider the role of overlapping communities. Despite some efforts in this direction, the problem of detecting overlapping groups remains unsolved because there is neither a formal definition of overlapping community, nor an ensemble of networks with which to test the performance of group detection algorithms when nodes can belong to more than one group. Here, we introduce an ensemble of networks with overlapping groups. We then apply three group identification methods - modularity maximization, k-clique percolation, and modularity-landscape surveying - to these networks. We find that the modularity-landscape surveying method is the only one able to detect heterogeneities in node memberships, and that those heterogeneities are only detectable when the overlap is small. Surprisingly, we find that the k-clique percolation method is unable to detect node membership for the overlapping case.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据