We propose a novel algorithm for the hierarchical clustering of graphs. The algorithm is a simple but key modification of the Louvain algorithm based on some sliding-resolution scheme. In particular, the most relevant clusterings, corresponding to different resolutions, are identified. The algorithm is parameter-free, fast and memory efficient. Numerical experiments on both synthetic and real datasets show the performance of the algorithm.
Joint work with Thomas Bonald (Telecom ParisTech), Alexandre Hollocou (Inria), Alexis Galland (Inria)