What are the differences between community detection algorithms in igraph?
Here is a short summary about the community detection algorithms currently implemented in igraph: edge.betweenness.community is a hierarchical decomposition process where edges are removed in the decreasing order of their edge betweenness scores (i.e. the number of shortest paths that pass through a given edge). This is motivated by the fact that edges connecting different … Read more