How to Choose Community Detection Methods in Complex Networks

Discovering community structure in complex networks is a mature field since a tremendous number of community detection methods have been introduced in the literature. Nevertheless, it is still very challenging for practitioners to choose in each particular case the most suitable algorithm which would provide the richest insights into the structure of the social network they study. Through a case study of the French crowdfunding platform, Ulule, this paper demonstrates an original methodology for the selection of a relevant algorithm. For this purpose we, firstly, compare the partitions of 11 well-known algorithms. Then, bivariate map based on hub dominance and transitivity is used to identify the partitions which unveil communities with the most interesting size and internal topologies. These steps result in three community detection methods relevant for our data. Finally, we add the socioeconomic indicators, meaningful in the framework of the crowdfunding platform, in order to select the most significant algorithm of community detection, and to analyze the cooperation patterns among the platform's users and their impact on success of fundraising campaigns. In line with previous socioeconomic studies, we demonstrate that the social concept of homophily in online groups really matters. In addition, our approach puts in light that crowdfunding groups may benefit from diversity.