The structure of communities in scale‐free networks

Scale‐free networks are often used to model a wide range of real‐world networks, such as social, technological, and biological networks. Understanding the structure of scale‐free networks evolves into a big data problem for business, management, and protein function prediction. In the past decade, there has been a surge of interest in exploring the properties of scale‐free networks. Two interesting properties have attracted much attention: the assortative mixing and community structure. However, these two properties have been studied separately in either theoretical models or real‐world networks. In this paper, we show that the structural features of communities are highly related with the assortative mixing in scale‐free networks. According to the value of assortativity coefficient, scale‐free networks can be categorized into assortative, disassortative, and neutral networks, respectively. We systematically analyze the community structure in these three types of scale‐free networks through six metrics: node embeddedness, link density, hub dominance, community compactness, the distribution of community sizes, and the presence of hierarchical communities. We find that the three types of scale‐free networks exhibit significant differences in these six metrics of community structures. First, assortative networks present high embeddedness, meaning that many links lying within communities but few links lying between communities. This leads to the high link density of communities. Second, disassortative networks exhibit great hubs in communities, which results in the high compactness of communities that nodes can reach each other via short paths. Third, in neutral networks, a big portion of links act as community bridges, so they display sparse and less compact communities. In addition, we find that (dis)assortative networks show hierarchical community structure with power‐law‐distributed community sizes, while neutral networks present no hierarchy. Understanding the structure of communities from the angle of assortative mixing patterns of nodes can provide insights into the network structure and guide us in modeling information propagation in different categories of scale‐free networks. Copyright © 2016 John Wiley & Sons, Ltd.

[1]  Sune Lehmann,et al.  Link communities reveal multiscale complexity in networks , 2009, Nature.

[2]  P. Ronhovde,et al.  Multiresolution community detection for megascale networks by information-based replica correlations. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[4]  Filippo Menczer,et al.  Virality Prediction and Community Structure in Social Networks , 2013, Scientific Reports.

[5]  A. Barabasi,et al.  Lethality and centrality in protein networks , 2001, Nature.

[6]  K. Sneppen,et al.  Specificity and Stability in Topology of Protein Networks , 2002, Science.

[7]  Steve Gregory,et al.  Fuzzy overlapping communities in networks , 2010, ArXiv.

[8]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

[9]  Reka Albert,et al.  Mean-field theory for scale-free random networks , 1999 .

[10]  R. Carter.  11 – IT and society , 1991 .

[11]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[12]  F. Radicchi,et al.  Benchmark graphs for testing community detection algorithms. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  R. Tsien,et al.  Specificity and Stability in Topology of Protein Networks , 2022 .

[14]  A. Barabasi,et al.  Hierarchical Organization of Modularity in Metabolic Networks , 2002, Science.

[15]  Jari Saramäki,et al.  Characterizing the Community Structure of Complex Networks , 2010, PloS one.

[16]  K. Goh,et al.  Betweenness centrality correlation in social networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  Munmun De Choudhury,et al.  Social Synchrony: Predicting Mimicry of User Actions in Online Social Media , 2009, 2009 International Conference on Computational Science and Engineering.

[18]  Dimitris Bertsimas,et al.  The Traffic Flow Management Rerouting Problem in Air Traffic Control: A Dynamic Network Flow Approach , 2000, Transp. Sci..

[19]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[20]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[21]  Mark Newman,et al.  Detecting community structure in networks , 2004 .

[22]  Chuanxing Li,et al.  The Dichotomy in Degree Correlation of Biological Networks , 2011, PloS one.

[23]  Martin Rosvall,et al.  Maps of random walks on complex networks reveal community structure , 2007, Proceedings of the National Academy of Sciences.

[24]  Kun Li,et al.  From sparse to dense and from assortative to disassortative in online social networks , 2013, Scientific Reports.

[25]  Beom Jun Kim,et al.  Growing scale-free networks with tunable clustering. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[26]  Jure Leskovec,et al.  Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters , 2008, Internet Math..

[27]  Mark A. Pitt,et al.  Advances in Minimum Description Length: Theory and Applications , 2005 .

[28]  A. Vespignani,et al.  The architecture of complex weighted networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[29]  Christos Faloutsos,et al.  Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.

[30]  Andrea Lancichinetti,et al.  Community detection algorithms: a comparative analysis: invited presentation, extended abstract , 2009, VALUETOOLS.

[31]  C. Lee Giles,et al.  Self-Organization and Identification of Web Communities , 2002, Computer.

[32]  M. Newman,et al.  Hierarchical structure and the prediction of missing links in networks , 2008, Nature.

[33]  Albert-László Barabási,et al.  Hierarchical organization in complex networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[34]  R. Guimerà,et al.  Functional cartography of complex metabolic networks , 2005, Nature.

[35]  M E J Newman.  Assortative mixing in networks. , 2002, Physical review letters.

[36]  J. Rissanen,et al.  Modeling By Shortest Data Description* , 1978, Autom..

[37]  Ying Fan,et al.  Cascading failures in complex networks with community structure , 2014 .

[38]  Santo Fortunato,et al.  Finding Statistically Significant Communities in Networks , 2010, PloS one.

[39]  Albert-László Barabási,et al.  Scale-Free Networks: A Decade and Beyond , 2009, Science.

[40]  Richard M. Karp,et al.  Algorithms for graph partitioning on the planted partition model , 2001, Random Struct. Algorithms.

[41]  B. Wellman,et al.  Networks, Neighborhoods, and Communities , 1979 .