Mapping Flows on Bipartite Networks

Abstract

Mapping network flows provides insight into the organization of networks, but even though many real-networks are bipartite, no method for mapping flows takes advantage of the bipartite structure. What do we miss by discarding this information and how can we use it to understand the structure of bipartite networks better? The map equation models network flows with a random walk and exploits the information-theoretic duality between compression and finding regularities to detect communities in networks. However, it does not use the fact that random walks in bipartite networks alternate between node types, information worth 1 bit. To make some or all of this information available to the map equation, we developed a coding scheme that remembers node types at different rates. We explored the community landscape of bipartite real-world networks from no node-type information to full node-type information and found that using node types at a higher rate generally leads to deeper community hierarchies and a higher resolution. The corresponding compression of network flows exceeds the amount of extra information provided. Consequently, taking advantage of the bipartite structure increases the resolution and reveals more network regularities.

References in corpus (12)

• Community detection in graphs
• Maps of random walks on complex networks reveal community structure
• Modularity and community detection in bipartite networks
• Module identification in bipartite and directed networks
• Parsimonious module inference in large networks
• Efficiently inferring community structure in bipartite networks
• Mapping higher-order network flows in memory and multilayer networks with Infomap
• Encoding dynamics for multiscale community detection: Markov time sweeping for the Map equation
• Efficient community detection of network flows for varying Markov times and bipartite networks
• Community Detection in Bipartite Networks with Stochastic Blockmodels
• A theoretical model for the associative nature of conference participation
• Associative nature of event participation dynamics: a network theory approach

Cited by in corpus (3)

• Community Detection with the Map Equation and Infomap: Theory and Applications
• Flow-based Community Detection in Hypergraphs
• Single-trajectory map equation