Finding overlapping communities in networks by label propagation

Details Finding overlapping communities in networks by label propagation Finding overlapping communities in networks by label propagation

2009-10-28

arxiv.org/abs/0910.5516v3

New J. Phys. 12 103018 (2010)

Physics

Physics and Society

Scientific paper

10.1088/1367-2630/12/10/103018

We propose an algorithm for finding overlapping community structure in very large networks. The algorithm is based on the label propagation technique of Raghavan, Albert, and Kumara, but is able to detect communities that overlap. Like the original algorithm, vertices have labels that propagate between neighbouring vertices so that members of a community reach a consensus on their community membership. Our main contribution is to extend the label and propagation step to include information about more than one community: each vertex can now belong to up to v communities, where v is the parameter of the algorithm. Our algorithm can also handle weighted and bipartite networks. Tests on an independently designed set of benchmarks, and on real networks, show the algorithm to be highly effective in recovering overlapping communities. It is also very fast and can process very large and dense networks in a short time.

Affiliated with

Also associated with

No associations

Rating

Finding overlapping communities in networks by label propagation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Finding overlapping communities in networks by label propagation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding overlapping communities in networks by label propagation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-404159