标题： 链接社区的映射方程 显示英文标题

标题： Map equation for link community

摘要： 社区结构存在于许多现实世界的网络中，并且已被报道与网络的几个功能属性相关。传统方法是将节点划分为社区，而一些最近的研究开始划分链接而不是节点，以高效地找到节点的重叠社区。我们扩展了地图方程方法，该方法最初是为节点社区开发的，以在网络中找到链接社区。该方法在各种类型的网络上进行了测试，并与网络的元数据进行了比较，结果表明我们的方法可以有效识别节点的重叠角色。该方法的优势在于，可以通过测量网络中除了社区结构之外的未知信息，定量比较节点社区方案和链接社区方案。它可以用来定量决定是否应该使用链接社区方案代替节点社区方案。此外，由于该方法基于随机游走，因此可以很容易地扩展到有向和加权网络。 显示英文摘要

摘要： Community structure exists in many real-world networks and has been reported being related to several functional properties of the networks. The conventional approach was partitioning nodes into communities, while some recent studies start partitioning links instead of nodes to find overlapping communities of nodes efficiently. We extended the map equation method, which was originally developed for node communities, to find link communities in networks. This method is tested on various kinds of networks and compared with the metadata of the networks, and the results show that our method can identify the overlapping role of nodes effectively. The advantage of this method is that the node community scheme and link community scheme can be compared quantitatively by measuring the unknown information left in the networks besides the community structure. It can be used to decide quantitatively whether or not the link community scheme should be used instead of the node community scheme. Furthermore, this method can be easily extended to the directed and weighted networks since it is based on the random walk.