Compression of Flow Can Reveal Overlapping-Module Organization in Networks
2011 (English)In: Physical Review X, ISSN 2160-3308, Vol. 1, no 2, 021025Article in journal (Refereed) Published
To better understand the organization of overlapping modules in large networks with respect to flow, we introduce the map equation for overlapping modules. In this information-theoretic framework, we use the correspondence between compression and regularity detection. The generalized map equation measures how well we can compress a description of flow in the network when we partition it into modules with possible overlaps. When we minimize the generalized map equation over overlapping network partitions, we detect modules that capture flow and determine which nodes at the boundaries between modules should be classified in multiple modules and to what degree. With a novel greedy-search algorithm, we find that some networks, for example, the neural network of the nematode Caenorhabditis elegans, are best described by modules dominated by hard boundaries, but that others, for example, the sparse European-roads network, have an organization of highly overlapping modules.
Place, publisher, year, edition, pages
College Park, Md.: American Physical Society , 2011. Vol. 1, no 2, 021025
Condensed Matter Physics
IdentifiersURN: urn:nbn:se:umu:diva-51246DOI: 10.1103/PhysRevX.1.021025ISI: 000310508700001OAI: oai:DiVA.org:umu-51246DiVA: diva2:477960
FunderSwedish Research Council, 2009-5344