TY - JOUR
T1 - Line graphs, link partitions, and overlapping communities
AU - Evans, T.S.
AU - Lambiotte, R.
N1 - Copyright 2009 Elsevier B.V., All rights reserved.
PY - 2009/8/6
Y1 - 2009/8/6
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=68949093647&partnerID=8YFLogxK
U2 - 10.1103/PhysRevE.80.016105
DO - 10.1103/PhysRevE.80.016105
M3 - Article
AN - SCOPUS:68949093647
SN - 1539-3755
VL - 80
JO - Physical Review E - Statistical, Nonlinear, and Soft Matter Physics
JF - Physical Review E - Statistical, Nonlinear, and Soft Matter Physics
IS - 1
ER -