Clique graphs and overlapping communities
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.
- Publication:
-
Journal of Statistical Mechanics: Theory and Experiment
- Pub Date:
- December 2010
- DOI:
- arXiv:
- arXiv:1009.0638
- Bibcode:
- 2010JSMTE..12..037E
- Keywords:
-
- Physics - Physics and Society;
- Computer Science - Social and Information Networks;
- Physics - Data Analysis;
- Statistics and Probability
- E-Print:
- 23 pages plus 16 additional pages in appendices