期刊
PHYSICAL REVIEW E
卷 80, 期 1, 页码 -出版社
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevE.80.016105
关键词
-
资金
- Engineering and Physical Sciences Research Council [EP/E049451/1] Funding Source: researchfish
- EPSRC [EP/E049451/1] Funding Source: UKRI
In this paper, we use a partition of the links of a network in order to uncover its community structure. This approach allows for communities to overlap at nodes so that nodes may be in more than one community. We do this by making a node partition of the line graph of the original network. In this way we show that any algorithm that produces a partition of nodes can be used to produce a partition of links. We discuss the role of the degree heterogeneity and propose a weighted version of the line graph in order to account for this.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据