Performance of modularity maximization in practical contexts.

By Benjamin H. Good, Y. de Montjoye, Aaron Clauset. Physical review. E, Statistical, nonlinear, and soft matter physics, 2009

968 citations recorded by the source corpus.

Although widely used in practice, the behavior and accuracy of the popular module identification technique called modularity maximization is not well understood in practical contexts. Here, we present a broad characterization of its performance in such situations. First, we revisit and clarify the resolution limit phenomenon for modularity maximization. Second, we show that the modularity function Q exhibits extreme degeneracies: it typically admits an exponential number of distinct high-scoring solutions and typically lacks a clear global maximum. Third, we derive the limiting behavior of the maximum modularity Qmax for one model of infinitely modular networks, showing that it depends strongly both on the size of the network and on the number of modules it contains. Finally, using three real-world metabolic networks as examples, we show that the degenerate solutions can fundamentally disagree on many, but not all, partition properties such as the composition of the largest modules and the distribution of module sizes. These results imply that the output of any modularity maximization procedure should be interpreted cautiously in scientific contexts. They also explain why many heuristics are often successful at finding high-scoring partitions in practice and why different heuristics can disagree on the modular structure of the same network. We conclude by discussing avenues for mitigating some of these behaviors, such as combining information from many degenerate solutions or using generative models.

Subfields: Computational Theory and Mathematics, Molecular Biology

View Paper: https://www.semanticscholar.org/paper/2b08ec87801de2ec614cbbc881a74e1e820c13cf

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

  1. Santo Fortunato
  2. Tiago P. Peixoto
  3. Hocine Cherifi
  4. Renaud Lambiotte
  5. Olaf Sporns
  6. Darko Hric
  7. M. A. Porter
  8. Aaron Clauset

In Molecular Biology

  1. Olaf Sporns
  2. Hocine Cherifi
  3. M. A. Porter
  4. Renaud Lambiotte
  5. Santo Fortunato
  6. Richard F. Betzel
  7. E. Bullmore
  8. Peter J. Mucha

Citations in the corpus