Edge ratio and community structure in networks.

A hierarchical divisive algorithm is proposed for identifying communities in complex networks. To that effect, the definition of community in the weak sense of Radicchi [Proc. Natl. Acad. Sci. U.S.A. 101, 2658 (2004)] is extended into a criterion for a bipartition to be optimal: one seeks to maximize the minimum for both classes of the bipartition of the ratio of inner edges to cut edges. A mathematical program is used within a dichotomous search to do this in an optimal way for each bipartition. This includes an exact solution of the problem of detecting indivisible communities. The resulting hierarchical divisive algorithm is compared with exact modularity maximization on both artificial and real world data sets. For two problems of the former kind optimal solutions are found; for five problems of the latter kind the edge ratio algorithm always appears to be competitive. Moreover, it provides additional information in several cases, notably through the use of the dendrogram summarizing the resolution. Finally, both algorithms are compared on reduced versions of the data sets of Girvan and Newman [Proc. Natl. Acad. Sci. U.S.A. 99, 7821 (2002)] and of Lancichinetti [Phys. Rev. E 78, 046110 (2008)]. Results for these instances appear to be comparable.

[1]  David Kempe,et al.  Modularity-maximizing graph communities via mathematical programming , 2007, 0710.2533.

[2]  Jiguang WANG,et al.  Remarks on Network Community Properties , 2008, J. Syst. Sci. Complex..

[3]  Duanbing Chen,et al.  A fast and efficient heuristic algorithm for detecting community structures in complex networks , 2009 .

[4]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[5]  Fionn Murtagh,et al.  A Survey of Recent Advances in Hierarchical Clustering Algorithms , 1983, Comput. J..

[6]  J. V. Ryzin,et al.  Clustering Algorithms@@@Cluster Analysis Algorithms@@@Classification and Clustering , 1981 .

[7]  Peter J. Rousseeuw,et al.  Finding Groups in Data: An Introduction to Cluster Analysis , 1990 .

[8]  Tom A. B. Snijders,et al.  Social Network Analysis , 2011, International Encyclopedia of Statistical Science.

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

[10]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[11]  October I.  Physical Review Letters , 2022 .

[12]  Juan Mei,et al.  Revealing network communities through modularity maximization by a contraction–dilation method , 2009 .

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

[14]  O. Bagasra,et al.  Proceedings of the National Academy of Sciences , 1914, Science.

[15]  Rynson W. H. Lau,et al.  Knowledge and Data Engineering for e-Learning Special Issue of IEEE Transactions on Knowledge and Data Engineering , 2008 .

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

[17]  Eric V. Denardo,et al.  Flows in Networks , 2011 .

[18]  Yan Qing Niu,et al.  Detecting the community structure in complex networks based on quantum mechanics , 2008 .

[19]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[20]  D. Parisi,et al.  Self-contained algorithms to detect communities in networks , 2004 .

[21]  B. Jaumard,et al.  Efficient algorithms for divisive hierarchical clustering with the diameter criterion , 1990 .

[22]  John Scott.  What is social network analysis , 2010 .

[23]  Donald E. Knuth,et al.  The Stanford GraphBase - a platform for combinatorial computing , 1993 .

[24]  Amedeo Caflisch,et al.  Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[25]  Wendy R. Fox,et al.  Finding Groups in Data: An Introduction to Cluster Analysis , 1991 .

[26]  Claudio Castellano,et al.  Defining and identifying communities in networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.

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

[28]  Yoshiko Wakabayashi,et al.  A cutting plane algorithm for a clustering problem , 1989, Math. Program..

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

[30]  김삼묘,et al.  “Bioinformatics” 특집을 내면서 , 2000 .

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

[32]  M. Barber,et al.  Detecting network communities by propagating labels under constraints. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[33]  A. Châtelain,et al.  The European Physical Journal D , 1999 .

[34]  Hristo Djidjev,et al.  A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection , 2007, WAW.

[35]  J. Edwards.  Biomathematics , 1972 .

[36]  Pierre Hansen,et al.  Cluster analysis and mathematical programming , 1997, Math. Program..

[37]  Pierre Hansen,et al.  Bicriterion Cluster Analysis , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[38]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[39]  J. Brown.  Behavioral Ecology and Sociobiology , 2019, Encyclopedia of Animal Behavior.

[40]  John A. Hartigan,et al.  Clustering Algorithms , 1975 .

[41]  Z. Di,et al.  Accuracy and precision of methods for community identification in weighted networks , 2006, physics/0607271.

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

[43]  IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2 Algorithm 1 DKMeans , 2011 .

[44]  Lars Kai Hansen,et al.  Deterministic modularity optimization , 2007 .

[45]  Réka Albert,et al.  Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[46]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[47]  Jerrold W. Grossman,et al.  Famous trails to Paul Erdős , 1999 .

[48]  I. Hargittai,et al.  The mathematical intelligencer , 2008 .

[49]  Linyuan Lu,et al.  Complex Graphs and Networks (CBMS Regional Conference Series in Mathematics) , 2006 .

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

[51]  V. Latora,et al.  Detecting complex network modularity by dynamical clustering. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

[54]  Sergei Maslov,et al.  Modularity and extreme edges of the internet. , 2003, Physical review letters.

[55]  R. Rosenfeld.  Nature , 2009, Otolaryngology--head and neck surgery : official journal of American Academy of Otolaryngology-Head and Neck Surgery.

[56]  A. Arenas,et al.  Community detection in complex networks using extremal optimization. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[57]  A. Schrijver.  A Course in Combinatorial Optimization , 1990 .

[58]  D. Steinley.  Journal of Classification , 2004, Vegetatio.

[59]  D. Lusseau,et al.  The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations , 2003, Behavioral Ecology and Sociobiology.

[60]  C. Q. Lee,et al.  The Computer Journal , 1958, Nature.

[61]  Jingchun Chen,et al.  Detecting functional modules in the yeast protein-protein interaction network , 2006, Bioinform..

[62]  M. R. Rao,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

[63]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[64]  F. Chung,et al.  Complex Graphs and Networks , 2006 .

[65]  Ulrik Brandes,et al.  On Modularity Clustering , 2008, IEEE Transactions on Knowledge and Data Engineering.

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

[67]  N. Stanietsky,et al.  The interaction of TIGIT with PVR and PVRL2 inhibits human NK cell cytotoxicity , 2009, Proceedings of the National Academy of Sciences.

[68]  Weixiong Zhang,et al.  Identifying network communities with a high resolution. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[69]  Lazaros G. Papageorgiou,et al.  Finding community structures in complex networks using mixed integer optimisation , 2007 .

[70]  O. William.  Journal Of The American Statistical Association V-28 , 1932 .

[71]  Zhongguo ke xue yuan.  Journal of systems science and complexity , 2001 .

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

[73]  Leon Danon,et al.  Comparing community structure identification , 2005, cond-mat/0505245.

[74]  Michael J. Todd,et al.  Mathematical programming , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..