I work with community discovery in graphs. I went through various community discovery algorithms implemented in igraph and built a community structure. Now, having received a community object for different algorithms, I want to compare algorithms based on various measurements, such as density, reduction ratio, and coverage. (I know that modularity is already implemented). I can get a subgraph and then calculate the density inside the cluster, but find the density between the clusters, I donβt know how to do it. This is the code I used to determine the density inside the cluster:
karate <- graph.famous("Zachary") wckarate <- walktrap.community(karate)
In a similar way, I could act for each cluster and add all densities or take the average of all. My question is, if the number of communities is very large, then how to proceed?
And if I want to extract the number of edges between different communities, is there a good way to extract the number of edges?
Please forgive me if this question has already been asked. I am new to igraph and R.
source share