Journal
PHYSICAL REVIEW E
Volume 80, Issue 1, Pages -Publisher
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevE.80.016105
Keywords
-
Categories
Funding
- Engineering and Physical Sciences Research Council [EP/E049451/1] Funding Source: researchfish
- EPSRC [EP/E049451/1] Funding Source: UKRI
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available