An information-theoretic framework for resolving community structure in complex networks

Preprint
Publisher Website
Google Scholar
  • 5 December 2006
Abstract
This paper develops a rigorous foundation for the concept of modularity in networks. We present an explicit method to best partition a complex network by finding an optimal compression of its topology, capitalizing on regularities in its structure. To illustrate the power of our approach, we partition a number of real-world and model networks and explain why our results outperform other methods.

This publication has 0 references indexed in Scilit: