Computer Science – Data Structures and Algorithms
Scientific paper
2008-10-08
Computer Science
Data Structures and Algorithms
66 pages, a much expanded version of our WWW 2008 paper
Scientific paper
A large body of work has been devoted to defining and identifying clusters or communities in social and information networks. We explore from a novel perspective several questions related to identifying meaningful communities in large social and information networks, and we come to several striking conclusions. We employ approximation algorithms for the graph partitioning problem to characterize as a function of size the statistical and structural properties of partitions of graphs that could plausibly be interpreted as communities. In particular, we define the network community profile plot, which characterizes the "best" possible community--according to the conductance measure--over a wide range of size scales. We study over 100 large real-world social and information networks. Our results suggest a significantly more refined picture of community structure in large networks than has been appreciated previously. In particular, we observe tight communities that are barely connected to the rest of the network at very small size scales; and communities of larger size scales gradually "blend into" the expander-like core of the network and thus become less "community-like." This behavior is not explained, even at a qualitative level, by any of the commonly-used network generation models. Moreover, it is exactly the opposite of what one would expect based on intuition from expander graphs, low-dimensional or manifold-like graphs, and from small social networks that have served as testbeds of community detection algorithms. We have found that a generative graph model, in which new edges are added via an iterative "forest fire" burning process, is able to produce graphs exhibiting a network community profile plot similar to what we observe in our network datasets.
Dasgupta Anirban
Lang Kevin J.
Leskovec Jure
Mahoney Michael W.
No associations
LandOfFree
Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters 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 Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-29621