Recognize Clique Communities

By definition, a clique is a very rigid and sensitive network structure. Removing an edge from a k-clique transforms it into two interwound, partially overlapping, adjacent (k-1)-cliques. In the figure, subgraphs Alpha--Delta and Alpha--Charlie, Echo are 4-cliques each, but the whole network is not a 5-clique, because the edge Delta--Echo is missing (I show it as a dashed line).


Intuitively, you may feel that all k nodes somehow belong together and the missing edge could have been a victim of a measurement or data entry error or improper slicing (Slice Weighted Networks) or conversion from a directed graph. Nonetheless, ...

Get Complex Network Analysis in Python now with O’Reilly online learning.

O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.