2014/06/10 by Romain Campigotto, Campigotto, Romain, Patricia Conde Céspedes +3 · 1 citation
Computer Science · Physics and Astronomy · #Applications (stat.AP) #Complex Network Analysis Techniques #FOS: Computer and information sciences #FOS: Physical sciences #G.2.2 #G.4 #I.5.3 #Network Security and Intrusion Detection #Opinion Dynamics and Social Influence #Physics and Society (physics.soc-ph) #Social and Information Networks (cs.SI)
paper · pdf · doi:10.48550/arxiv.1406.2518
openalex publication_date 2014/06/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Complex networks represent interactions between entities. They appear in various contexts such as sociology, biology, etc., and they generally contain highly connected subgroups called communities. Community detection is a well-studied problem and most of the algorithms aim to maximize the Newman-Girvan modularity function, the most popular being the Louvain method (it is well-suited on very large graphs). However, the classical modularity has many drawbacks: we can find partitions of high quality in graphs without community structure, e.g., on random graphs; it promotes large communities. Then, we have adapted the Louvain method to other quality functions. In this paper, we describe a generic version of the Louvain method. In particular, we give a sufficient condition to plug a quality function into it. We also show that global performance of this new version is similar to the classical Louvain algorithm, that promotes it to the best rank of the community detection algorithms.