Clique Graphs and Overlapping Communities
arXiv:1009.0638 · doi:10.1088/1742-5468/2010/12/P12037
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.
23 pages plus 16 additional pages in appendices
References in corpus (16)
- Fast unfolding of communities in large networks
- Uncovering the overlapping community structure of complex networks in nature and society
- Maps of random walks on complex networks reveal community structure
- Statistical Mechanics of Community Detection
- Detecting the overlapping and hierarchical community structure of complex networks
- Multirelational Organization of Large-scale Social Networks in an Online World
- Line Graphs, Link Partitions and Overlapping Communities
- Extending the definition of modularity to directed graphs with overlapping communities
- Modularity-Maximizing Network Communities via Mathematical Programming
- Weighted network modules
- A sequential algorithm for fast clique percolation
- Emergence of communities in weighted networks
- Directed network modules
- Exact Solution for the Time Evolution of Network Rewiring Models
- Detection of node group membership in networks with group overlap
- Structure of n-clique networks embedded in a complex network