Doubly Stochastic Scaling Unifies Community Detection - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Doubly Stochastic Scaling Unifies Community Detection

(1) , (2) , (2)


Graph partitioning, or community detection, has been widely investigated in network science. Yet, the correct community structure on a given network is essentially data-driven. Thus, instead of a formal definition, diverse measures have been conceived to capture intuitive desirable properties shared by most of the community structures. In this work, we propose a preprocessing based on a doubly-stochastic scaling of network adjacency matrices, to highlight these desirable properties. By investigating a range of community detection measures, and carefully generalising them to doubly-stochastic graphs, we show that such a scaling unifies a whole category of these measures-namely, the so-called linear criteria-onto two unique measures to set up. Finally, to help practitioners setting up these measures, we provide an extensive numerical comparison of the capacity of these measures to uncover community structures within block stochastic models, using the Louvain algorithm.
Fichier principal
Vignette du fichier
Modularite.pdf (3.59 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03633062 , version 1 (06-04-2022)
hal-03633062 , version 2 (22-11-2022)



Luce Le Gorrec, Sandrine Mouysset, Daniel Ruiz. Doubly Stochastic Scaling Unifies Community Detection. 2022. ⟨hal-03633062v1⟩
42 View
17 Download



Gmail Facebook Twitter LinkedIn More