View article

Here we briefly review our information theoretic approach to revealing community structure in weighted and directed networks [1] and present a new fast stochastic and recursive search algorithm to minimize the map equation—the objective function of our method. We have developed this algorithm to be able to accurately partition the large number of bootstrap networks [2]. The search algorithm can also be generalized for other objective functions.