Advertisement

The European Physical Journal Special Topics

, Volume 178, Issue 1, pp 13–23 | Cite as

The map equation

  • M. RosvallEmail author
  • D. Axelsson
  • C. T. Bergstrom
Article

Abstract

Many real-world networks are so large that we must simplify their structure before we can extract useful information about the systems they represent. As the tools for doing these simplifications proliferate within the network literature, researchers would benefit from some guidelines about which of the so-called community detection algorithms are most appropriate for the structures they are studying and the questions they are asking. Here we show that different methods highlight different aspects of a network's structure and that the the sort of information that we seek to extract about the system must guide us in our decision. For example, many community detection algorithms, including the popular modularity maximization approach, infer module assignments from an underlying model of the network formation process. However, we are not always as interested in how a system's network structure was formed, as we are in how a network's extant structure influences the system's behavior. To see how structure influences current behavior, we will recognize that links in a network induce movement across the network and result in system-wide interdependence. In doing so, we explicitly acknowledge that most networks carry flow. To highlight and simplify the network structure with respect to this flow, we use the map equation. We present an intuitive derivation of this flow-based and information-theoretic method and provide an interactive on-line application that anyone can use to explore the mechanics of the map equation. The differences between the map equation and the modularity maximization approach are not merely conceptual. Because the map equation attends to patterns of flow on the network and the modularity maximization approach does not, the two methods can yield dramatically different results for some network structures. To illustrate this and build our understanding of each method, we partition several sample networks. We also describe an algorithm and provide source code to efficiently decompose large weighted and directed networks based on the map equation.

Keywords

European Physical Journal Special Topic Community Detection Persistence Time Network Partition Community Detection Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Girvan M., Newman M.E.J., Proc. Natl. Acad. Sci. USA 99, 7821 (2002)Google Scholar
  2. G. Palla, I. Derényi, I. Farkas, T. Vicsek, Nature 435, 814 (2005)Google Scholar
  3. Sales-Pardo M., Guimerà R., Moreira A.A., Amaral L.A.N., PNAS 104, 15224 (2007)Google Scholar
  4. Fortunato S. (2009) [arXiv:0906.0612]Google Scholar
  5. Newman M.E.J., Girvan M., Phys. Rev. E 69, 026113 (2004)Google Scholar
  6. Newman M., Leicht E., Phys. Rep. 486, 75 (2010)Google Scholar
  7. Clauset A., Moore C., Newman M., Nature 453, 98 (2008)Google Scholar
  8. Hofman J., Wiggins C., Phys. Rev. Lett. 100, 258701 (2008)Google Scholar
  9. Rosvall M., C.Bergstrom T., PNAS 104, 7327 (2007)Google Scholar
  10. Ziv E., Middendorf M., C.Wiggins H., Phys. Rev. E 71, 046117 (2005)Google Scholar
  11. Donath W.E., Hoffman A., IBM Techn. Disclos. Bull. 15, 938 (1972)Google Scholar
  12. Eriksen K.A., Simonsen I., Maslov S., Sneppen K., Phys. Rev. Lett. 90, 148701 (2003)Google Scholar
  13. Delvenne J., Yaliraki S., Barahona M. (2008) [arXiv:0812.1811]Google Scholar
  14. Rosvall M., C.Bergstrom T., PNAS 105, 1118 (2008)Google Scholar
  15. Rissanen J., Automatica 14, 465 (1978)Google Scholar
  16. P. Grünwald, I.J. Myung, M. Pitt (eds.), Advances in minimum description length: theory and applications (MIT Press, London, England, 2005)Google Scholar
  17. Shannon C.E., Bell. Labs. Tech. J. 27, 379 (1948)Google Scholar
  18. http://www.mapequation.orgGoogle Scholar
  19. Huffman D., Proc. Inst. Radio Eng. 40, 1098 (1952)Google Scholar
  20. Brin S., Page L., Comp. Net. ISDN Syst. 33, 107 (1998)Google Scholar
  21. Boldi P., Santini M., Vigna S. (2009), ACM Trans. Inf. Sys. (in press)Google Scholar
  22. Newman M.E.J., Phys. Rev. E 69, 066133 (2004)Google Scholar
  23. Arenas A., Duch J., Fernández A., Gómez S., New. J. Phys. 9, 176 (2007)Google Scholar
  24. R. Guimerà, M. Sales-Pardo, L.A.N. Amaral, Phys. Rev. E 76, 036102 (2007)Google Scholar
  25. http://www.tp.umu.se/rosvall/code.htmlGoogle Scholar
  26. Clauset A., Newman M.E.J., Moore C., Phys. Rev. E 70, 066111 (2004)Google Scholar
  27. Wakita K., Tsurumi T. (2007) [arXiv:cs/07020480]Google Scholar
  28. Blondel V., Guillaume J., Lambiotte R. E., Mech, J. Stat. Mech.: Theory Exp. 2008, P10008 (2008)Google Scholar

Copyright information

© EDP Sciences and Springer 2009

Authors and Affiliations

  1. 1.Department of PhysicsUmeå UniversityUmeåSweden
  2. 2.Department of BiologyUniversity of WashingtonSeattleUSA

Personalised recommendations