6.3k citations · 8.6k across the 22 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
physics.soc-ph2015★ 131 cited
Faster unfolding of communities: speeding up the Louvain algorithm
V. A. Traag
Many complex networks exhibit a modular structure of densely connected groups of nodes. Usually, such a modular structure is uncovered by the optimization of some quality function.…
physics.soc-ph2015★ 113 cited
Detecting communities using asymptotical Surprise
V. A. Traag, R. Aldecoa, J-C. Delvenne
Nodes in real-world networks are repeatedly observed to form dense clusters, often referred to as communities. Methods to detect these groups of nodes usually maximize an objective…