2011 · 18 citations · 29 references
ComputingSociologyComplex SystemsKnowledge NetworksNetwork VisualizationCommunity DetectionCommunity StructureGraph AlgorithmsGraph TheoryNetwork CentralitySocial Network AnalysisClique AlgorithmsCliquesCommunity SplittingConnected Component AnalysisGraph PartitioningNetwork Community DetectionNetwork Community StructurePartitioning Algorithms
Considering a clique as a conservative definition of community structure, we examine how graph partitioning algorithms interact with cliques. Many popular community-finding algorithms partition the entire graph into non-overlapping communities. We show that on a wide range of empirical networks, from different domains, significant numbers of cliques are split across separate partitions, as produced by such algorithms. We examine the largest connected component of the sub graph formed by retaining only edges in cliques, and apply partitioning strategies that explicitly minimise the number of cliques split. We conclude that, due to the connectedness of many networks, any community finding algorithm that produces partitions must fail to find at least some significant structures. Moreover, contrary to traditional intuition, in some empirical networks, strong ties and cliques frequently do cross community boundaries.
29
Mark Granovetter · American Journal of Sociology · 1973 · 38.5K citations
Santo Fortunato · Physics Reports · 2009 · 11.3K citations · Full text
What is Twitter, a social network or a news media?
Haewoon Kwak, Changhyun Lee, Hosung Park et al. · 2010 · 6.7K citations · Full text
Uncovering the overlapping community structure of complex networks in nature and society
Gergely Palla, Imre Derényi, Illés J. Farkas et al. · Nature · 2005 · 5.4K citations · Full text