Think locally, act locally: Detection of small, medium-sized, and large communities in large networks

被引:91
作者
Jeub, Lucas G. S. [1 ]
Balachandran, Prakash [2 ,3 ]
Porter, Mason A. [1 ,4 ]
Mucha, Peter J. [5 ]
Mahoney, Michael W. [6 ,7 ]
机构
[1] Univ Oxford, Math Inst, Oxford Ctr Ind & Appl Math, Oxford OX2 6GG, England
[2] Morgan Stanley, Montreal, PQ H3C 3S4, Canada
[3] Boston Univ, Dept Math & Stat, Boston, MA 02215 USA
[4] Univ Oxford, CABDyN Complex Ctr, Oxford OX1 1HP, England
[5] Univ N Carolina, Dept Math, Carolina Ctr Interdisciplinary Appl Math, Chapel Hill, NC 27599 USA
[6] Int Comp Sci Inst, Berkeley, CA 94704 USA
[7] Univ Calif Berkeley, Dept Stat, Berkeley, CA 94720 USA
基金
英国工程与自然科学研究理事会;
关键词
SMALL-WORLD; SOCIAL NETWORK; DYNAMICS; GRAPHS; MULTISCALE;
D O I
10.1103/PhysRevE.91.012821
中图分类号
O35 [流体力学]; O53 [等离子体物理学];
学科分类号
070204 ; 080103 ; 080704 ;
摘要
It is common in the study of networks to investigate intermediate-sized (or "meso-scale") features to try to gain an understanding of network structure and function. For example, numerous algorithms have been developed to try to identify "communities,"which are typically construed as sets of nodes with denser connections internally than with the remainder of a network. In this paper, we adopt a complementary perspective that communities are associated with bottlenecks of locally biased dynamical processes that begin at seed sets of nodes, and we employ several different community-identification procedures (using diffusion-based and geodesic-based dynamics) to investigate community quality as a function of community size. Using several empirical and synthetic networks, we identify several distinct scenarios for "size-resolved community structure" that can arise in real (and realistic) networks: (1) the best small groups of nodes can be better than the best large groups (for a given formulation of the idea of a good community); (2) the best small groups can have a quality that is comparable to the best medium-sized and large groups; and (3) the best small groups of nodes can be worse than the best large groups. As we discuss in detail, which of these three cases holds for a given network can make an enormous difference when investigating and making claims about network community structure, and it is important to take this into account to obtain reliable downstream conclusions. Depending on which scenario holds, one may or may not be able to successfully identify "good" communities in a given network (and good communities might not even exist for a given community quality measure), the manner in which different small communities fit together to form meso-scale network structures can be very different, and processes such as viral propagation and information diffusion can exhibit very different dynamics. In addition, our results suggest that, for many large realistic networks, the output of locally biased methods that focus on communities that are centered around a given seed node (or set of seed nodes) might have better conceptual grounding and greater practical utility than the output of global community-detection methods. They also illustrate structural properties that are important to consider in the development of better benchmark networks to test methods for community detection.
引用
收藏
页数:29
相关论文
共 121 条
[11]  
Backstrom L, 2012, PROCEEDINGS OF THE 3RD ANNUAL ACM WEB SCIENCE CONFERENCE, 2012, P33
[12]   Evaluating local community methods in networks [J].
Bagrow, James P. .
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2008,
[13]   Local method for detecting communities [J].
Bagrow, JP ;
Bollt, EM .
PHYSICAL REVIEW E, 2005, 72 (04)
[14]   Efficient and principled method for detecting communities in networks [J].
Ball, Brian ;
Karrer, Brian ;
Newman, M. E. J. .
PHYSICAL REVIEW E, 2011, 84 (03)
[15]  
Bar-Joseph Z, 2001, Bioinformatics, V17, pS22, DOI [10.1093/bioinformatics/17.suppl1.S22, DOI 10.1093/BIOINFORMATICS/17.SUPPL_1.S22, DOI 10.1093/BIOINFORMATICS/17.SUPPL1.S22]
[16]   Taming complexity [J].
Barabási, AL .
NATURE PHYSICS, 2005, 1 (02) :68-70
[17]   The Architecture of complexity [J].
Barabasi, Albert-Lashlo .
IEEE CONTROL SYSTEMS MAGAZINE, 2007, 27 (04) :33-42
[18]   Task-Based Core-Periphery Organization of Human Brain Dynamics [J].
Bassett, Danielle S. ;
Wymbs, Nicholas F. ;
Rombach, M. Puck ;
Porter, Mason A. ;
Mucha, Peter J. ;
Grafton, Scott T. .
PLOS COMPUTATIONAL BIOLOGY, 2013, 9 (09)
[19]   Robust detection of dynamic community structure in networks [J].
Bassett, Danielle S. ;
Porter, Mason A. ;
Wymbs, Nicholas F. ;
Grafton, Scott T. ;
Carlson, Jean M. ;
Mucha, Peter J. .
CHAOS, 2013, 23 (01)
[20]   Influence of network topology on sound propagation in granular materials [J].
Bassett, Danielle S. ;
Owens, Eli T. ;
Daniels, Karen E. ;
Porter, Mason A. .
PHYSICAL REVIEW E, 2012, 86 (04)