Targeted Community Merging provides an efficient comparison between collaboration clusters and departmental partitions

Community detection theory is vital for the structural analysis of many types of complex networks, especially for human-like collaboration networks. In this work, we present a new community detection algorithm, the Targeted Community Merging algorithm, based on the well-known Girvan–Newman algorithm, which allows obtaining community partitions with high values of modularity and a small number of communities. We then perform an analysis and comparison between the departmental and community structure of scientific collaboration networks within the University of Zaragoza. Thus, we draw valuable conclusions from the inter- and intra-departmental collaboration structure that could be useful to take decisions on an eventual departmental restructuring.