Defining Least Community as a Homogeneous Group in Complex Networks

This paper introduces a new concept of least community that is as homogeneous as a random graph, and develops a new community detection algorithm from the perspective of homogeneity or heterogeneity. Based on this concept, we adopt head/tail breaks–a newly developed classification scheme for data with a heavy-tailed distribution–and rely on edge betweenness given its heavy-tailed distribution to iteratively partition a network into many heterogeneous and homogeneous communities. Surprisingly, the derived communities for any self-organized and/or self-evolved large networks demonstrate very striking power laws, implying that there are far more small communities than large ones. This notion of far more small things than large ones constitutes a new fundamental way of thinking for community detection.

[1]  Bin Jiang Head/tail breaks for visualization of city structure and dynamics , 2015 .

[2]  Paul Erdös,et al.  On random graphs, I , 1959 .

[3]  Jure Leskovec,et al.  Friendship and mobility: user movement in location-based social networks , 2011, KDD.

[4]  Stuart A. Rice,et al.  The Identification of Blocs in Small Political Bodies , 1927, American Political Science Review.

[5]  Shi Zhou,et al.  Structural constraints in complex networks , 2007, physics/0702096.

[6]  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.

[7]  Bin Jiang Head/tail Breaks for Visualization of City Structure and Dynamics , 2016 .

[8]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[9]  Bin Jiang,et al.  Topological Structure of Urban Street Networks from the Perspective of Degree Correlations , 2013, ArXiv.

[10]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[11]  B. Jiang Head/Tail Breaks: A New Classification Scheme for Data with a Heavy-Tailed Distribution , 2012, 1209.2801.

[12]  G. Jenks The Data Model Concept in Statistical Mapping , 1967 .

[13]  J. MacQueen Some methods for classification and analysis of multivariate observations , 1967 .

[14]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[15]  Mark E. J. Newman,et al.  Power-Law Distributions in Empirical Data , 2007, SIAM Rev..

[16]  Markus Brede,et al.  Networks—An Introduction. Mark E. J. Newman. (2010, Oxford University Press.) $65.38, £35.96 (hardcover), 772 pages. ISBN-978-0-19-920665-0. , 2012, Artificial Life.

[17]  Bin Jiang,et al.  The Evolution of Natural Cities from the Perspective of Location-Based Social Media , 2014, Digital Social Networks and Travel Behaviour in Urban Environments.

[18]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

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

[20]  B. Jiang,et al.  Ht-Index for Quantifying the Fractal or Scaling Structure of Geographic Features , 2013, 1305.0883.

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

[22]  Reuven Cohen,et al.  Complex Networks: Structure, Robustness and Function , 2010 .