Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters Export

@article{citeulike:3391376, abstract = {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.}, archivePrefix = {arXiv}, author = {Leskovec, Jure and Lang, Kevin J. and Dasgupta, Anirban and Mahoney, Michael W.}, citeulike-article-id = {3391376}, citeulike-linkout-0 = {http://arxiv.org/abs/0810.1355}, citeulike-linkout-1 = {http://arxiv.org/pdf/0810.1355}, day = {8}, eprint = {0810.1355}, keywords = {cluster, clustering, community, network, networks}, month = {Oct}, posted-at = {2009-07-20 22:03:59}, priority = {2}, title = {Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters}, url = {http://arxiv.org/abs/0810.1355}, year = {2008} }

TY - JOUR ID - citeulike:3391376 L3 - citeulike-article-id:3391376 N2 - 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. TI - Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters KW - cluster KW - clustering KW - community KW - network KW - networks AU - Leskovec, Jure AU - Lang, Kevin AU - Dasgupta, Anirban AU - Mahoney, Michael PY - 2008/Oct/08/ UR - http://arxiv.org/abs/0810.1355 ER -