Detecting highly overlapping community structure by greedy clique expansion

Understand

In complex networks it is common for each node to belong to several communities, implying a highly overlapping community structure.

• Recent advances in benchmarking indicate that existing community assignment algorithms that are capable of detecting overlapping communities perform well only when the extent of community overlap is kept to modest levels.
• To overcome this limitation, we introduce a new community assignment algorithm called Greedy Clique Expansion (GCE).
• The algorithm identifies distinct cliques as seeds and expands these seeds by greedily optimizing a local fitness function.