A large body of work has been devoted to identifying community structure in networks. A community is often though of as a set of nodes that has more connections between its members than to the remainder of the network. In this paper, we characterize as a function of size the statistical and structural properties of such sets of nodes. 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, and we study over 70 large sparse real-world networks taken from a wide range of application domains. Our results suggest a significantly more refined picture of community structure in large real-world networks than has been appreciated previously.
%0 Conference Paper
%1 citeulike:3041176
%A Leskovec, Jure
%A Lang, Kevin J.
%A Dasgupta, Anirban
%A Mahoney, Michael W.
%B WWW '08: Proceeding of the 17th international conference on World Wide Web
%C New York, NY, USA
%D 2008
%I ACM
%K community social-networks
%P 695--704
%R 10.1145/1367497.1367591
%T Statistical properties of community structure in large social and information networks
%U http://dx.doi.org/10.1145/1367497.1367591
%X A large body of work has been devoted to identifying community structure in networks. A community is often though of as a set of nodes that has more connections between its members than to the remainder of the network. In this paper, we characterize as a function of size the statistical and structural properties of such sets of nodes. 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, and we study over 70 large sparse real-world networks taken from a wide range of application domains. Our results suggest a significantly more refined picture of community structure in large real-world networks than has been appreciated previously.
%@ 978-1-60558-085-2
@inproceedings{citeulike:3041176,
abstract = {A large body of work has been devoted to identifying community structure in networks. A community is often though of as a set of nodes that has more connections between its members than to the remainder of the network. In this paper, we characterize as a function of size the statistical and structural properties of such sets of nodes. 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, and we study over 70 large sparse real-world networks taken from a wide range of application domains. Our results suggest a significantly more refined picture of community structure in large real-world networks than has been appreciated previously.},
added-at = {2010-02-08T15:52:27.000+0100},
address = {New York, NY, USA},
author = {Leskovec, Jure and Lang, Kevin J. and Dasgupta, Anirban and Mahoney, Michael W.},
biburl = {https://www.bibsonomy.org/bibtex/2d7436629c98d67612d05e266d2d1a713/cgrimal},
booktitle = {WWW '08: Proceeding of the 17th international conference on World Wide Web},
citeulike-article-id = {3041176},
citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1367591},
citeulike-linkout-1 = {http://dx.doi.org/10.1145/1367497.1367591},
doi = {10.1145/1367497.1367591},
interhash = {bc045e97ea475cc40e25983c2261215d},
intrahash = {d7436629c98d67612d05e266d2d1a713},
isbn = {978-1-60558-085-2},
keywords = {community social-networks},
location = {Beijing, China},
pages = {695--704},
posted-at = {2008-08-13 13:10:24},
priority = {2},
publisher = {ACM},
timestamp = {2010-02-08T15:52:27.000+0100},
title = {Statistical properties of community structure in large social and information networks},
url = {http://dx.doi.org/10.1145/1367497.1367591},
year = 2008
}