Partitioning Breaks Communities

Details Partitioning Breaks Communities Partitioning Breaks Communities

2011-05-26

arxiv.org/abs/1105.5344v1

Physics

Physics and Society

8 pages, 14 figures. Preprint of paper for ASONAM 11

Scientific paper

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 subgraph 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.

Affiliated with

Also associated with

No associations

Rating

Partitioning Breaks Communities does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Partitioning Breaks Communities, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Partitioning Breaks Communities will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-218265