Compression of Flow Can Reveal Overlapping-Module Organization in Networks

Details Compression of Flow Can Reveal Overlapping-Module Organization in Networks Compression of Flow Can Reveal Overlapping-Module Organization in Networks

2011-05-04

arxiv.org/abs/1105.0812v4

Phys. Rev. X 1, 021025 (2011)

Physics

Physics and Society

11 pages

Scientific paper

10.1103/PhysRevX.1.021025

To better understand the overlapping modular organization of large networks with respect to flow, here 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 C. Elegans, are best described by modules dominated by hard boundaries, but that others, for example, the sparse European road network, have a highly overlapping modular organization.

Affiliated with

Also associated with

No associations

Rating

Compression of Flow Can Reveal Overlapping-Module Organization in Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Compression of Flow Can Reveal Overlapping-Module Organization in Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compression of Flow Can Reveal Overlapping-Module Organization in Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-689500