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.
Line graphs, link partitions, and overlapping communities.
Published 2009 in Physical review. E, Statistical, nonlinear, and soft matter physics
ABSTRACT
PUBLICATION RECORD
- Publication year
2009
- Venue
Physical review. E, Statistical, nonlinear, and soft matter physics
- Publication date
2009-03-12
- Fields of study
Mathematics, Physics, Computer Science, Medicine
- Identifiers
- External record
- Source metadata
Semantic Scholar, PubMed
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-26 of 26 references · Page 1 of 1