All geek questions in one place

Fast algorithm for detecting community structure in networks in gambling

I would like to know if, in the igraph-R package, the modularization-based clustering community search algorithm published by Newman in 2004 is available: “The fast community structure discovery algorithm in networks” is not implemented, is there an easy way to do this?

thank

+4
source share
1 answer

The modMax package on CRAN has a function called "greedy" that implements an algorithm that will give the same results. This method was introduced in a 2004 article by Klaus, Newman, and Moore (“Finding Community Structures in Very Large Networks”) as a modification to improve the speed of the original algorithm in the list that you specified.

+1
source

Source: https://habr.com/ru/post/1648771/

More articles:


All Articles