Phys. Rev. E 80, 016105 (2009) [8 pages]
Line graphs, link partitions, and overlapping communitiesReceived 12 March 2009; published 9 July 2009 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. © 2009 The American Physical Society URL:
http://link.aps.org/doi/10.1103/PhysRevE.80.016105
DOI:
10.1103/PhysRevE.80.016105
PACS:
89.75.−k, 02.50.Le, 05.50.+q, 75.10.Hk
|
|
About | Terms and Conditions | Subscriptions | Search | Help
Use of the American Physical Society websites and journals implies that the user has read and agrees to our Terms and Conditions and any applicable Subscription Agreement. Physical Review®, Physical Review Letters®, Reviews of Modern Physics®, and Physical Review Special Topics® are trademarks of the American Physical Society.