Mobility

Finding Overlapping Communities in Networks by Label Propagation

Free registration required

Executive Summary

The authors 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. The 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. The algorithm can also handle weighted and bipartite networks.

  • Format: PDF
  • Size: 287.04 KB