Fast Detecting Disjoint and Overlapping Community Structures

Fast Detecting Disjoint and Overlapping Community Structures

Many problems in reality take the forms of complex networks and their underlying organization exhibit the property of containing communities, i.e. groups of tightly internally-connected and sparsely externally-connected nodes in the network structure. Community detection is the problem of identifying those communities in a given network with or without extra information such as the number of communities, and with overlapping or non-overlapping communities.

Objectives:

  • Community detection methods are of great advantages in social-aware routing in MANETs and worm containment on social networks.