I would like to know if there is a known problem with the Leiden algorithm implemented by igraph. When I run it, it generates partitions with too many communities compared to other similar algorithms (even with the leiden implemented by other packages). Even affecting the resolution parameter it generates a large number of communities.
library(igraph)
library(leidenAlg)
G <- graph_from_literal(1-2:3-4:5-6:7-8:9-10:11-12-13-14:15-16,1-7,10:8-13)
clLouv <- cluster_louvain(G)
clLeid <- cluster_leiden(G, resolution_parameter = .5)
cl_Leid_r <- find_partition_with_rep(G, edge_weights=E(G))
clLouv$membership
clLeid$membership
cl_Leid_r
Thanks
I have satisfactory results with the density of the adjacency matrix as the resolution parameter.
For example.
This gives a result very similar to the Louvain method.
Update, Verify the modularity as follows: