Clique Graphs and Overlapping Communities
Physics and Society
2011-01-04 v1 Social and Information Networks
Data Analysis, Statistics and Probability
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.
Cite
@article{arxiv.1009.0638,
title = {Clique Graphs and Overlapping Communities},
author = {T. S. Evans},
journal= {arXiv preprint arXiv:1009.0638},
year = {2011}
}
Comments
23 pages plus 16 additional pages in appendices