Line graphs, link partitions, and overlapping communities
Line graphs, link partitions, and overlapping communities
复制标题
DOI：
10.1103/physreve.80.016105
复制
发表时间：
2009-07-01
影响因子：
2.4
通讯作者：
Lambiotte, R.
中科院分区：
文献类型：
--
作者：
Evans, T. S.;Lambiotte, R.
在本文中，我们使用网络链接的分区，以发现其社区结构。这种方法使社区可以在节点重叠，以便节点可能在一个以上的社区中。我们通过对原始网络的线路图进行节点分区来做到这一点。通过这种方式，我们表明，任何产生节点分区的算法都可以用于产生链接的分区。我们讨论了程度异质性的作用，并提出了列表图的加权版本，以说明这一点。
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.