Table 1. Details of the algorithms used in this study. A description of the strategies implemented by the algorithms and the corresponding references are indicated.

Name of the Algorithm	Strategy used by the algorithm	References
Blondel	Multilevel modularity maximization	34
CNM	Greedy modularity maximization	28
CPM	Multiresolution Potts model	25
DM	Spectral analysis + modularity maximization	35
EO	Modularity maximization	36
HAC	Maximum Likelihood	37
Infomap	Information compression	20
LPA	Label propagation	22
MCL	Simulated flow	23
MSG + VM	Greedy modularity maximization + refinement	27
RB	Multiresolution Potts model	21
RN	Multiresolution Potts model	24
RNSC	Neighborhood tabu search	30
SAVI	Optimal prediction for random walks	26
SCluster	Consensus Hierarchical Clustering + Surprise maximization	29
UVCluster	Consensus Hierarchical Clustering + Surprise maximization	29,31
Walktrap	Random walks + modularity maximization	38