Clique Graphs and Overlapping Communities

TL;DR

This paper introduces a method to construct clique graphs that effectively identify overlapping communities in networks, outperforming traditional vertex partition methods on benchmark tests.

Contribution

It presents a novel approach to representing cliques as vertices in a weighted graph, enabling better detection of overlapping communities.

Findings

Clique graphs accurately detect overlapping communities

Vertex partition methods fail on benchmark networks

Weighted clique graphs improve community detection

Abstract

It is shown how to construct a clique graph in which properties of cliques of a fixed order in a given graph are represented by vertices in a weighted graph. Various definitions and motivations for these weights are given. The detection of communities or clusters is used to illustrate how a clique graph may be exploited. In particular a benchmark network is shown where clique graphs find the overlapping communities accurately while vertex partition methods fail.