Revising the Newman-Girvan Algorithm

Abstract: One of the common approaches for the community detection in complex networks is the Girvan-Newman algorithm [5] which is based on repeated deletion of edges having the maximum edge betweenness centrality. Although widely used, it may result in different dendrograms of hierarchies of communities if there are several edges eligible for removal (see [6]) thus leaving an ambiguous formation of network subgroups. We will present possible ways to overcome these issues using, instead of edge betweenness computation for single edges, the group edge betweenness for subsets of edges to be subjects of removal.

[1]  Tomás Madaras,et al.  Betweenness Centrality in Graphs , 2014 .

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

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

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

[5]  W. Kantor,et al.  New prolific constructions of strongly regular graphs , 2002 .

[6]  Damir Vukicevic,et al.  Community structure in networks: Girvan-Newman algorithm improvement , 2014, 2014 37th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO).