Discovering Communities through Friendship

We introduce a new method for detecting communities of arbitrary size in an undirected weighted network. Our approach is based on tracing the path of closest‐friendship between nodes in the network using the recently proposed Generalized Erds Numbers. This method does not require the choice of any arbitrary parameters or null models, and does not suffer from a system‐size resolution limit. Our closest‐friend community detection is able to accurately reconstruct the true network structure for a large number of real world and artificial benchmarks, and can be adapted to study the multi‐level structure of hierarchical communities as well. We also use the closeness between nodes to develop a degree of robustness for each node, which can assess how robustly that node is assigned to its community. To test the efficacy of these methods, we deploy them on a variety of well known benchmarks, a hierarchal structured artificial benchmark with a known community and robustness structure, as well as real‐world networks of coauthorships between the faculty at a major university and the network of citations of articles published in Physical Review. In all cases, microcommunities, hierarchy of the communities, and variable node robustness are all observed, providing insights into the structure of the network.

[1]  Andrea Lancichinetti,et al.  Detecting the overlapping and hierarchical community structure in complex networks , 2008, 0802.1218.

[2]  Roger Guimerà,et al.  Extracting the hierarchical organization of complex systems , 2007, Proceedings of the National Academy of Sciences.

[3]  J. Reichardt,et al.  Statistical mechanics of community detection. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Kevin E. Bassler,et al.  Improved community structure detection using a modified fine-tuning strategy , 2009, ArXiv.

[5]  Fang Wu,et al.  Finding communities in linear time: a physics approach , 2003, ArXiv.

[6]  Mark E. J. Newman,et al.  Stochastic blockmodels and community structure in networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  Alex Arenas,et al.  Analysis of the structure of complex networks at different resolution levels , 2007, physics/0703218.

[8]  K. Kaski,et al.  Limited resolution in complex network community detection with Potts model approach , 2006 .

[9]  Jon M. Kleinberg,et al.  The link-prediction problem for social networks , 2007, J. Assoc. Inf. Sci. Technol..

[10]  Gábor Csárdi,et al.  The igraph software package for complex network research , 2006 .

[11]  Lakshminarayanan Mahadevan,et al.  Asymmetric network connectivity using weighted harmonic averages , 2011 .

[12]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

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

[14]  Lada A. Adamic,et al.  Friends and neighbors on the Web , 2003, Soc. Networks.

[15]  Sidney Redner,et al.  Community structure of the physical review citation network , 2009, J. Informetrics.

[16]  A. Clauset.  Finding local community structure in networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  J. Schilperoord,et al.  Linguistics , 1999 .

[18]  Roger Guimerà,et al.  Module identification in bipartite and directed networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  F. Copleston.  History of Philosophy , 1980 .

[20]  E. D. Dahlberg.  Proceedings of the Thirty-fifth Annual Conference on Magnetism and Magnetic Materials, October 29-November 1, 1990, San Diego, California , 1991 .

[21]  Mark Gerstein,et al.  Comparing genomes to computer operating systems in terms of the topology and evolution of their regulatory control networks , 2010, Proceedings of the National Academy of Sciences.

[22]  S. Feld.  Why Your Friends Have More Friends Than You Do , 1991, American Journal of Sociology.

[23]  S. Fortunato,et al.  Statistical physics of social dynamics , 2007, 0710.3256.

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

[25]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[27]  M. Newman,et al.  Epidemics and percolation in small-world networks. , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[28]  S. Redner.  Citation statistics from 110 years of physical review , 2005, physics/0506056.

[29]  S. Fortunato,et al.  Resolution limit in community detection , 2006, Proceedings of the National Academy of Sciences.

[30]  C. Peterson,et al.  Topological properties of citation and metabolic networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[31]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[32]  Mason A. Porter,et al.  Community Structure in the United States House of Representatives , 2007, ArXiv.

[33]  Massimo Marchiori,et al.  Error and attacktolerance of complex network s , 2004 .

[34]  A. Barabasi,et al.  Evolution of the social network of scientific collaborations , 2001, cond-mat/0104162.

[35]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

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

[37]  R. Guimerà,et al.  Modularity from fluctuations in random graphs and complex networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[38]  T. Millon,et al.  Personality and social psychology , 2003 .

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

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

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

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